About the Project

fundamental%20theorem%20of%20calculus

AdvancedHelp

(0.004 seconds)

1—10 of 221 matching pages

1: 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, …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).) … If ( a , n ) = 1 , then the Euler–Fermat theorem states that …
2: 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. …Their product m has 20 digits, twice the number of digits in the data. 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. …
3: 20 Theta Functions
Chapter 20 Theta Functions
4: Bibliography K
  • 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.
  • 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 (2009) The Askey scheme as a four-manifold with corners. Ramanujan J. 20 (3), pp. 409–439.
  • 5: 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.
  • 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.
  • P. J. Mohr and B. N. Taylor (2005) CODATA recommended values of the fundamental physical constants: 2002. Rev. Mod.Phys. 77, pp. 1–107.
  • 6: Bibliography G
  • W. Gautschi (1994) Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.
  • K. Girstmair (1990a) A theorem on the numerators of the Bernoulli numbers. Amer. Math. Monthly 97 (2), pp. 136–138.
  • K. Gottfried and T. Yan (2004) Quantum mechanics: fundamentals. Second edition, Springer-Verlag, New York.
  • Ya. I. Granovskiĭ, I. M. Lutzenko, and A. S. Zhedanov (1992) Mutual integrability, quadratic algebras, and dynamical symmetry. Ann. Phys. 217 (1), pp. 1–20.
  • 7: 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). …
    8: Peter L. Walker
    Walker’s books are An Introduction to Complex Analysis, published by Hilger in 1974, The Theory of Fourier Series and Integrals, published by Wiley in 1986, Elliptic Functions. A Constructive Approach, published by Wiley in 1996, and Examples and Theorems in Analysis, published by Springer in 2004. …
  • 9: 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. …
    10: 8 Incomplete Gamma and Related
    Functions