About the Project

number%20of

AdvancedHelp

(0.002 seconds)

21—30 of 42 matching pages

21: Tom M. Apostol
Apostol was born on August 20, 1923. … He was internationally known for his textbooks on calculus, analysis, and analytic number theory, which have been translated into five languages, and for creating Project MATHEMATICS!, a series of video programs that bring mathematics to life with computer animation, live action, music, and special effects. … In 1998, the Mathematical Association of America (MAA) awarded him the annual Trevor Evans Award, presented to authors of an exceptional article that is accessible to undergraduates, for his piece entitled “What Is the Most Surprising Result in Mathematics?” (Answer: the prime number theorem). …
  • 22: 9.7 Asymptotic Expansions
    9.7.3 χ ( x ) π 1 / 2 Γ ( 1 2 x + 1 ) / Γ ( 1 2 x + 1 2 ) .
    9.7.4 χ ( x ) ( 1 2 π x ) 1 / 2 .
    Numerical values of χ ( n ) are given in Table 9.7.1 for n = 1 ( 1 ) 20 to 2D.
    Table 9.7.1: χ ( n ) .
    n χ ( n ) n χ ( n ) n χ ( n ) n χ ( n )
    5 2.95 10 4.06 15 4.94 20 5.68
    23: 26.9 Integer Partitions: Restricted Number and Part Size
    §26.9 Integer Partitions: Restricted Number and Part Size
    p k ( n ) denotes the number of partitions of n into at most k parts. See Table 26.9.1. … It follows that p k ( n ) also equals the number of partitions of n into parts that are less than or equal to k . …
    24: 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.
  • S. Fillebrown (1992) Faster computation of Bernoulli numbers. J. Algorithms 13 (3), pp. 431–445.
  • G. Freud (1969) On weighted polynomial approximation on the whole real axis. Acta Math. Acad. Sci. Hungar. 20, pp. 223–225.
  • 25: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
    ( n n 1 , n 2 , , n k ) is the number of ways of placing n = n 1 + n 2 + + n k distinct objects into k labeled boxes so that there are n j objects in the j th box. It is also the number of k -dimensional lattice paths from ( 0 , 0 , , 0 ) to ( n 1 , n 2 , , n k ) . … M 2 is the number of permutations of { 1 , 2 , , n } with a 1 cycles of length 1, a 2 cycles of length 2, , and a n cycles of length n :
    26.4.7 M 2 = n ! 1 a 1 ( a 1 ! )  2 a 2 ( a 2 ! ) n a n ( a n ! ) .
    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 : …
    26: Bibliography K
  • M. Kaneko (1997) Poly-Bernoulli numbers. J. Théor. Nombres Bordeaux 9 (1), pp. 221–228.
  • R. B. Kearfott, M. Dawande, K. Du, and C. Hu (1994) Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library. ACM Trans. Math. Software 20 (4), pp. 447–459.
  • M. K. Kerimov (1980) Methods of computing the Riemann zeta-function and some generalizations of it. USSR Comput. Math. and Math. Phys. 20 (6), pp. 212–230.
  • A. V. Kitaev and A. H. Vartanian (2004) Connection formulae for asymptotics of solutions of the degenerate third Painlevé equation. I. Inverse Problems 20 (4), pp. 1165–1206.
  • T. H. Koornwinder (2009) The Askey scheme as a four-manifold with corners. Ramanujan J. 20 (3), pp. 409–439.
  • 27: 26.3 Lattice Paths: Binomial Coefficients
    ( m n ) is the number of ways of choosing n objects from a collection of m distinct objects without regard to order. ( m + n n ) is the number of lattice paths from ( 0 , 0 ) to ( m , n ) . …The number of lattice paths from ( 0 , 0 ) to ( m , n ) , m n , that stay on or above the line y = x is ( m + n m ) ( m + n m 1 ) .
    Table 26.3.1: Binomial coefficients ( m n ) .
    m n
    6 1 6 15 20 15 6 1
    Table 26.3.2: Binomial coefficients ( m + n m ) for lattice paths.
    m n
    3 1 4 10 20 35 56 84 120 165
    28: Bibliography N
  • W. Narkiewicz (2000) The Development of Prime Number Theory: From Euclid to Hardy and Littlewood. Springer-Verlag, Berlin.
  • D. Naylor (1989) On an integral transform involving a class of Mathieu functions. SIAM J. Math. Anal. 20 (6), pp. 1500–1513.
  • W. J. Nellis and B. C. Carlson (1966) Reduction and evaluation of elliptic integrals. Math. Comp. 20 (94), pp. 223–231.
  • E. W. Ng and M. Geller (1969) A table of integrals of the error functions. J. Res. Nat. Bur. Standards Sect B. 73B, pp. 1–20.
  • Number Theory Web (website)
  • 29: Bibliography M
  • A. J. MacLeod (1996b) Rational approximations, software and test methods for sine and cosine integrals. Numer. Algorithms 12 (3-4), pp. 259–272.
  • W. Magnus and S. Winkler (1966) Hill’s Equation. Interscience Tracts in Pure and Applied Mathematics, No. 20, Interscience Publishers John Wiley & Sons, New York-London-Sydney.
  • Fr. Mechel (1966) Calculation of the modified Bessel functions of the second kind with complex argument. Math. Comp. 20 (95), pp. 407–412.
  • R. Metzler, J. Klafter, and J. Jortner (1999) Hierarchies and logarithmic oscillations in the temporal relaxation patterns of proteins and other complex systems. Proc. Nat. Acad. Sci. U .S. A. 96 (20), pp. 11085–11089.
  • D. S. Moak (1981) The q -analogue of the Laguerre polynomials. J. Math. Anal. Appl. 81 (1), pp. 20–47.
  • 30: Bibliography V
  • A. J. van der Poorten (1980) Some Wonderful Formulas an Introduction to Polylogarithms. In Proceedings of the Queen’s Number Theory Conference, 1979 (Kingston, Ont., 1979), R. Ribenboim (Ed.), Queen’s Papers in Pure and Appl. Math., Vol. 54, Kingston, Ont., pp. 269–286.
  • I. M. Vinogradov (1937) Representation of an odd number as a sum of three primes (Russian). Dokl. Akad. Nauk SSSR 15, pp. 169–172 (Russian).
  • H. Volkmer (2004a) Error estimates for Rayleigh-Ritz approximations of eigenvalues and eigenfunctions of the Mathieu and spheroidal wave equation. Constr. Approx. 20 (1), pp. 39–54.
  • M. N. Vrahatis, O. Ragos, T. Skiniotis, F. A. Zafiropoulos, and T. N. Grapsa (1995) RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions. Comput. Phys. Comm. 92 (2-3), pp. 252–266.