Category:Unsolved problems in mathematics
![]() | Computing portal |
Here is a list of articles in the category Unsolved problems in mathematics of the Computing portal that unifies foundations of mathematics and computations using computers. This category is intended for all unsolved problems in mathematics, including conjectures. Conjectures are qualified by having a suggested or proposed hypothesis. There may or may not be conjectures for all unsolved problems.
Subcategories
This category has the following 2 subcategories, out of 2 total.
C
Pages in category "Unsolved problems in mathematics"
The following 200 pages are in this category, out of 243 total.
(previous page) (next page)- List of unsolved problems in mathematics (computing)
*
- List of unsolved problems in statistics (computing)
A
- Abc conjecture (computing)
- Abundance conjecture (computing)
- Agoh–Giuga conjecture (computing)
- Albertson conjecture (computing)
- Andrews–Curtis conjecture (computing)
- Andrica's conjecture (computing)
- Arnold–Givental conjecture (physics)
- Artin's conjecture on primitive roots (computing)
- Atiyah conjecture on configurations (computing)
B
- Balanced prime (computing)
- Barnette's conjecture (computing)
- Bass conjecture (computing)
- Bateman–Horn conjecture (computing)
- Baum–Connes conjecture (computing)
- Beal conjecture (computing)
- Beggar-my-neighbour (computing)
- Bellman's lost in a forest problem (computing)
- Bing–Borsuk conjecture (computing)
- Birch–Tate conjecture (computing)
- Bloch's theorem (complex variables) (computing)
- Bombieri–Lang conjecture (computing)
- Borel conjecture (computing)
- Brocard's conjecture (computing)
- Brocard's problem (computing)
- Brouwer's conjecture (computing)
- Brumer–Stark conjecture (computing)
- Bunyakovsky conjecture (computing)
- Burnside problem (computing)
C
- Carathéodory conjecture (computing)
- Carmichael's totient function conjecture (computing)
- Carol number (computing)
- Casas-Alvero conjecture (computing)
- Chern's conjecture (affine geometry) (computing)
- Chern's conjecture for hypersurfaces in spheres (computing)
- Class number problem (computing)
- Clifford's theorem on special divisors (computing)
- Congruent number (computing)
- Connes embedding problem (computing)
- Constant problem (computing)
- Conway's 99-graph problem (computing)
- Cousin prime (computing)
- Covering problem of Rado (computing)
- Covering system (computing)
- Cramér's conjecture (computing)
- Crouzeix's conjecture (computing)
- Cuboid conjectures (computing)
- Cullen number (computing)
- Cycle double cover (computing)
D
- Dickson's conjecture (computing)
- Discrepancy of hypergraphs (computing)
- Discrepancy theory (computing)
- Dissection into orthoschemes (computing)
- Divisor summatory function (computing)
- Dixmier conjecture (computing)
- Double Mersenne number (computing)
E
- Eilenberg–Ganea conjecture (computing)
- Einstein problem (computing)
- Elliott–Halberstam conjecture (computing)
- Erdős conjecture on arithmetic progressions (computing)
- Erdős–Faber–Lovász conjecture (computing)
- Erdős–Gyárfás conjecture (computing)
- Erdős–Hajnal conjecture (computing)
- Erdős–Straus conjecture (computing)
- Erdős–Turán conjecture on additive bases (computing)
- Erdős–Ulam problem (computing)
- Erdős on Graphs (computing)
- Erdős–Moser equation (computing)
- Euclid number (computing)
- Euclid–Mullin sequence (computing)
- Euler brick (computing)
- Euler–Mascheroni constant (computing)
F
- Falconer's conjecture (computing)
- Farrell–Jones conjecture (computing)
- Feit–Thompson conjecture (computing)
- Fermat number (computing)
- Fermat–Catalan conjecture (computing)
- Fibonacci prime (computing)
- Filling area conjecture (computing)
- Finite lattice representation problem (computing)
- Firoozbakht's conjecture (computing)
- Four exponentials conjecture (computing)
- Friendly number (computing)
- Fröberg conjecture (computing)
- Fujita conjecture (computing)
G
- Gauss circle problem (computing)
- Gaussian moat (computing)
- Generalized Riemann hypothesis (computing)
- Gilbreath's conjecture (computing)
- Gillies' conjecture (computing)
- Giuga number (computing)
- GNRS conjecture (computing)
- Goldbach's conjecture (computing)
- Goormaghtigh conjecture (computing)
- Grand Riemann hypothesis (computing)
- Greenberg's conjectures (computing)
- Grimm's conjecture (computing)
- Grothendieck–Katz p-curvature conjecture (computing)
- Gyárfás–Sumner conjecture (computing)
H
- Hadamard matrix (computing)
- Hadamard's maximal determinant problem (computing)
- Hadwiger conjecture (combinatorial geometry) (computing)
- Hadwiger conjecture (graph theory) (computing)
- Hadwiger–Nelson problem (computing)
- Hall's conjecture (computing)
- Harborth's conjecture (computing)
- Hermite's problem (computing)
- Herzog–Schönheim conjecture (computing)
- Hilbert's ninth problem (computing)
- Hilbert's sixteenth problem (computing)
- Hilbert's fifteenth problem (computing)
- Hilbert–Pólya conjecture (computing)
- Hilbert–Smith conjecture (computing)
- Homological conjectures in commutative algebra (computing)
- Hopf conjecture (computing)
I
- Idoneal number (computing)
- Inscribed square problem (computing)
- Invariant subspace problem (computing)
- Inverse Galois problem (computing)
J
- Jacobian conjecture (computing)
- Jacobson's conjecture (computing)
- Juggler sequence (computing)
K
- Kaplansky's conjectures (computing)
- Kobon triangle problem (computing)
- Köthe conjecture (computing)
- Kummer–Vandiver conjecture (computing)
- Kynea number (computing)
L
- Landau's constants (computing)
- Landau's problems (computing)
- Lander, Parkin, and Selfridge conjecture (computing)
- Lebesgue's universal covering problem (computing)
- Legendre's conjecture (computing)
- Lehmer's conjecture (computing)
- Lehmer's totient problem (computing)
- Lemoine's conjecture (computing)
- Leopoldt's conjecture (computing)
- Lindelöf hypothesis (computing)
- List of problems in loop theory and quasigroup theory (computing)
- Littlewood conjecture (computing)
- Lonely runner conjecture (computing)
- Lovász conjecture (computing)
- Lucas number (computing)
- Lychrel number (computing)
M
- Magic square (computing)
- Manin conjecture (computing)
- Map folding (computing)
- McMullen problem (computing)
- Mean value problem (computing)
- Mersenne conjectures (computing)
- Mersenne prime (computing)
- Minimum overlap problem (computing)
- Montgomery's pair correlation conjecture (computing)
- Moser's worm problem (computing)
- Moving sofa problem (computing)
N
- N conjecture (computing)
- Nakai conjecture (computing)
- Navier–Stokes existence and smoothness (computing)
- New digraph reconstruction conjecture (computing)
- Newman's conjecture (computing)
- Newman–Shanks–Williams prime (computing)
- Novikov conjecture (computing)
O
- Oberwolfach problem (computing)
- Odd greedy expansion (computing)
- Open Problems in Mathematics (computing)
- Oppermann's conjecture (computing)
P
- P versus NP problem (computing)
- Palindromic prime (computing)
- Pell number (computing)
- Perfect number (computing)
- Pierce–Birkhoff conjecture (computing)
- Pierpont prime (computing)
- Polignac's conjecture (computing)
- Pollock's conjectures (computing)
- Pompeiu problem (computing)
- Prime quadruplet (computing)
- Prime triplet (computing)
- Problems in Latin squares (computing)
- Problems involving arithmetic progressions (computing)
Q
- Quasiperfect number (computing)
R
- Reconstruction conjecture (computing)
- Redmond–Sun conjecture (computing)
- Regular prime (computing)
- Resolution of singularities (computing)
- Riemann hypothesis (computing)
- Riesel number (computing)
- Rota's basis conjecture (computing)
S
- Sato–Tate conjecture (computing)
- Schanuel's conjecture (computing)
- Schinzel's hypothesis H (computing)
- Scholz conjecture (computing)
- Second Hardy–Littlewood conjecture (computing)
- Second neighborhood problem (computing)
- Section conjecture (computing)
- Sendov's conjecture (computing)
- Serre's conjecture II (algebra) (computing)
- Serre's multiplicity conjectures (computing)
- Sexy prime (computing)
- Sierpinski number (computing)
- Singmaster's conjecture (computing)