About the Project
NIST

fundamental theorem of arithmetic

AdvancedHelp

(0.002 seconds)

1—10 of 154 matching pages

1: 19.8 Quadratic Transformations
§19.8(i) Gauss’s Arithmetic-Geometric Mean (AGM)
As n , a n and g n converge to a common limit M ( a 0 , g 0 ) called the AGM (Arithmetic-Geometric Mean) of a 0 and g 0 . …showing that the convergence of c n to 0 and of a n and g n to M ( a 0 , g 0 ) is quadratic in each case. … Again, p n and ε n converge quadratically to M ( a 0 , g 0 ) and 0, respectively, and Q n converges to 0 faster than quadratically. …
2: 27.2 Functions
§27.2(i) Definitions
Functions in this section derive their properties from the fundamental theorem of arithmetic, which states that every integer n > 1 can be represented uniquely as a product of prime powers, … (See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) This result, first proved in Hadamard (1896) and de la Vallée Poussin (1896a, b), is known as the prime number theorem. … If ( a , n ) = 1 , then the Euler–Fermat theorem states that …
3: 28.29 Definitions and Basic Properties
§28.29(ii) Floquet’s Theorem and the Characteristic Exponent
28.29.4 w I ( z + π , λ ) = w I ( π , λ ) w I ( z , λ ) + w I ( π , λ ) w II ( z , λ ) ,
28.29.5 w II ( z + π , λ ) = w II ( π , λ ) w I ( z , λ ) + w II ( π , λ ) w II ( z , λ ) .
If ν ( 0 , 1 ) is a solution of (28.29.9), then F ν ( z ) , F - ν ( z ) comprise a fundamental pair of solutions of Hill’s equation. …
4: 27.15 Chinese Remainder Theorem
§27.15 Chinese Remainder Theorem
The Chinese remainder theorem states that a system of congruences x a 1 ( mod m 1 ) , , x a k ( mod m k ) , always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod m ), where m is the product of the moduli. This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod m 1 ), (mod m 2 ), (mod m 3 ), and (mod m 4 ), respectively. …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: 27.4 Euler Products and Dirichlet Series
The fundamental theorem of arithmetic is linked to analysis through the concept of the Euler product. …
6: 28.2 Definitions and Basic Properties
(28.2.1) possesses a fundamental pair of solutions w I ( z ; a , q ) , w II ( z ; a , q ) called basic solutions with …
28.2.6 𝒲 { w I , w II } = 1 ,
§28.2(iii) Floquet’s Theorem and the Characteristic Exponents
If q 0 , then for a given value of ν the corresponding Floquet solution is unique, except for an arbitrary constant factor (Theorem of Ince; see also 28.5(i)). …
7: 28.27 Addition Theorems
§28.27 Addition Theorems
Addition theorems provide important connections between Mathieu functions with different parameters and in different coordinate systems. They are analogous to the addition theorems for Bessel functions (§10.23(ii)) and modified Bessel functions (§10.44(ii)). …
8: Bibliography C
  • L. Carlitz (1961b) The Staudt-Clausen theorem. Math. Mag. 34, pp. 131–146.
  • B. C. Carlson (1978) Short proofs of three theorems on elliptic integrals. SIAM J. Math. Anal. 9 (3), pp. 524–528.
  • H. S. Cohl (2013a) Fourier, Gegenbauer and Jacobi expansions for a power-law fundamental solution of the polyharmonic equation and polyspherical addition theorems. SIGMA Symmetry Integrability Geom. Methods Appl. 9, pp. Paper 042, 26.
  • D. A. Cox (1984) The arithmetic-geometric mean of Gauss. Enseign. Math. (2) 30 (3-4), pp. 275–330.
  • D. A. Cox (1985) Gauss and the arithmetic-geometric mean. Notices Amer. Math. Soc. 32 (2), pp. 147–151.
  • 9: Bibliography K
  • R. B. Kearfott (1996) Algorithm 763: INTERVAL_ARITHMETIC: A Fortran 90 module for an interval data type. ACM Trans. Math. Software 22 (4), pp. 385–392.
  • Y. S. Kim, A. K. Rathie, and R. B. Paris (2013) An extension of Saalschütz’s summation theorem for the series F r + 2 r + 3 . Integral Transforms Spec. Funct. 24 (11), pp. 916–921.
  • B. J. King and A. L. Van Buren (1973) A general addition theorem for spheroidal wave functions. SIAM J. Math. Anal. 4 (1), pp. 149–160.
  • D. E. Knuth (1968) The Art of Computer Programming. Vol. 1: Fundamental Algorithms. 1st edition, Addison-Wesley Publishing Co., Reading, MA-London-Don Mills, Ont.
  • T. H. Koornwinder (1975a) A new proof of a Paley-Wiener type theorem for the Jacobi transform. Ark. Mat. 13, pp. 145–159.
  • 10: 24.10 Arithmetic Properties
    §24.10 Arithmetic Properties
    §24.10(i) Von Staudt–Clausen Theorem