Category:Number theory
 | Computing portal |
Here is a list of articles in the Number theory category of the Computing portal that unifies foundations of mathematics and computations using computers.
Traditionally, number theory is the branch of mathematics concerned with the properties of integers and many of its open problems are easily understood even by non-mathematicians. More generally, the field has come to be concerned with a wider class of problems that arise naturally from the study of integers. Number theory may be subdivided into several fields according to the methods used and the questions investigated. See for example the list of number theory topics.
This category corresponds roughly to MSC 11-XX Number theory; see 11-XX at MathSciNet and 11-XX at zbMATH.
Subcategories
This category has the following 19 subcategories, out of 19 total.
*
A
C
D
E
G
I
L
M
P
Q
S
Pages in category "Number theory"
The following 200 pages are in this category, out of 231 total.
(previous page) (next page)- List of number theory topics (computing)
- Number theory (computing)
*
- List of recreational number theory topics (computing)
- Timeline of number theory (computing)
3
- 3x + 1 semigroup (computing)
A
- Abc conjecture (computing)
- ABC@Home (software)
- Abel's summation formula (computing)
- Abelian variety of CM-type (computing)
- Amenable number (computing)
- Amicable triple (computing)
- Arithmetic derivative (computing)
- Arithmetic Fuchsian group (computing)
- Arithmetic group (computing)
- Arithmetic hyperbolic 3-manifold (computing)
- Arithmetic topology (computing)
- Arithmetic zeta function (computing)
- Artin conductor (computing)
- Artin–Hasse exponential (computing)
- Aurifeuillean factorization (computing)
- Automorphic number (computing)
- Auxiliary function (computing)
B
- Barnes G-function (computing)
- Basel problem (computing)
- Beal conjecture (computing)
- Bernoulli number (computing)
- Bernoulli polynomials (computing)
- Bernoulli polynomials of the second kind (computing)
- Bhargava cube (computing)
- Binomial number (computing)
- Birch and Swinnerton-Dyer conjecture (computing)
- Bost–Connes system (computing)
- Brandt matrix (computing)
- Brewer sum (computing)
- Brjuno number (computing)
- Büchi's problem (computing)
C
- Cabtaxi number (computing)
- Casas-Alvero conjecture (computing)
- Champernowne constant (computing)
- Change-making problem (computing)
- Character group (computing)
- Composition (combinatorics) (computing)
- Computational number theory (computing)
- Congruent number (computing)
- Contou-Carrère symbol (computing)
- Coprime integers (computing)
- Covering set (computing)
- Covering system (computing)
- Crank conjecture (computing)
- Crank of a partition (computing)
- Cube (algebra) (computing)
- Cunningham number (computing)
- Cyclic number (computing)
- Cyclic number (group theory) (computing)
- Cyclotomic polynomial (computing)
D
- Dedekind sum (computing)
- Deformation ring (computing)
- Digit sum (computing)
- Digital root (computing)
- Dirichlet hyperbola method (computing)
- Dirichlet series inversion (computing)
- Disquisitiones Arithmeticae (computing)
- Distribution (number theory) (computing)
- Divisor function (computing)
- Divisor sum identities (computing)
- Dubner's conjecture (computing)
- Ducci sequence (computing)
- Durfee square (computing)
- Dyadic rational (computing)
E
- E-function (computing)
- Egyptian fraction (computing)
- Eichler order (computing)
- Eighth power (computing)
- Eisenstein–Kronecker number (computing)
- Elkies trinomial curves (computing)
- Elliptic divisibility sequence (computing)
- Erdős arcsine law (computing)
- Erdős–Moser equation (computing)
- Erdős–Tenenbaum–Ford constant (computing)
- Euler function (computing)
- Euler's totient function (computing)
- Eventually (mathematics) (computing)
F
- Farey sequence (computing)
- Feit–Thompson conjecture (computing)
- Fermat number (computing)
- Fermat quotient (computing)
- Proofs of Fermat's little theorem (computing)
- Fifth power (algebra) (computing)
- Fontaine–Mazur conjecture (computing)
- Formulas for generating Pythagorean triples (computing)
- Fourth power (computing)
- Frey curve (computing)
- Friendly number (computing)
- Frobenioid (computing)
- Fueter–Pólya theorem (computing)
G
- Gan–Gross–Prasad conjecture (computing)
- Gauss's diary (computing)
- Generalized taxicab number (computing)
- Gillies' conjecture (computing)
- Glaisher–Kinkelin constant (computing)
- Golomb ruler (computing)
- Granville number (computing)
- Greedy algorithm for Egyptian fractions (computing)
- Gregory coefficients (computing)
- Grothendieck–Katz p-curvature conjecture (computing)
- Grothendieck–Teichmüller group (computing)
H
- Hall's conjecture (computing)
- Hall–Higman theorem (computing)
- Haran's diamond theorem (computing)
- Günter Harder (biography)
- Harmonic divisor number (computing)
- Harmonic number (computing)
- Hecke algebra (computing)
- Hecke algebra acting on modular forms (computing)
- Hecke character (computing)
- Height of a polynomial (computing)
- Hilbert's inequality (computing)
- History of the Theory of Numbers (computing)
- Hodge–Arakelov theory (computing)
- Hodge–Tate module (computing)
- Hundred Fowls Problem (computing)
- Hurwitz class number (computing)
- Hyperharmonic number (computing)
I
- Ideal lattice (computing)
- Ideal lattice cryptography (computing)
- Ideal number (computing)
- Integer square root (computing)
- Integer-valued polynomial (computing)
- Inter-universal Teichmüller theory (computing)
- An Introduction to the Theory of Numbers (computing)
- Irrationality sequence (computing)
- Iwasawa algebra (computing)
J
- Jacobsthal sum (computing)
- Journal of Number Theory (computing)
K
- Kaprekar number (computing)
- Knödel number (computing)
- Kubilius model (computing)
L
- Least common multiple (computing)
- List of mathematical functions (computing)
- List of types of functions (computing)
- Local analysis (computing)
- Lonely runner conjecture (computing)
M
- Manin conjecture (computing)
- Mirimanoff's congruence (computing)
- Multipartition (computing)
- Multiplicative digital root (computing)
- Multiplicative independence (computing)
- Multiplicative partition (computing)
N
- N conjecture (computing)
- Natural density (computing)
- Natural number (computing)
- Néron model (computing)
- Néron–Tate height (computing)
- Niven's constant (computing)
- Non-integer base of numeration (computing)
- Noncommutative unique factorization domain (computing)
- Normal number (computing)
- Number Theory Foundation (organization)
- Numerical semigroup (computing)
P
- P-adic analysis (computing)
- P-adic distribution (computing)
- P-adic gamma function (computing)
- P-adic number (computing)
- P-adic Teichmüller theory (computing)
- Paley graph (computing)
- Partition (number theory) (computing)
- Perfect power (computing)
- Pernicious number (computing)
- Persistence of a number (computing)
- Poussin proof (computing)
- Prime geodesic (computing)
- Prime omega function (computing)
- Prime signature (computing)
- Primecoin (computing)
- Primefree sequence (computing)
- Primon gas (physics)
- Probabilistic number theory (computing)
- Prosolvable group (computing)
- Proth number (computing)
- Prouhet–Thue–Morse constant (computing)
Q
- Q-Pochhammer symbol (computing)
- Quadratic irrational number (computing)
- Quadratic reciprocity (computing)
R
- Ramanujan's sum (computing)
- Random Fibonacci sequence (computing)
- Rank of a partition (computing)
- Remainder (computing)
- Residue-class-wise affine group (computing)
- Ring of modular forms (computing)
S
- Schanuel's conjecture (computing)
- Schnorr group (computing)
- Schoof's algorithm (computing)
- Schoof–Elkies–Atkin algorithm (computing)
- Schwartz–Bruhat function (computing)
- Selmer group (computing)
- Seventh power (computing)
- Short integer solution problem (computing)
- Sidon sequence (computing)
- Sierpinski number (computing)
- Signed-digit representation (computing)
Mathematics
Organizations
Books
About