Mathematics catalogue
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.
16,859 records · Search and filter
- Math-8901 O22b — Factoring from composite discrete logarithms
- Math-8902 O23 — Factoring from Euler's totient
- Math-8903 O25 — Solving binary quadratic congruences
- Math-8904 O26 — Discrete logarithm versus Diffie–Hellman key distribution
- Math-8905 O27 — Elliptic curves of prescribed order
- Math-8906 O28 — Discrete logarithms in elliptic-curve groups
- Math-8907 O30 — Polynomial-factor lattice approximation
- Math-8908 O31 — Order of a polynomial's Galois group
- Math-8909 O32 — Class numbers of imaginary quadratic orders
- Math-8910 O34 — Solvability of the negative Pell equation
- Math-8911 O36 — Integer multiplication in linear bit complexity
- Math-8912 Conjecture 1.3 — Pillai
- Math-8913 Conjecture 1.9
- Math-8914 Conjecture 2.5 — Lang-Waldschmidt
- Math-8915 Conjecture 2.6
- Math-8916 Conjecture 2.14 — Mahler
- Math-8917 Conjecture 3.3 — Algebraic Independence of Logarithms of Algebraic Numbers
- Math-8918 Conjecture 3.5 — Strong Five Exponentials Conjecture
- Math-8919 Conjecture 3.6 — Roy
- Math-8920 Conjecture 3.8 — Gel’fond
- Math-8921 Conjecture 3.9 — Schneider
- Math-8922 Conjecture 3.10 — Gel’fond-Schneider
- Math-8923 Conjecture 3.15 — Goncharov
- Math-8924 Conjecture 3.16 — Zagier
- Math-8925 Conjecture 3.17
- Math-8926 Conjecture 3.18
- Math-8927 Conjecture 3.20 — Nesterenko
- Math-8928 Conjecture 4.1 — Lehmer's Problem
- Math-8929 Conjecture 4.3 — Amoroso-David
- Math-8930 Conjecture 4.11 — Wirsing and Schmidt
- Math-8931 Tensor growth rate and exact one-dimensional obstructions for constrained differences
- Math-8932 Expansion can hide only global Sidorenko obstructions
- Math-8933 A holonomy reduction to equiangular lines
- Math-8934 Random sub-neighborhood discrepancy on the Boolean cube
- Math-8935 A high-probability lower bound for random permutation discrepancy
- Math-8936 Tusnady's problem: canonical models and monotone-chain certificates
- Math-8937 Link structure and sharp edge bounds for three-edge tight-path-free triple systems
- Math-8938 The minimal empty-core tight path and the 2026 uniformity-four resolution
- Math-8939 The exceptional three-color path problem: star-forest and triangle-density reductions
- Math-8940 A saturated-list kernel for one-point extensions of four-color Ramsey colorings
- Math-8941 Endpoint-deck gluing for one-edge deletion at a 3-uniform Ramsey threshold
- Math-8942 Simplex Ramsey numbers and a robust boundary-extension lemma
- Math-8943 Loose hypergraph triangles versus cliques: an edge-rooted component certificate
- Math-8944 Free-cut decomposition for ordered matchings versus triangles
- Math-8945 A cut-cone certificate for binary transitive hosts
- Math-8946 An explicit 94-vertex cubic-residue candidate and certificate reduction
- Math-8947 Exact block-product sampling of maximal G-parking functions
- Math-8948 Unique balance and a codegree-variance obstruction for the tetrahedron conjecture
- Math-8949 Exact recursion and local profile stability for the broken tetrahedron construction
- Math-8950 Exact deficit identity for recursive tight-cycle constructions