About the Project

fundamental theorem of calculus

AdvancedHelp

(0.001 seconds)

11—20 of 146 matching pages

11: 24.17 Mathematical Applications
Calculus of Finite Differences
§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)). …
12: 27.4 Euler Products and Dirichlet Series
The fundamental theorem of arithmetic is linked to analysis through the concept of the Euler product. …
13: Leonard C. Maximon
Maximon published numerous papers on the fundamental processes of quantum electrodynamics and on the special functions of mathematical physics. …
14: Bibliography R
  • E. M. Rains (1998) Normal limit theorems for symmetric random matrices. Probab. Theory Related Fields 112 (3), pp. 411–423.
  • P. Ribenboim (1979) 13 Lectures on Fermat’s Last Theorem. Springer-Verlag, New York.
  • S. Roman (1984) The umbral calculus. Pure and Applied Mathematics, Vol. 111, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], New York.
  • G. Rota, D. Kahaner, and A. Odlyzko (1973) On the foundations of combinatorial theory. VIII. Finite operator calculus. J. Math. Anal. Appl. 42, pp. 684–760.
  • G. B. Rybicki (1989) Dawson’s integral and the sampling theorem. Computers in Physics 3 (2), pp. 85–87.
  • 15: 1.5 Calculus of Two or More Variables
    §1.5 Calculus of Two or More Variables
    Implicit Function Theorem
    §1.5(iii) Taylor’s Theorem; Maxima and Minima
    §1.5(iv) Leibniz’s Theorem for Differentiation of Integrals
    16: 17.2 Calculus
    §17.2 Calculus
    §17.2(i) q -Calculus
    §17.2(iii) Binomial Theorem
    In the limit as q 1 , (17.2.35) reduces to the standard binomial theorem
    17: 1.9 Calculus of a Complex Variable
    §1.9 Calculus of a Complex Variable
    DeMoivre’s Theorem
    Cauchy’s Theorem
    Liouville’s Theorem
    Dominated Convergence Theorem
    18: 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 …
    19: 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. …
    20: 24.4 Basic Properties
    Raabe’s Theorem
    24.4.39 E n ( x + h ) = ( E ( x ) + h ) n .
    For these results and also connections with the umbral calculus see Gessel (2003). …