Elementary number theory
Summary
Elementary number theory is the study of the integers with methods that use no complex analysis and little algebra beyond congruences. Its central objects are the primes, and a prime is an integer greater than 1 whose only positive divisors are 1 and itself. Congruences and primality tests are the base of public-key cryptography, of check digits and of many algorithms on integers. Euclid proved that there are infinitely many primes, and Gauss gave the subject its modern form in the Disquisitiones Arithmeticae of 1801. This topic collects the elementary number theory pages of math2. Its sub-areas are listed below, in reading order. Analytic number theory, additive number theory, algebraic number theory and arithmetic geometry have their own topics.
Remarks
Sub-areas
- Divisibility, division with remainder and the gcd
- Primes and unique factorization
- Elementary results on the distribution of primes
- Congruences and residue classes
- The theorems of Fermat, Euler and Wilson
- Polynomial congruences and Hensel lifting
- Primitive roots and multiplicative order
- Quadratic residues and quadratic reciprocity
- Gaussian and Eisenstein integers
- Sums of squares and Pythagorean triples
- Simple continued fractions
- Pell's equation and quadratic equations in two variables
- Farey sequences, the Stern-Brocot tree and floor identities
- Arithmetic functions and Dirichlet convolution
- Perfect, amicable and related numbers
- Mersenne, Fermat and other special primes
- Primality testing and pseudoprimes
- Factorials, binomial coefficients and Bernoulli numbers
- Figurate numbers and perfect powers
- Digits as number theory
- Linear Diophantine equations and the Frobenius problem
- Nonlinear Diophantine equations by elementary methods
- Fibonacci and Lucas numbers
- Recurrence sequences and integer iterations
- Applications and problems of elementary number theory
Everything in this topic
The members of this topic and each page that they need, 25 pages in all.
Show the path as a graph
- no evidence level
- Applications and problems of elementary number theory topic member
- Arithmetic functions and Dirichlet convolution topic member
- Congruences and residue classes topic member
- Digits as number theory topic member
- Divisibility, division with remainder and the gcd topic member
- Elementary results on the distribution of primes topic member
- Factorials, binomial coefficients and Bernoulli numbers topic member
- Farey sequences, the Stern-Brocot tree and floor identities topic member
- Fibonacci and Lucas numbers topic member
- Figurate numbers and perfect powers topic member
- Gaussian and Eisenstein integers topic member
- Linear Diophantine equations and the Frobenius problem topic member
- Mersenne, Fermat and other special primes topic member
- Nonlinear Diophantine equations by elementary methods topic member
- Pell's equation and quadratic equations in two variables topic member
- Perfect, amicable and related numbers topic member
- Polynomial congruences and Hensel lifting topic member
- Primality testing and pseudoprimes topic member
- Primes and unique factorization topic member
- Primitive roots and multiplicative order topic member
- Quadratic residues and quadratic reciprocity topic member
- Recurrence sequences and integer iterations topic member
- Simple continued fractions topic member
- Sums of squares and Pythagorean triples topic member
- The theorems of Fermat, Euler and Wilson topic member
About this page
| Tag | 7XZ94HTPQT |
|---|---|
| URI | m2://7XZ94HTPQT |
| Kind | topic |
| Writing | W0 stub |
| MSC | 11Axx |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
Nodes in this topic
- Divisibility, division with remainder and the gcd
- Primes and unique factorization
- Linear Diophantine equations and the Frobenius problem
- Perfect, amicable and related numbers
- Primality testing and pseudoprimes
- Sums of squares and Pythagorean triples
- Quadratic residues and quadratic reciprocity
- Congruences and residue classes
- Fibonacci and Lucas numbers
- Recurrence sequences and integer iterations
- Applications and problems of elementary number theory
- Nonlinear Diophantine equations by elementary methods
- Simple continued fractions
- Elementary results on the distribution of primes
- Digits as number theory
- Mersenne, Fermat and other special primes
- The theorems of Fermat, Euler and Wilson
- Arithmetic functions and Dirichlet convolution
- Primitive roots and multiplicative order
- Pell's equation and quadratic equations in two variables
- Gaussian and Eisenstein integers
- Figurate numbers and perfect powers
- Factorials, binomial coefficients and Bernoulli numbers
- Farey sequences, the Stern-Brocot tree and floor identities
- Polynomial congruences and Hensel lifting