About the Project

Bailey%20pairs

AdvancedHelp

(0.001 seconds)

21—30 of 183 matching pages

21: 18.18 Sums
and a similar pair of equations by symmetry; compare the second row in Table 18.6.1. … For the Poisson kernel of Jacobi polynomials (the Bailey formula) see Bailey (1938). …
22: 16.12 Products
23: 17.7 Special Cases of Higher ϕ s r Functions
q -Analog of Bailey’s F 1 2 ( 1 ) Sum
First q -Analog of Bailey’s F 3 4 ( 1 ) Sum
Second q -Analog of Bailey’s F 3 4 ( 1 ) Sum
Bailey’s Nonterminating Extension of Jackson’s ϕ 7 8 Sum
24: 8 Incomplete Gamma and Related
Functions
25: 28 Mathieu Functions and Hill’s Equation
26: Bibliography F
  • FDLIBM (free C library)
  • S. Fempl (1960) Sur certaines sommes des intégral-cosinus. Bull. Soc. Math. Phys. Serbie 12, pp. 13–20 (French).
  • H. E. Fettis and J. C. Caslin (1964) Tables of Elliptic Integrals of the First, Second, and Third Kind. Technical report Technical Report ARL 64-232, Aerospace Research Laboratories, Wright-Patterson Air Force Base, Ohio.
  • G. Freud (1969) On weighted polynomial approximation on the whole real axis. Acta Math. Acad. Sci. Hungar. 20, pp. 223–225.
  • Y. Fukui and T. Horiguchi (1992) Characteristic values of the integral equation satisfied by the Mathieu functions and its application to a system with chirality-pair interaction on a one-dimensional lattice. Phys. A 190 (3-4), pp. 346–362.
  • 27: 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.

  • 28: 23 Weierstrass Elliptic and Modular
    Functions
    29: 24.19 Methods of Computation
    For number-theoretic applications it is important to compute B 2 n ( mod p ) for 2 n p 3 ; in particular to find the irregular pairs ( 2 n , p ) for which B 2 n 0 ( mod p ) . We list here three methods, arranged in increasing order of efficiency. …
  • A method related to “Stickelberger codes” is applied in Buhler et al. (2001); in particular, it allows for an efficient search for the irregular pairs ( 2 n , p ) . Discrete Fourier transforms are used in the computations. See also Crandall (1996, pp. 120–124).

  • 30: 16.4 Argument Unity
    Methods of deriving such identities are given by Bailey (1964), Rainville (1960), Raynal (1979), and Wilson (1978). … See Bailey (1964, pp. 19–22). … See Raynal (1979), Wilson (1978), and Bailey (1964). … See Bailey (1964, §4.4(4)). … See Bailey (1964, §§4.3(7) and 7.6(1)) for the transformation formulas and Wilson (1978) for contiguous relations. …