About the Project

prime%20numbers

AdvancedHelp

(0.002 seconds)

1—10 of 21 matching pages

1: 24.20 Tables
Wagstaff (1978) gives complete prime factorizations of N n and E n for n = 20 ( 2 ) 60 and n = 8 ( 2 ) 42 , respectively. …
2: 27.2 Functions
where p 1 , p 2 , , p ν ( n ) are the distinct prime factors of n , each exponent a r is positive, and ν ( n ) is the number of distinct primes dividing n . ( ν ( 1 ) is defined to be 0.) Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … (See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) …
§27.2(ii) Tables
3: 6.16 Mathematical Applications
§6.16(ii) Number-Theoretic Significance of li ( x )
If we assume Riemann’s hypothesis that all nonreal zeros of ζ ( s ) have real part of 1 2 25.10(i)), then
6.16.5 li ( x ) π ( x ) = O ( x ln x ) , x ,
where π ( x ) is the number of primes less than or equal to x . …
See accompanying text
Figure 6.16.2: The logarithmic integral li ( x ) , together with vertical bars indicating the value of π ( x ) for x = 10 , 20 , , 1000 . Magnify
4: 27.15 Chinese Remainder Theorem
§27.15 Chinese Remainder Theorem
This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …Choose four relatively prime moduli m 1 , m 2 , m 3 , and m 4 of five digits each, for example 2 16 3 , 2 16 1 , 2 16 + 1 , and 2 16 + 3 . Their product m has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
5: Bibliography C
  • R. Chelluri, L. B. Richmond, and N. M. Temme (2000) Asymptotic estimates for generalized Stirling numbers. Analysis (Munich) 20 (1), pp. 1–13.
  • J. Chen (1966) On the representation of a large even integer as the sum of a prime and the product of at most two primes. Kexue Tongbao (Foreign Lang. Ed.) 17, pp. 385–386.
  • M. Colman, A. Cuyt, and J. Van Deun (2011) Validated computation of certain hypergeometric functions. ACM Trans. Math. Software 38 (2), pp. Art. 11, 20.
  • M. D. Cooper, R. H. Jeppesen, and M. B. Johnson (1979) Coulomb effects in the Klein-Gordon equation for pions. Phys. Rev. C 20 (2), pp. 696–704.
  • R. Crandall and C. Pomerance (2005) Prime Numbers: A Computational Perspective. 2nd edition, Springer-Verlag, New York.
  • 6: 26.12 Plane Partitions
    Then the number of plane partitions in B ( r , s , t ) is … The number of symmetric plane partitions in B ( r , r , t ) is … The number of cyclically symmetric plane partitions in B ( r , r , r ) is … The number of descending plane partitions in B ( r , r , r ) is …
    7: 26.10 Integer Partitions: Other Restrictions
    p ( 𝒟 , n ) denotes the number of partitions of n into distinct parts. p m ( 𝒟 , n ) denotes the number of partitions of n into at most m distinct parts. p ( 𝒟 k , n ) denotes the number of partitions of n into parts with difference at least k . p ( 𝒟 3 , n ) denotes the number of partitions of n into parts with difference at least 3, except that multiples of 3 must differ by at least 6. p ( 𝒪 , n ) denotes the number of partitions of n into odd parts. …
    8: 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). …
  • 9: 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)
  • 10: 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.