multiplicative number theory

SearchAdvancedHelp

(0.002 seconds)

1—10 of 21 matching pages

1: 27.1 Special Notation

§27.1 Special Notation

… ► ►►

$d,k,m,n$	positive integers (unless otherwise indicated).
…

2: 27.3 Multiplicative Properties

§27.3 Multiplicative Properties

… ►

27.3.8 $$\varphi \left(m\right)\varphi \left(n\right)=\varphi \left(mn\right)\varphi \left(\left(m,n\right)\right)/\left(m,n\right).$$

ⓘ

Symbols:

$\varphi \left(n\right)$: Euler’s totient, $\left(m,n\right)$: greatest common divisor (gcd), $m$: positive integer and $n$: positive integer

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §27.3 and Ch.27

…

3: 27.4 Euler Products and Dirichlet Series

… ►

27.4.1 $$\sum _{n=1}^{\mathrm{\infty }}f(n)=\prod _p\left(1+\sum _{r=1}^{\mathrm{\infty }}f(p^r)\right),$$

ⓘ

Symbols:

$n$: positive integer, $p,p_1,\mathrm{\dots }$: prime numbers and $f$: multiplicative function

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §27.4 and Ch.27

… ►Euler products are used to find series that generate many functions of multiplicative number theory. … ►

27.4.4 $$F(s)=\sum _{n=1}^{\mathrm{\infty }}f(n)n^{-s},$$

ⓘ

Symbols:

$n$: positive integer, $f$: multiplicative function and $F(s)$: generating function

Permalink:

http://dlmf.nist.gov/27.4.E4

Encodings:

pMML, png, TeX

See also:

Annotations for §27.4 and Ch.27

…

4: 27.12 Asymptotic Formulas: Primes

… ►

5: 27.2 Functions

… ►

§27.2(i) Definitions

… ►

27.2.8 $$a^{\varphi \left(n\right)}\equiv 1(modn),$$

ⓘ

Symbols:

$\varphi \left(n\right)$: Euler’s totient, $\equiv$: modular equivalence, $n$: positive integer and $a$: primitive root

A&S Ref:

24.3.2 II.B

Referenced by:

§27.16, §27.8

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §27.2(i), §27.2 and Ch.27

…

6: 27.13 Functions

… ►Whereas multiplicative number theory is concerned with functions arising from prime factorization, additive number theory treats functions related to addition of integers. …

7: Bibliography D

… ►

Multiplicative Number Theory. 3rd edition, Graduate Texts in Mathematics, Vol. 74, Springer-Verlag, New York.

ⓘ

Notes:

Revised and with a preface by Hugh L. Montgomery

External Links:

ISBN 0-387-95097-4, MathReview, ZentralBlatt

Referenced by:

§27.12.

Encodings:

BibTeX

…

8: 27.8 Dirichlet Characters

§27.8 Dirichlet Characters

… ►An example is the principal character (mod $k$): … ►If $\left(n,k\right)=1$, then the characters satisfy the orthogonality relation … ►A divisor $d$ of $k$ is called an induced modulus for $\chi$ if … ►If $k$ is odd, then the real characters (mod $k$) are the principal character and the quadratic characters described in the next section.

9: 27.22 Software

… ►

Mathematica. PrimeQ combines strong pseudoprime tests for the bases 2 and 3 and a Lucas pseudoprime test. No known composite numbers pass these three tests, and Bleichenbacher (1996) has shown that this combination of tests proves primality for integers below ${10}^{16}$. Provable PrimeQ uses the Atkin–Goldwasser–Kilian–Morain Elliptic Curve Method to prove primality. FactorInteger tries Brent–Pollard rho, Pollard $p-1$, and then cfrac after trial division. See §27.19. ecm is available also, and the Multiple Polynomial Quadratic sieve is expected in a future release.

For additional Mathematica routines for factorization and primality testing, including several different pseudoprime tests, see Bressoud and Wagon (2000).

… ►

Number Theory Web. References and links to software for factorization and primality testing.

…

10: Bibliography

… ►

Congruences of $p$-adic integer order Bernoulli numbers. J. Number Theory 59 (2), pp. 374–388.

ⓘ

External Links:

ISSN 0022-314X, Document, MathReview (L. Skula), ZentralBlatt

Referenced by:

§24.16(iii).

Encodings:

BibTeX

… ►

$q$-Series: Their Development and Application in Analysis, Number Theory, Combinatorics, Physics, and Computer Algebra. CBMS Regional Conference Series in Mathematics, Vol. 66, Amer. Math. Soc., Providence, RI.

ⓘ

External Links:

ISBN 0-8218-0716-1, MathReview (David M. Bressoud), ZentralBlatt

Referenced by:

§17.14, §17.14, §17.16, Ch.17, Profile George E. Andrews.

Encodings:

BibTeX

… ►

Number Theory. In The New Encyclopaedia Britannica, Vol. 25, pp. 14–37.

ⓘ

Referenced by:

§27.13(i), §27.15, §27.16, Ch.27.

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

…