About the Project

modular functions

AdvancedHelp

(0.003 seconds)

31—40 of 44 matching pages

31: 26.21 Tables
Abramowitz and Stegun (1964, Chapter 24) tabulates binomial coefficients ( m n ) for m up to 50 and n up to 25; extends Table 26.4.1 to n = 10 ; tabulates Stirling numbers of the first and second kinds, s ( n , k ) and S ( n , k ) , for n up to 25 and k up to n ; tabulates partitions p ( n ) and partitions into distinct parts p ( 𝒟 , n ) for n up to 500. Andrews (1976) contains tables of the number of unrestricted partitions, partitions into odd parts, partitions into parts ± 2 ( mod 5 ) , partitions into parts ± 1 ( mod 5 ) , and unrestricted plane partitions up to 100. …
32: 27.9 Quadratic Characters
§27.9 Quadratic Characters
If p does not divide n , then ( n | p ) has the value 1 when the quadratic congruence x 2 n ( mod p ) has a solution, and the value 1 when this congruence has no solution. The Legendre symbol ( n | p ) , as a function of n , is a Dirichlet character (mod p ). …
33: Frank Garvan
His research is in the areas of q -series and modular forms, and he enjoys using MAPLE in his research. …
  • 34: Bibliography K
  • S. L. Kalla (1992) On the evaluation of the Gauss hypergeometric function. C. R. Acad. Bulgare Sci. 45 (6), pp. 35–36.
  • R. P. Kanwal (1983) Generalized functions. Mathematics in Science and Engineering, Vol. 171, Academic Press, Inc., Orlando, FL.
  • N. Koblitz (1993) Introduction to Elliptic Curves and Modular Forms. 2nd edition, Graduate Texts in Mathematics, Vol. 97, Springer-Verlag, New York.
  • K. S. Kölbig (1970) Complex zeros of an incomplete Riemann zeta function and of the incomplete gamma function. Math. Comp. 24 (111), pp. 679–696.
  • K. S. Kölbig (1972c) Programs for computing the logarithm of the gamma function, and the digamma function, for complex argument. Comput. Phys. Comm. 4, pp. 221–226.
  • 35: Bibliography V
  • C. G. van der Laan and N. M. Temme (1984) Calculation of Special Functions: The Gamma Function, the Exponential Integrals and Error-Like Functions. CWI Tract, Vol. 10, Stichting Mathematisch Centrum, Centrum voor Wiskunde en Informatica, Amsterdam.
  • J. F. Van Diejen and V. P. Spiridonov (2001) Modular hypergeometric residue sums of elliptic Selberg integrals. Lett. Math. Phys. 58 (3), pp. 223–238.
  • A. van Wijngaarden (1953) On the coefficients of the modular invariant J ( τ ) . Nederl. Akad. Wetensch. Proc. Ser. A. 56 = Indagationes Math. 15 56, pp. 389–400.
  • R. S. Varma (1941) An infinite series of Weber’s parabolic cylinder functions. Proc. Benares Math. Soc. (N.S.) 3, pp. 37.
  • R. Vidūnas (2005) Transformations of some Gauss hypergeometric functions. J. Comput. Appl. Math. 178 (1-2), pp. 473–487.
  • 36: Bibliography C
  • B. C. Carlson (1985) The hypergeometric function and the R -function near their branch points. Rend. Sem. Mat. Univ. Politec. Torino (Special Issue), pp. 63–89.
  • B. C. Carlson (2006b) Table of integrals of squared Jacobian elliptic functions and reductions of related hypergeometric R -functions. Math. Comp. 75 (255), pp. 1309–1318.
  • A. P. Clarke and W. Marwood (1984) A compact mathematical function package. Australian Computer Journal 16 (3), pp. 107–114.
  • 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.
  • 37: 24.19 Methods of Computation
    For number-theoretic applications it is important to compute B 2 n ( mod p ) for 2 n p 3 ; in particular to find the irregular pairs ( 2 n , p ) for which B 2 n 0 ( mod p ) . …
  • Buhler et al. (1992) uses the expansion

    24.19.3 t 2 cosh t 1 = 2 n = 0 ( 2 n 1 ) B 2 n t 2 n ( 2 n ) ! ,

    and computes inverses modulo p of the left-hand side. Multisectioning techniques are applied in implementations. See also Crandall (1996, pp. 116–120).

  • 38: 27.2 Functions
    §27.2 Functions
    and if ϕ ( n ) is the smallest positive integer f such that a f 1 ( mod n ) , then a is a primitive root mod n . …This is Jordan’s function. … This is Liouville’s function. … This is Mangoldt’s function. …
    39: 27.12 Asymptotic Formulas: Primes
    27.12.1 lim n p n n ln n = 1 ,
    27.12.2 p n > n ln n , n = 1 , 2 , .
    where λ ( α ) depends only on α , and ϕ ( m ) is the Euler totient function27.2). … For example, if 2 n 2 ( mod n ) , then n is composite. … A Carmichael number is a composite number n for which b n b ( mod n ) for all b . …
    40: Mathematical Introduction
    Notation for the Special Functions
    The first section in each of the special function chapters (Chapters 5–36) lists notation that has been adopted for the functions in that chapter. … Similarly in the case of confluent hypergeometric functions13.2(i)). … Special functions with a complex variable are depicted as colored 3D surfaces in a similar way to functions of two real variables, but with the vertical height corresponding to the modulus (absolute value) of the function. … All of the special function chapters contain sections that describe available methods for computing the main functions in the chapter, and most also provide references to numerical tables of, and approximations for, these functions. …