About the Project

multiple

AdvancedHelp

(0.001 seconds)

21—30 of 91 matching pages

21: 10.44 Sums
§10.44(i) Multiplication Theorem
22: 4.31 Special Values and Limits
Table 4.31.1: Hyperbolic functions: values at multiples of 1 2 π i .
z 0 1 2 π i π i 3 2 π i
23: 13.27 Mathematical Applications
Vilenkin (1968, Chapter 8) constructs irreducible representations of this group, in which the diagonal matrices correspond to operators of multiplication by an exponential function. …
24: 27.22 Software
  • Mathematica. PrimeQ combines strong pseudoprime tests for the bases 2 and 3 and a Lucas pseudoprime test. No known composite numbers pass these three tests, and Bleichenbacher (1996) has shown that this combination of tests proves primality for integers below 10 16 . Provable PrimeQ uses the Atkin–Goldwasser–Kilian–Morain Elliptic Curve Method to prove primality. FactorInteger tries Brent–Pollard rho, Pollard p 1 , and then cfrac after trial division. See §27.19. ecm is available also, and the Multiple Polynomial Quadratic sieve is expected in a future release.

    For additional Mathematica routines for factorization and primality testing, including several different pseudoprime tests, see Bressoud and Wagon (2000).

  • 25: 27.19 Methods of Computation: Factorization
    These algorithms include the Continued Fraction Algorithm (cfrac), the Multiple Polynomial Quadratic Sieve (mpqs), the General Number Field Sieve (gnfs), and the Special Number Field Sieve (snfs). …
    26: About Color Map
    In doing this, however, we would like to place the mathematically significant phase values, specifically the multiples of π / 2 correponding to the real and imaginary axes, at more immediately recognizable colors. … The conventional CMYK color wheel (not to be confused with the traditional Artist’s color wheel) places the additive colors (red, green, blue) and the subtractive colors (yellow, cyan, magenta) at multiples of 60 degrees. …
    27: 4.17 Special Values and Limits
    Table 4.17.1: Trigonometric functions: values at multiples of 1 12 π .
    θ sin θ cos θ tan θ csc θ sec θ cot θ
    28: 13.13 Addition and Multiplication Theorems
    §13.13 Addition and Multiplication Theorems
    §13.13(iii) Multiplication Theorems for M ( a , b , z ) and U ( a , b , z )
    29: 13.26 Addition and Multiplication Theorems
    §13.26 Addition and Multiplication Theorems
    §13.26(iii) Multiplication Theorems for M κ , μ ( z ) and W κ , μ ( z )
    30: Errata
  • Equation (17.6.1)
    17.6.1 ϕ 1 2 ( a , b c ; q , c / ( a b ) ) = ( c / a , c / b ; q ) ( c , c / ( a b ) ; q ) , | c | < | a b |

    The constraint | c | < | a b | was added.

  • Equation (17.11.2)
    17.11.2 Φ ( 2 ) ( a ; b , b ; c , c ; q ; x , y ) = ( b , a x ; q ) ( c , x ; q ) n , r 0 ( a , b ; q ) n ( c / b , x ; q ) r b r y n ( q , c ; q ) n ( q ; q ) r ( a x ; q ) n + r

    The factor ( q ) r originally used in the denominator has been corrected to be ( q ; q ) r .

  • Equation (17.4.6)

    The multi-product notation ( q , c ; q ) m ( q , c ; q ) n in the denominator of the right-hand side was used.

  • Equations (17.2.22) and (17.2.23)
    17.2.22 ( q a 1 2 , q a 1 2 ; q ) n ( a 1 2 , a 1 2 ; q ) n = ( a q 2 ; q 2 ) n ( a ; q 2 ) n = 1 a q 2 n 1 a
    17.2.23 ( q a 1 k , q ω k a 1 k , , q ω k k 1 a 1 k ; q ) n ( a 1 k , ω k a 1 k , , ω k k 1 a 1 k ; q ) n = ( a q k ; q k ) n ( a ; q k ) n = 1 a q k n 1 a

    The numerators of the leftmost fractions were corrected to read ( q a 1 2 , q a 1 2 ; q ) n and ( q a 1 k , q ω k a 1 k , , q ω k k 1 a 1 k ; q ) n instead of ( q a 1 2 , a q 1 2 ; q ) n and ( a q 1 k , q ω k a 1 k , , q ω k k 1 a 1 k ; q ) n , respectively.

    Reported 2017-06-26 by Jason Zhao.

  • References

    An addition was made to the Software Index to reflect a multiple precision (MP) package written in C++ which uses a variety of different MP interfaces. See Kormanyos (2011).