Mathematics
Open problems, research attempts and community review.
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
6,275 records · Search and filter
- Math-4101 Extremal parameters for D(n)-quintuples
- Math-4102 Triples having property D(n) for several parameters
- Math-4103 Existence of a rational Diophantine septuple
- Math-4104 Parameters admitting infinitely many rational D(q)-quintuples
- Math-4105 Existence of a strong rational Diophantine quadruple
- Math-4106 Degree-only bounds for polynomial D(n)-tuples
- Math-4107 Problem 1.1
- Math-4108 Conjecture 1.4 — Shorey
- Math-4109 Conjecture 1.5
- Math-4110 Conjecture 1.7
- Math-4111 Conjecture 2.2 — Erdős-Woods
- Math-4112 Conjecture 2.3 — Erdős–Dressler
- Math-4113 Conjecture 2.7 — Hall
- Math-4114 Conjecture 2.15 — Mahler
- Math-4115 Conjecture 3.2 — Roy
- Math-4116 Conjecture 3.4 — Strong Four Exponentials Conjecture
- Math-4117 Conjecture 3.19 — Rohrlich
- Math-4118 Conjecture 3.23
- Math-4119 Conjecture 3.24 — Bertrand
- Math-4120 Conjecture 3.25 — Bertrand
- Math-4121 Conjecture 3.26
- Math-4122 Question 3.27 — Mahler
- Math-4123 Conjecture 4.4 — Amoroso-David
- Math-4124 Problem 4.6
- Math-4125 Conjecture 4.7 — David-Hindry
- Math-4126 Conjecture 4.12
- Math-4127 Conjecture 4.14
- Math-4128 Conjecture 4.16 — Quantitative Refinement of Schanuel's Conjecture
- Math-4129 Question 4.17 — Mazur
- Math-4130 Conjecture 4.19
- Math-4131 Conjecture 4.20
- Math-4132 Conjecture 4.21
- Math-4133 Question 5.2 — Bugeaud
- Math-4134 Conjecture 5.3
- Math-4135 Conjecture 5.4 — Loxton and van der Poorten
- Math-4136 Efficient class-group realizations of large cyclic groups
- Math-4137 Globalizing prescribed local Brauer classes
- Math-4138 Removing restrictions from hyperelliptic zeta algorithms
- Math-4139 Fast construction of five-term geometric progressions for NFS
- Math-4140 Choosing a field for an elliptic curve of prescribed order
- Math-4141 Jacobians in abelian-threefold isogeny classes
- Math-4142 Recognizing genus-three Jacobians over the base field
- Math-4143 Monotonicity of maximal curve point counts in genus
- Math-4144 Shortest vectors in Hermitian lattices
- Math-4145 NP-hardness of ideal-lattice SVP
- Math-4146 NP-hardness of minimum distance for cyclic codes
- Math-4147 SVP-to-CVP reduction within ideal lattices
- Math-4148 Quantum algorithm for Smallest Conjugate
- Math-4149 Quantum algorithm for ideal-lattice SVP
- Math-4150 Necessity of the no-CM condition for Heegner bounds