modular functions

SearchAdvancedHelp

(0.003 seconds)

21—30 of 44 matching pages

21: Software Index

… ► ►►►

	Open Source													With Book						Commercial
…
23 Weierstrass Elliptic and Modular Functions
…

…

22: Bibliography

… ►

Modular Functions and Dirichlet Series in Number Theory. 2nd edition, Graduate Texts in Mathematics, Vol. 41, Springer-Verlag, New York.

ⓘ

External Links:

ISBN 0-387-97127-0, MathReview, ZentralBlatt

Referenced by:

§17.2(i), §23.10(iv), §23.15(i), §23.17(ii), §23.18, §23.18, §23.19, §23.20(i), §23.20(v), Ch.23, §27.14(iii), §27.14(iv), §27.14(vi), §27.7, Ch.27.

Encodings:

BibTeX

…

23: Bibliography S

… ►

Topics in Complex Function Theory. Vol. III: Abelian Functions and Modular Functions of Several Variables. Interscience Tracts in Pure and Applied Mathematics, No. 25, Wiley-Interscience, [John Wiley & Sons, Inc], New York-London-Sydney.

ⓘ

Notes:

Translated from the original German by E. Gottschling and M. Tretkoff. Reprinted by John Wiley & Sons, New York, 1989.

External Links:

ISBN 0-471-79090-7, MathReview, ZentralBlatt

Referenced by:

Ch.21.

Encodings:

BibTeX

…

24: Bibliography B

… ►

Bessel functions and modular relations of higher type and hyperbolic differential equations. Comm. Sém. Math. Univ. Lund [Medd. Lunds Univ. Mat. Sem.] 1952 (Tome Supplementaire), pp. 12–20.

ⓘ

External Links:

MathReview (S. C. van Veen), ZentralBlatt

Referenced by:

§35.5(i).

Encodings:

BibTeX

…

25: 27.11 Asymptotic Formulas: Partial Sums

… ►

27.11.9 $$\sum _{\begin{array}{c}p\le x\\ p\equiv h(modk)\end{array}}\frac{1}{p}=\frac{1}{\varphi \left(k\right)}\ln \ln x+B+O\left(\frac{1}{\ln x}\right),$$

ⓘ

Symbols:

$O\left(x\right)$: order not exceeding, $\varphi \left(n\right)$: Euler’s totient, $\equiv$: modular equivalence, $\ln z$: principal branch of logarithm function, $k$: positive integer, $p,p_1,\mathrm{\dots }$: prime numbers and $x$: real number

Referenced by:

§27.11

Permalink:

http://dlmf.nist.gov/27.11.E9

Encodings:

pMML, png, TeX

Change of Notation (effective with 1.0.10):

The notation for logarithm has been changed to $\ln$ from $\log$.

See also:

Annotations for §27.11 and Ch.27

… ►

27.11.11 $$\sum _{\begin{array}{c}p\le x\\ p\equiv h(modk)\end{array}}\frac{\ln p}{p}=\frac{1}{\varphi \left(k\right)}\ln x+O\left(1\right),$$

ⓘ

Symbols:

$O\left(x\right)$: order not exceeding, $\varphi \left(n\right)$: Euler’s totient, $\equiv$: modular equivalence, $\ln z$: principal branch of logarithm function, $k$: positive integer, $p,p_1,\mathrm{\dots }$: prime numbers and $x$: real number

Referenced by:

§27.11, §27.11

Permalink:

http://dlmf.nist.gov/27.11.E11

Encodings:

pMML, png, TeX

Change of Notation (effective with 1.0.10):

The notation for logarithm has been changed to $\ln$ from $\log$.

See also:

Annotations for §27.11 and Ch.27

…

26: 20.15 Tables

… ►

20.15.1 $$\sin \alpha ={\theta }_2^2(0,q)/{\theta }_3^2(0,q)=k.$$

ⓘ

Defines:

$\alpha$: modular angle (locally)

Symbols:

${\theta }_j(z,q)$: theta function, $\sin z$: sine function and $q$: nome

Referenced by:

§20.15, §20.15

Permalink:

http://dlmf.nist.gov/20.15.E1

Encodings:

pMML, png, TeX

See also:

Annotations for §20.15 and Ch.20

…

27: 17.18 Methods of Computation

… ►The two main methods for computing basic hypergeometric functions are: (1) numerical summation of the defining series given in §§17.4(i) and 17.4(ii); (2) modular transformations. …

28: 27.8 Dirichlet Characters

… ►

27.8.6

ⓘ

Symbols:

$\chi \left(n\right)$: Dirichlet character, $\varphi \left(n\right)$: Euler’s totient, $\overline{z}$: complex conjugate, $\equiv$: modular equivalence, $k$: positive integer, $m$: positive integer and $n$: positive integer

Permalink:

http://dlmf.nist.gov/27.8.E6

Encodings:

pMML, png, TeX

See also:

Annotations for §27.8 and Ch.27

…

29: 17.2 Calculus

… ►For properties of the function $f\left(q\right)=q^{-1/24}\eta \left(\frac{\ln q}{2\pi \mathrm{i}}\right)={(q;q)}_{\mathrm{\infty }}$ see §27.14. …

30: 20.11 Generalizations and Analogs

… ►If both $m,n$ are positive, then $G(m,n)$ allows inversion of its arguments as a modular transformation (compare (23.15.3) and (23.15.4)): …