About the Project

fundamental theorem of arithmetic

AdvancedHelp

(0.002 seconds)

21—30 of 166 matching pages

21: 4.44 Other Applications
§4.44 Other Applications
For applications of generalized exponentials and generalized logarithms to computer arithmetic see §3.1(iv). …
22: 27.17 Other Applications
§27.17 Other Applications
Reed et al. (1990, pp. 458–470) describes a number-theoretic approach to Fourier analysis (called the arithmetic Fourier transform) that uses the Möbius inversion (27.5.7) to increase efficiency in computing coefficients of Fourier series. …
23: 27.14 Unrestricted Partitions
A fundamental problem studies the number of ways n can be written as a sum of positive integers n , that is, the number of solutions of … Euler’s pentagonal number theorem states that …
24: 4.48 Software
All scientific programming languages, libraries, and systems support computation of at least some of the elementary functions in standard floating-point arithmetic3.1(i)). … Here we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter when the arithmetic is nonstandard. … A more complete list of available software for computing these functions is found in the Software Index; again, software that uses only standard floating-point arithmetic is excluded. …
§4.48(ii) Interval Arithmetic
25: 1.2 Elementary Algebra
Binomial Theorem
Arithmetic Progression
§1.2(iv) Means
The arithmetic mean of n numbers a 1 , a 2 , , a n is
1.2.17 A = a 1 + a 2 + + a n n .
26: 3.12 Mathematical Constants
The fundamental constant …
27: 8.24 Physical Applications
With more general values of p , E p ( x ) supplies fundamental auxiliary functions that are used in the computation of molecular electronic integrals in quantum chemistry (Harris (2002), Shavitt (1963)), and also wave acoustics of overlapping sound beams (Ding (2000)).
28: Bibliography
  • W. A. Al-Salam (1990) Characterization theorems for orthogonal polynomials. In Orthogonal Polynomials (Columbus, OH, 1989), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., Vol. 294, pp. 1–24.
  • G. Almkvist and B. Berndt (1988) Gauss, Landen, Ramanujan, the arithmetic-geometric mean, ellipses, π , and the Ladies Diary. Amer. Math. Monthly 95 (7), pp. 585–608.
  • M. A. Anuta, D. W. Lozier, and P. R. Turner (1996) The MasPar MP-1 as a computer arithmetic laboratory. J. Res. Nat. Inst. Stand. Technol. 101 (2), pp. 165–174.
  • T. M. Apostol (1952) Theorems on generalized Dedekind sums. Pacific J. Math. 2 (1), pp. 1–9.
  • T. M. Apostol (2000) A Centennial History of the Prime Number Theorem. In Number Theory, Trends Math., pp. 1–14.
  • 29: 16.21 Differential Equation
    A fundamental set of solutions of (16.21.1) is given by …For other fundamental sets see Erdélyi et al. (1953a, §5.4) and Marichev (1984).
    30: 24.17 Mathematical Applications
    §24.17(iii) Number Theory
    Bernoulli and Euler numbers and polynomials occur in: number theory via (24.4.7), (24.4.8), and other identities involving sums of powers; the Riemann zeta function and L -series (§25.15, Apostol (1976), and Ireland and Rosen (1990)); arithmetic of cyclotomic fields and the classical theory of Fermat’s last theorem (Ribenboim (1979) and Washington (1997)); p -adic analysis (Koblitz (1984, Chapter 2)). …