About the Project

Julia%20sets

AdvancedHelp

(0.002 seconds)

11—20 of 605 matching pages

11: 27.2 Functions
Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … Gauss and Legendre conjectured that π ( x ) is asymptotic to x / ln x as x : … Such a set is a reduced residue system modulo n . …
Table 27.2.2: Functions related to division.
n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n )
5 4 2 6 18 6 6 39 31 30 2 32 44 20 6 84
7 6 2 8 20 8 6 42 33 20 4 48 46 22 4 72
12: 25.20 Approximations
  • Cody et al. (1971) gives rational approximations for ζ ( s ) in the form of quotients of polynomials or quotients of Chebyshev series. The ranges covered are 0.5 s 5 , 5 s 11 , 11 s 25 , 25 s 55 . Precision is varied, with a maximum of 20S.

  • Antia (1993) gives minimax rational approximations for Γ ( s + 1 ) F s ( x ) , where F s ( x ) is the Fermi–Dirac integral (25.12.14), for the intervals < x 2 and 2 x < , with s = 1 2 , 1 2 , 3 2 , 5 2 . For each s there are three sets of approximations, with relative maximum errors 10 4 , 10 8 , 10 12 .

  • 13: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
    §26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
    (The empty set is considered to have one permutation consisting of no cycles.) M 3 is the number of set partitions of { 1 , 2 , , n } with a 1 subsets of size 1, a 2 subsets of size 2, , and a n subsets of size n : …
    Table 26.4.1: Multinomials and partitions.
    n m λ M 1 M 2 M 3
    5 3 1 2 , 3 1 20 20 10
    14: 8 Incomplete Gamma and Related
    Functions
    15: 28 Mathieu Functions and Hill’s Equation
    16: 26.13 Permutations: Cycle Notation
    𝔖 n denotes the set of permutations of { 1 , 2 , , n } . σ 𝔖 n is a one-to-one and onto mapping from { 1 , 2 , , n } to itself. … The number of elements of 𝔖 n with cycle type ( a 1 , a 2 , , a n ) is given by (26.4.7). … The derangement number, d ( n ) , is the number of elements of 𝔖 n with no fixed points: … Given a permutation σ 𝔖 n , the inversion number of σ , denoted inv ( σ ) , is the least number of adjacent transpositions required to represent σ . …
    17: 7.23 Tables
  • Abramowitz and Stegun (1964, Chapter 7) includes erf x , ( 2 / π ) e x 2 , x [ 0 , 2 ] , 10D; ( 2 / π ) e x 2 , x [ 2 , 10 ] , 8S; x e x 2 erfc x , x 2 [ 0 , 0.25 ] , 7D; 2 n Γ ( 1 2 n + 1 ) i n erfc ( x ) , n = 1 ( 1 ) 6 , 10 , 11 , x [ 0 , 5 ] , 6S; F ( x ) , x [ 0 , 2 ] , 10D; x F ( x ) , x 2 [ 0 , 0.25 ] , 9D; C ( x ) , S ( x ) , x [ 0 , 5 ] , 7D; f ( x ) , g ( x ) , x [ 0 , 1 ] , x 1 [ 0 , 1 ] , 15D.

  • Zhang and Jin (1996, pp. 637, 639) includes ( 2 / π ) e x 2 , erf x , x = 0 ( .02 ) 1 ( .04 ) 3 , 8D; C ( x ) , S ( x ) , x = 0 ( .2 ) 10 ( 2 ) 100 ( 100 ) 500 , 8D.

  • Zhang and Jin (1996, pp. 638, 640–641) includes the real and imaginary parts of erf z , x [ 0 , 5 ] , y = 0.5 ( .5 ) 3 , 7D and 8D, respectively; the real and imaginary parts of x e ± i t 2 d t , ( 1 / π ) e i ( x 2 + ( π / 4 ) ) x e ± i t 2 d t , x = 0 ( .5 ) 20 ( 1 ) 25 , 8D, together with the corresponding modulus and phase to 8D and 6D (degrees), respectively.

  • 18: 8.26 Tables
  • Khamis (1965) tabulates P ( a , x ) for a = 0.05 ( .05 ) 10 ( .1 ) 20 ( .25 ) 70 , 0.0001 x 250 to 10D.

  • Abramowitz and Stegun (1964, pp. 245–248) tabulates E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x = 0 ( .01 ) 2 to 7D; also ( x + n ) e x E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x 1 = 0 ( .01 ) 0.1 ( .05 ) 0.5 to 6S.

  • Pagurova (1961) tabulates E n ( x ) for n = 0 ( 1 ) 20 , x = 0 ( .01 ) 2 ( .1 ) 10 to 4-9S; e x E n ( x ) for n = 2 ( 1 ) 10 , x = 10 ( .1 ) 20 to 7D; e x E p ( x ) for p = 0 ( .1 ) 1 , x = 0.01 ( .01 ) 7 ( .05 ) 12 ( .1 ) 20 to 7S or 7D.

  • Zhang and Jin (1996, Table 19.1) tabulates E n ( x ) for n = 1 , 2 , 3 , 5 , 10 , 15 , 20 , x = 0 ( .1 ) 1 , 1.5 , 2 , 3 , 5 , 10 , 20 , 30 , 50 , 100 to 7D or 8S.

  • 19: 23 Weierstrass Elliptic and Modular
    Functions
    20: 5.22 Tables
    Abramowitz and Stegun (1964, Chapter 6) tabulates Γ ( x ) , ln Γ ( x ) , ψ ( x ) , and ψ ( x ) for x = 1 ( .005 ) 2 to 10D; ψ ′′ ( x ) and ψ ( 3 ) ( x ) for x = 1 ( .01 ) 2 to 10D; Γ ( n ) , 1 / Γ ( n ) , Γ ( n + 1 2 ) , ψ ( n ) , log 10 Γ ( n ) , log 10 Γ ( n + 1 3 ) , log 10 Γ ( n + 1 2 ) , and log 10 Γ ( n + 2 3 ) for n = 1 ( 1 ) 101 to 8–11S; Γ ( n + 1 ) for n = 100 ( 100 ) 1000 to 20S. Zhang and Jin (1996, pp. 67–69 and 72) tabulates Γ ( x ) , 1 / Γ ( x ) , Γ ( x ) , ln Γ ( x ) , ψ ( x ) , ψ ( x ) , ψ ( x ) , and ψ ( x ) for x = 0 ( .1 ) 5 to 8D or 8S; Γ ( n + 1 ) for n = 0 ( 1 ) 100 ( 10 ) 250 ( 50 ) 500 ( 100 ) 3000 to 51S. …