About the Project

modular%20form

AdvancedHelp

(0.001 seconds)

5 matching pages

1: Software Index
Open Source With Book Commercial
20 Theta Functions
23 Weierstrass Elliptic and Modular Functions
  • Open Source Collections and Systems.

    These are collections of software (e.g. libraries) or interactive systems of a somewhat broad scope. Contents may be adapted from research software or may be contributed by project participants who donate their services to the project. The software is made freely available to the public, typically in source code form. While formal support of the collection may not be provided by its developers, within active projects there is often a core group who donate time to consider bug reports and make updates to the collection.

  • 2: 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.
  • 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.
  • G. Cornell, J. H. Silverman, and G. Stevens (Eds.) (1997) Modular Forms and Fermat’s Last Theorem. Springer-Verlag, New York.
  • J. E. Cremona (1997) Algorithms for Modular Elliptic Curves. 2nd edition, Cambridge University Press, Cambridge.
  • 3: 27.2 Functions
    Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … An equivalent form states that the n th prime p n (when the primes are listed in increasing order) is asymptotic to n ln n as n : …
    27.2.8 a ϕ ( n ) 1 ( mod n ) ,
    and if ϕ ( n ) is the smallest positive integer f such that a f 1 ( mod n ) , then a is a primitive root mod n . …
    Table 27.2.2: Functions related to division.
    n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n )
    7 6 2 8 20 8 6 42 33 20 4 48 46 22 4 72
    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.
  • S. Kida (1981) A vortex filament moving without change of form. J. Fluid Mech. 112, pp. 397–409.
  • 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.
  • N. Koblitz (1993) Introduction to Elliptic Curves and Modular Forms. 2nd edition, Graduate Texts in Mathematics, Vol. 97, Springer-Verlag, New York.
  • 5: Bibliography M
  • H. Maass (1971) Siegel’s modular forms and Dirichlet series. Lecture Notes in Mathematics, Vol. 216, Springer-Verlag, Berlin.
  • A. J. MacLeod (1996b) Rational approximations, software and test methods for sine and cosine integrals. Numer. Algorithms 12 (3-4), pp. 259–272.
  • P. Maroni (1995) An integral representation for the Bessel form. J. Comput. Appl. Math. 57 (1-2), pp. 251–260.
  • Fr. Mechel (1966) Calculation of the modified Bessel functions of the second kind with complex argument. Math. Comp. 20 (95), pp. 407–412.
  • D. S. Moak (1981) The q -analogue of the Laguerre polynomials. J. Math. Anal. Appl. 81 (1), pp. 20–47.