modular theorems

SearchAdvancedHelp

(0.002 seconds)

1—10 of 15 matching pages

1: 19.35 Other Applications

… ►

§19.35(i) Mathematical

►Generalizations of elliptic integrals appear in analysis of modular theorems of Ramanujan (Anderson et al. (2000)); analysis of Selberg integrals (Van Diejen and Spiridonov (2001)); use of Legendre’s relation (19.7.1) to compute $\pi$ to high precision (Borwein and Borwein (1987, p. 26)). …

2: 27.15 Chinese Remainder Theorem

… ►The Chinese remainder theorem states that a system of congruences $x\equiv a_1(mod{m}_1),\mathrm{\dots },x\equiv 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. …

3: 27.16 Cryptography

… ►Thus, $y\equiv x^r(modn)$ and . … ►By the Euler–Fermat theorem (27.2.8), $x^{\varphi \left(n\right)}\equiv 1(modn)$; hence $x^{t\varphi \left(n\right)}\equiv 1(modn)$. …

4: Bibliography C

… ►

Modular Forms and Fermat’s Last Theorem. Springer-Verlag, New York.

ⓘ

External Links:

ISBN 0-387-94609-8; 0-387-98998-6, MathReview (M. Ram Murty), ZentralBlatt

Referenced by:

§23.20(v).

Encodings:

BibTeX

…

5: 27.11 Asymptotic Formulas: Partial Sums

… ►Letting $x\to \mathrm{\infty }$ in (27.11.9) or in (27.11.11) we see that there are infinitely many primes $p\equiv h(modk)$ if $h,k$ are coprime; this is Dirichlet’s theorem on primes in arithmetic progressions. … ►The prime number theorem for arithmetic progressions—an extension of (27.2.3) and first proved in de la Vallée Poussin (1896a, b)—states that if $\left(h,k\right)=1$, then the number of primes $p\le x$ with $p\equiv h(modk)$ is asymptotic to $x/(\varphi \left(k\right)\ln x)$ as $x\to \mathrm{\infty }$.

6: 27.2 Functions

… ►

§27.2(i) Definitions

… ►(See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) ►This result, first proved in Hadamard (1896) and de la Vallée Poussin (1896a, b), is known as the prime number theorem. …This is the number of positive integers $\le n$ that are relatively prime to $n$; $\varphi \left(n\right)$ is Euler’s totient. ►If $\left(a,n\right)=1$, then the Euler–Fermat theorem states that …

7: 23.20 Mathematical Applications

… ►For conformal mappings via modular functions see Apostol (1990, §2.7). … ►

§23.20(iv) Modular and Quintic Equations

… ►

§23.20(v) Modular Functions and Number Theory

… ►

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. … ►

23 Weierstrass Elliptic and Modular Functions

…

9: Bibliography

… ►

Characterization theorems for orthogonal polynomials. In Orthogonal Polynomials (Columbus, OH, 1989), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., Vol. 294, pp. 1–24.

ⓘ

External Links:

Link, MathReview (Walter Van Assche), ZentralBlatt

Referenced by:

§18.3.

Encodings:

BibTeX

… ►

Generalized elliptic integrals and modular equations. Pacific J. Math. 192 (1), pp. 1–37.

ⓘ

External Links:

ISSN 0030-8730, FullText, MathReview (Bruce C. Berndt), ZentralBlatt

Referenced by:

§19.35(i).

Encodings:

BibTeX

… ►

Theorems on generalized Dedekind sums. Pacific J. Math. 2 (1), pp. 1–9.

ⓘ

External Links:

MathReview (N. G. de Bruijn), ZentralBlatt

Referenced by:

(25.11.41), (25.11.42), §25.11(xii).

Encodings:

BibTeX

… ►

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

►

A Centennial History of the Prime Number Theorem. In Number Theory, Trends Math., pp. 1–14.

ⓘ

External Links:

MathReview (Giovanni Coppola), ZentralBlatt

Referenced by:

(25.16.2), (25.16.4), §25.16(i), §25.16.

Encodings:

BibTeX

…

10: 24.10 Arithmetic Properties

… ►

§24.10(i) Von Staudt–Clausen Theorem

… ►where $m\equiv n\cancel{\equiv }0(modp-1)$. …valid when $m\equiv n(mod(p-1)p^{\mathrm{\ell }})$ and $n\cancel{\equiv }0(modp-1)$, where $\mathrm{\ell }(\ge 0)$ is a fixed integer. … ►

24.10.8 $$N_{2n}\equiv 0(mod{p}^{\mathrm{\ell }}),$$

ⓘ

Symbols:

$\equiv$: modular equivalence, $\mathrm{\ell }$: integer, $n$: integer and $p$: prime

Referenced by:

§24.10(iv)

Permalink:

http://dlmf.nist.gov/24.10.E8

Encodings:

pMML, png, TeX

See also:

Annotations for §24.10(iv), §24.10 and Ch.24

►valid for fixed integers $\mathrm{\ell }(\ge 1)$, and for all $n(\ge 1)$ such that $2n\cancel{\equiv }0$ $(modp-1)$ and $p^{\mathrm{\ell }}|2n$. …