Glossary of number theory

{{glossary}}

{{term|abc conjecture}}

{{defn|1=The abc conjecture says that for all {{math|ε > 0}}, there are only finitely many coprime positive integers {{math|a}}, {{math|b}}, and {{math|c}} satisfying {{math|1=a+b=c}} such that the product of the distinct prime factors of {{math|abc}} raised to the power of {{math|1+ε}} is less than {{math|c}}.}}

{{term|adele}}

{{defn|Adele ring}}

{{term|algebraic number}}

{{defn|An algebraic number is a number that is the root of some non-zero polynomial in one variable with integer (or, equivalently, rational) coefficients.}}

{{term|algebraic number field}}

{{defn|See number field.}}

{{term|algebraic number theory}}

{{defn|Algebraic number theory}}

{{term|analytic number theory}}

{{defn|Analytic number theory}}

{{term|Artin}}

{{defn|1=The Artin conjecture says Artin's L function is entire (holomorphic on the entire complex plane).}}

{{term|automorphic form}}

{{defn|An automorphic form is a certain holomorphic function.}}

{{glossary end}}

{{glossary}}

{{term|Bézout's identity}}

{{defn|Bézout's identity, also called Bézout's lemma, states that if {{math|d}} is the greatest common divisor of two integers {{math|a}} and {{math|b}}, then there exists integers {{math|x}} and {{math|y}} such that {{math|1=ax + by = d}}, and in fact the integers of the form {{math|as + bt}} are exactly the multiples of {{math|d}}.}}

{{term|Brocard}}

{{defn|1=Brocard's problem}}

{{glossary end}}

{{glossary}}

{{term|Chinese remainder theorem}}

{{defn|Chinese remainder theorem}}

{{term|class field}}

{{defn|The class field theory concerns abelian extensions of number fields.}}

{{term|class number}}

{{defn|no=1|1=The class number of a number field is the cardinality of the ideal class group of the field.}}

{{defn|no=2|1=In group theory, the class number is the number of conjugacy classes of a group.}}

{{defn|no=3|1=Class number is the number of equivalence classes of binary quadratic forms of a given discriminant.}}

{{defn|no=4|1=The class number problem.}}

{{term|conductor}}

{{defn|Conductor (class field theory)}}

{{term|coprime}}

{{defn|Two integers are coprime (also called relatively prime) if the only positive integer that divides them both is 1.}}

{{glossary end}}

{{glossary}}

{{term|Dedekind}}

{{defn|Dedekind zeta function.}}

{{term|Diophantine equation}}

{{defn|Diophantine equation}}

{{term|Dirichlet}}

{{defn|no=1|Dirichlet's theorem on arithmetic progressions}}

{{defn|no=2|1=Dirichlet character}}

{{defn|no=3|1=Dirichlet's unit theorem.}}

{{term|distribution}}

{{defn|1=A distribution in number theory is a generalization/variant of a distribution in analysis.}}

{{term|divisor}}

{{defn|A divisor or factor of an integer {{math|n}} is an integer {{math|m}} such that there exists an integer {{math|k}} satisfying {{math|1=n = mk}}. Divisors can be defined in exactly the same way for polynomials or for elements of a commutative ring.}}

{{glossary end}}

{{glossary}}

{{term|Eisenstein}}

{{defn|Eisenstein series}}

{{term|elliptic curve}}

{{defn|Elliptic curve}}

{{term|Erdős}}

{{defn|1=Erdős–Kac theorem}}

{{term|Euclid's lemma}}

{{defn|Euclid's lemma states that if a prime {{math|p}} divides the product of two integers {{math|ab}}, then {{math|p}} must divide at least one of {{math|a}} or {{math|b}}.}}

{{term|Euler's criterion}}

{{defn|Let {{math|p}} is an odd prime and {{math|a}} is an integer not divisible by {{math|p}}. Euler's criterion provides a slick way to determine whether {{math|a}} is a quadratic residue mod {{math|p}}. It says that $a^\{\backslash tfrac\{p-1\}\{2\}\}$ is congruent to 1 mod {{math|p}} if {{math|a}} is a quadratic residue mod {{math|p}} and is congruent to -1 mod {{math|p}} if not. This can be written using Legendre symbols as

:$\backslash left(\backslash frac\{a\}\{p\}\backslash right)\; \backslash equiv\; a^\{\backslash tfrac\{p-1\}\{2\}\}\; \backslash pmod\; p.$}}

{{term|Euler's theorem}}

{{defn|Euler's theorem states that if {{math|n}} and {{math|a}} are coprime positive integers, then {{math|a^φ(n)}} is congruent to {{math|1}} mod {{math|n}}. Euler's theorem generalizes Fermat's little theorem.}}

{{term|Euler's totient function}}

{{defn|For a positive integer {{math|n}}, Euler's totient function of {{math|n}}, denoted {{math|φ(n)}}, is the number of integers coprime to {{math|n}} between {{math|1}} and {{math|n}} inclusive. For example, {{math|1=φ(4) = 2}} and {{math|1=φ(p) = p - 1}} for any prime {{math|p}}.}}

{{glossary end}}

{{glossary}}

{{term|factor}}

{{defn|See the entry for divisor.}}

{{term|factorization}}

{{defn|Factorization is the process of splitting a mathematical object, often integers or polynomials, into a product of factors.}}

{{term|Fermat's last theorem}}

{{defn|Fermat's last theorem, one of the most famous and difficult to prove theorems in number theory, states that for any integer {{math|n > 2}}, the equation {{math|1=aⁿ + bⁿ = cⁿ}} has no positive integer solutions.}}

{{term|Fermat's little theorem}}

{{defn|Fermat's little theorem}}

{{term|field extension}}

{{defn|A field extension {{math|L/K}} is a pair of fields {{math|K}} and {{math|L}} such that {{math|K}} is a subfield of {{math|L}}. Given a field extension {{math|L/K}}, the field {{math|L}} is a {{math|K}}-vector space.}}

{{term|fundamental theorem of arithmetic}}

{{defn|The fundamental theorem of arithmetic states that every integer greater than 1 can be written uniquely (up to reordering) as a product of primes.}}

{{glossary end}}

{{glossary}}

{{term|Galois}}

{{defn|A Galois extension is a finite field extension {{math|L/K}} such that one of the following equivalent conditions are satisfied:

• {{math|L/K}} is a normal extension and a separable extension,
• {{math|L}} is a splitting field of a separable polynomial with coefficients in {{math|K}},
• {{math|1={{!}}Aut(L/K){{!}} = [L:K]}}, that is, the number of automorphisms of the extension equals its degree.

The automorphism group {{math|1=Aut(L/K)}} of a Galois extension is called its Galois group and it is denoted {{math|1=Gal(L/K).}}}}

{{term|global field}}

{{defn|Global field}}

{{term|Goldbach's conjecture}}

{{defn|Goldbach's conjecture is a conjecture that states that every even natural number greater than 2 is the sum of two primes.}}

{{term|greatest common divisor}}

{{defn|The greatest common divisor of a finite list of integers is the largest positive number that is a divisor of every integer in the list.}}

{{glossary end}}

{{glossary}}

{{term|Hasse}}

{{defn|Hasse's theorem on elliptic curves.}}

{{term|Hecke}}

{{defn|Hecke ring}}

{{glossary end}}

{{glossary}}

{{term|ideal}}

{{defn|The ideal class group of a number field is the group of fractional ideals in the ring of integers in the field modulo principal ideals. The cardinality of the group is called the class number of the number field. It measures the extent of the failure of unique factorization.}}

{{term|integer}}

{{defn|no=1|The integers are the numbers {{math|…, -3, -2, -1, 0, 1, 2, 3, …}}.}}

{{defn|no=2|In algebraic number theory, an integer sometimes means an element of a ring of integers; e.g., a Gaussian integer. To avoid ambiguity, an integer contained in $\backslash mathbb\{Q\}$ is sometimes called a rational integer.}}

{{term|Iwasawa}}

{{defn|Iwasawa theory}}

{{glossary end}}

{{glossary}}

{{term|Langlands}}

{{defn|1=Langlands program}}

{{term|least common multiple}}

{{defn|The least common multiple of a finite list of integers is the smallest positive number that is a multiple of every integer in the list.}}

{{term|Legendre symbol}}

{{defn|1=Let {{math|p}} be an odd prime and let {{math|a}} be an integer. The Legendre symbol of {{math|a}} and {{math|p}} is

:$\backslash left(\backslash frac\{a\}\{p\}\backslash right)\; =$

\begin{cases}

1 & \text{if } a \text{ is a quadratic residue mod } p \text{ and } a \not\equiv 0\pmod p, \\

-1 & \text{if } a \text{ is not a quadratic residue mod } p \text{ and } a \not\equiv 0\pmod p, \\

0 & \text{if } a \equiv 0 \pmod p.

\end{cases}

The Legendre symbol provides a convenient notational package for several results, including the law of quadratic reciprocity and Euler's criterion.

}}

{{term|local}}

{{defn|no=1|A local field in number theory is the completion of a number field at a finite place.}}

{{defn|no=2|The local–global principle.}}

{{glossary end}}

{{glossary}}

{{term|Mersenne prime}}

{{defn|A Mersenne prime is a prime number one less than a power of 2.}}

{{term|modular form}}

{{defn|Modular form}}

{{term|modularity theorem}}

{{defn|The modularity theorem (which used to be called the Taniyama–Shimura conjecture)}}

{{glossary end}}

{{glossary}}

{{term|number field}}

{{defn|A number field, also called an algebraic number field, is a finite-degree field extension of the field of rational numbers.}}

{{term|non-abelian}}

{{defn|The non-abelian class field theory is an extension of the class field theory (which is about abelian extensions of number fields) to non-abelian extensions; or at least the idea of such a theory. The non-abelian theory does not exist in a definitive form today.}}

{{glossary end}}

{{glossary}}

{{term|Pell's equation}}

{{defn|Pell's equation}}

{{term|place}}

{{defn|A place is an equivalence class of non-Archimedean valuations (finite place) or absolute values (infinite place).}}

{{term|prime number}}

{{defn|no=1|A prime number is a positive integer with no divisors other than itself and 1.}}

{{defn|no=2|The prime number theorem describes the asymptotic distribution of prime numbers.}}

{{term|profinite}}

{{defn|1=A profinite integer is an element in the profinite completion $\backslash widehat\{\backslash mathbb\; Z\}$ of $\backslash mathbb\{Z\}$ along all integers.}}

{{term|Pythagorean triple}}

{{defn|A Pythagorean triple is three positive integers {{math|a, b, c}} such that {{math|1=a{{sup|2}} + b{{sup|2}} = c{{sup|2}}}}.}}

{{glossary end}}

{{glossary}}

{{term|ramification}}

{{defn|The ramification theory.}}

{{term|relatively prime}}

{{defn|See coprime.}}

{{term|ring of integers}}

{{defn|1=The ring of integers in a number field is the ring consisting of all algebraic numbers contained in the field.}}

{{glossary end}}

{{glossary}}

{{term|quadratic reciprocity}}

{{defn|Let p and q be distinct odd prime numbers, and define the Legendre symbol as

:$\backslash left(\backslash frac\{q\}\{p\}\backslash right)$

=\begin{cases}

1 & \text{if } n^2 \equiv q \bmod p \text{ for some integer } n\\

-1 & \text{otherwise}.

\end{cases}

The law of quadratic reciprocity states that

:$\backslash left(\backslash frac\{p\}\{q\}\backslash right)\; \backslash left(\backslash frac\{q\}\{p\}\backslash right)\; =\; (-1)^\{\backslash frac\{p-1\}\{2\}\backslash frac\{q-1\}\{2\}\}.$

This result aids in the computation of Legendre symbols and thus helps determine whether an integer is a quadratic residue.

}}

{{term|quadratic residue}}

{{defn|An integer {{math|q}} is called a quadratic residue mod {{math|n}} if it is congruent to a perfect square mod {{math|n}}, i.e., if there exists an integer {{math|x}} such that $x^2\backslash equiv\; q\; \backslash pmod\{n\}.$}}

{{glossary end}}

{{glossary}}

{{term|sieve of Eratosthenes}}

{{defn|Sieve of Eratosthenes}}

{{term|square-free integer}}

{{defn|A square-free integer is an integer that is not divisible by any square other than 1.}}

{{term|square number}}

{{defn|A square number is an integer that is the square of an integer. For example, 4 and 9 are squares, but 10 is not a square.}}

{{term|Szpiro}}

{{defn|1=Szpiro's conjecture is, in a modified form, equivalent to the abc conjecture.}}

{{glossary end}}

{{glossary}}

{{term|Takagi}}

{{defn|Takagi existence theorem is a theorem in class field theory.}}

{{term|totient function}}

{{defn|See Euler's totient function.}}

{{term|twin prime}}

{{defn|A twin prime is a prime number that is 2 less or 2 more than another prime number. For example, 7 is a twin prime, since it is prime and 5 is also prime.}}

{{glossary end}}

{{glossary}}

{{term|valuation}}

{{defn|valuation (algebra)}}

{{term|valued field}}

{{defn|A valued field is a field with a valuation on it.}}

{{term|1=Vojta}}

{{defn|1=Vojta's conjecture}}

{{glossary end}}

{{glossary}}

{{term|Wilson's theorem}}

{{defn|Wilson's theorem states that {{math|1=n > 1}} is prime if and only if {{math|(n-1)!}} is congruent to {{math|-1}} mod {{math|n}}.}}

{{glossary end}}

• {{cite book |last1=Burton |first1=David |title=Elementary Number Theory |date=2010 |publisher=McGraw Hill |edition=7th}}

Category:Number theory

Number theory