About the Project

Coinbase Toll Free Number 1205{892}1862 Customer Support USA Helpline

AdvancedHelp

(0.001 seconds)

21—30 of 254 matching pages

21: 19.13 Integrals of Elliptic Integrals
Cvijović and Klinowski (1994) contains fractional integrals (with free parameters) for F ( ϕ , k ) and E ( ϕ , k ) , together with special cases. …
22: 31.7 Relations to Other Functions
Other reductions of H to a F 1 2 , with at least one free parameter, exist iff the pair ( a , p ) takes one of a finite number of values, where q = α β p . …
23: Bibliography S
  • SAGE (free interactive system)
  • M. R. Schroeder (2006) Number Theory in Science and Communication: With Applications in Cryptography, Physics, Digital Information, Computing, and Self-Similarity. 4th edition, Springer-Verlag, Berlin.
  • SLATEC (free Fortran library)
  • I. Sh. Slavutskiĭ (1995) Staudt and arithmetical properties of Bernoulli numbers. Historia Sci. (2) 5 (1), pp. 69–74.
  • I. Sh. Slavutskiĭ (1999) About von Staudt congruences for Bernoulli numbers. Comment. Math. Univ. St. Paul. 48 (2), pp. 137–144.
  • 24: Bibliography C
  • L. Carlitz (1953) Some congruences for the Bernoulli numbers. Amer. J. Math. 75 (1), pp. 163–172.
  • L. Carlitz (1954a) q -Bernoulli and Eulerian numbers. Trans. Amer. Math. Soc. 76 (2), pp. 332–350.
  • L. Carlitz (1954b) A note on Euler numbers and polynomials. Nagoya Math. J. 7, pp. 35–43.
  • CEPHES (free C library)
  • CoStLy (free C-XSC library)
  • 25: Bibliography G
  • K. Girstmair (1990b) Dirichlet convolution of cotangent numbers and relative class number formulas. Monatsh. Math. 110 (3-4), pp. 231–256.
  • J. W. L. Glaisher (1940) Number-Divisor Tables. British Association Mathematical Tables, Vol. VIII, Cambridge University Press, Cambridge, England.
  • H. W. Gould (1960) Stirling number representation problems. Proc. Amer. Math. Soc. 11 (3), pp. 447–451.
  • H. W. Gould (1972) Explicit formulas for Bernoulli numbers. Amer. Math. Monthly 79, pp. 44–51.
  • GSL (free C library) GNU Scientific Library The GNU Project.
  • 26: Bille C. Carlson
    This symmetry led to the development of symmetric elliptic integrals, which are free from the transformations of modulus and amplitude that complicate the Legendre theory. …
    27: 26.11 Integer Partitions: Compositions
    c ( n ) denotes the number of compositions of n , and c m ( n ) is the number of compositions into exactly m parts. c ( T , n ) is the number of compositions of n with no 1’s, where again T = { 2 , 3 , 4 , } . …
    26.11.1 c ( 0 ) = c ( T , 0 ) = 1 .
    The Fibonacci numbers are determined recursively by … Additional information on Fibonacci numbers can be found in Rosen et al. (2000, pp. 140–145).
    28: 27.18 Methods of Computation: Primes
    §27.18 Methods of Computation: Primes
    An overview of methods for precise counting of the number of primes not exceeding an arbitrary integer x is given in Crandall and Pomerance (2005, §3.7). …An analytic approach using a contour integral of the Riemann zeta function (§25.2(i)) is discussed in Borwein et al. (2000). … These algorithms are used for testing primality of Mersenne numbers, 2 n 1 , and Fermat numbers, 2 2 n + 1 . …
    29: 31.2 Differential Equations
    The total number of free parameters is six. …
    31.2.11 d 2 W / d ξ 2 + ( H + b 0 ( ξ ) + b 1 ( ξ + ω 1 ) + b 2 ( ξ + ω 2 ) + b 3 ( ξ + ω 3 ) ) W = 0 ,
    30: 26.6 Other Lattice Path Numbers
    §26.6 Other Lattice Path Numbers
    Delannoy Number D ( m , n )
    Motzkin Number M ( n )
    Narayana Number N ( n , k )
    §26.6(iv) Identities