FrontierMath: Open Problems

A collection of unsolved mathematics problems that have resisted serious attempts by professional mathematicians. AI solutions would meaningfully advance the state of human mathematical knowledge.

This work was supported by Schmidt Sciences.

Interested in purchasing access to solution verifiers? See below.

Problems solved by AI

Filter

Field
Type
Notability
Status
0 results
Solved

A Genus 2 Curve over the Rationals with a Rational Torsion Point of Prime Order at Least 31

Moderately interestingArithmetic geometry
Construction - Finite
Record Breaking
Solved

Short Superpermutations over 8, 9, and 10

Moderately interestingCombinatorics
Construction - Family
Improved Bound
Unsolved

A Baillie–PSW Pseudoprime

Moderately interestingNumber theory
Counterexample
Integer Solution
Unsolved

Chowla's Cosine Problem

Moderately interestingAnalysis
Construction - Finite
Improved Bound
Unsolved

Large \ell-Rank in Class Groups of Imaginary Quadratic Fields

Moderately interestingAlgebraic number theory
Record Breaking
Unsolved

A Rational Diophantine Septuple

Moderately interestingDiophantine
Integer Solution
Unsolved

The Earth–Moon Problem

Moderately interestingGraph theory
Construction - Finite
Improved Bound
Unsolved

Existence of EFX Allocations

Moderately interestingSocial choice
Construction - Finite
Counterexample
Unsolved

Elliptic Curves over Q\mathbb{Q} of Large Rank

Moderately interestingArithmetic geometry
Construction - Finite
Record Breaking
Unsolved

Euler's Sum of Powers Conjecture

Moderately interestingDiophantine
Counterexample
Integer Solution
Unsolved

Many Rational Points on a Genus-2 Curve

Moderately interestingDiophantine
Construction - Finite
Record Breaking
Unsolved

Hadamard Matrix of Order 668

Moderately interestingCombinatorics
Construction - Finite
Record Breaking
Unsolved

Hall's Conjecture

Moderately interestingDiophantine
Counterexample
Record Breaking
Unsolved

Littlewood Polynomials with Large Normalized Mahler Measure

Moderately interestingAnalysis
Construction - Finite
Improved Bound
Unsolved

Leech Trees

Moderately interestingCombinatorics
Construction - Finite
Record Breaking
Unsolved

The Rank of the 4×44\times4 Matrix-Multiplication Tensor

Moderately interestingCombinatorics
Algorithm
Record Breaking
Unsolved

The No-Three-in-Line Problem

Moderately interestingDiscrete geometry
Construction - Family
Improved Bound
Unsolved

Prime-Generating Polynomial Systems in Five Variables

Moderately interestingNumber theory
Construction - Finite
Improved Bound
Unsolved

The Ramsey Number R(6,6)R(6,6)

Moderately interestingGraph theory
Construction - Finite
Improved Bound
Unsolved

Book Ramsey Numbers

Moderately interestingGraph theory
Construction - Family
Unsolved

Large Integer Solutions to a Cubic Diophantine Equation

Moderately interestingDiophantine
Integer Solution
Unsolved

Sum of Three Cubes

Moderately interestingDiophantine
Integer Solution
Record Breaking
Solved

A Presentation of the Absolute Galois Group of Q2\mathbb{Q}_2

Solid resultNumber theory
Construction - Finite
Unsolved

The Arithmetic Kakeya Conjecture

Solid resultNumber theory
Construction - Finite
Improved Bound
Unsolved

Condorcet Winning Sets

Solid resultSocial choice
Construction - Finite
Counterexample
Unsolved

Conway's 99-Graph Problem

Solid resultGraph theory
Construction - Finite
Unsolved

Sensitivity versus Degree for Boolean Multilinear Polynomials

Solid resultCombinatorics
Construction - Finite
Improved Bound
Unsolved

Elliptic Curves with Prescribed Number of Points

Solid resultArithmetic geometry
Algorithm
Unsolved

A shape with Heesch number 7

Solid resultTopology/Geometry
Construction - Finite
Record Breaking
Unsolved

The Hirsch Conjecture in Dimension 4

Solid resultDiscrete geometry
Construction - Finite
Improved Bound
Unsolved

The Inverse Galois Problem for the Mathieu Group M23M_{23}

Solid resultNumber theory
Construction - Finite
Unsolved

Large Steiner Systems

Solid resultCombinatorics
Construction - Finite
Record Breaking
Unsolved

The Missing Moore Graph

Solid resultGraph theory
Construction - Finite
Unsolved

A counterexample to Wilf's Conjecture

Solid resultNumber theory
Construction - Finite
Counterexample
Unsolved

Polynomial Entire Minimal Graphs

Solid resultAnalysis
Construction - Finite
Unsolved

Dense Polynomials Whose Squares Are Sparse

Solid resultNumber theory
Construction - Finite
Unsolved

Class Group Algorithms

Solid resultAlgebraic number theory
Construction - Family
Unsolved

The Slice–Ribbon Conjecture and the GST Knot

Solid resultKnot theory
Construction - Finite
Counterexample
Unsolved

A Prescribed Class-Group Structure for an Imaginary Quadratic Field

Solid resultAlgebraic number theory
Construction - Finite
Unsolved

A Negative Coefficient in a Stretched Littlewood–Richardson Polynomial

Solid resultCombinatorics
Construction - Finite
Counterexample
Unsolved

Conway's Thrackle Conjecture

Solid resultGraph theory
Construction - Finite
Unsolved

The Core in Approval-Based Committee Elections

Major advanceSocial choice
Construction - Finite
Counterexample
Unsolved

The Elliptic-Curve Discrete Logarithm Problem (ECDLP)

Major advanceNumber theory
Algorithm
Unsolved

The Jones Unknot Conjecture

Major advanceKnot theory
Construction - Finite
Counterexample
Unsolved

The Lonely Runner Conjecture

Major advanceDiophantine
Counterexample
Unsolved

Pólya's Conjecture for the Dirichlet Laplacian

Major advanceSpectral geometry
Construction - Finite
Counterexample
Unsolved

Symplectic Ball Packing

Major advanceTopology/Geometry
Construction - Family
Unsolved

Apéry-Style Irrationality Proofs via Linear Recurrences

BreakthroughNumber theory
Construction - Finite
Unsolved

Improve the Best-known Classical Factorization Algorithms

BreakthroughNumber theory
Algorithm
Unsolved

The Smooth Four-Dimensional Poincaré Conjecture

BreakthroughTopology/Geometry
Construction - Finite
Counterexample

Changelog

2026-07-31: We have expanded the benchmark to 50 problems. We have also removed two problems from the benchmark, one about finding a surface with a high number of singularities and the other about finding an algorithm to decide whether a knot has unknotting number equal to 1. This was because we determined that the verifiers for these problems would not detect correct solutions with high enough fidelity.

We also removed the Ramsey-style hypergraph problem from the benchmark. Here we determined that, in hindsight, the problem did not meet our minimum bar for notability.

2026-06-27: We have stopped displaying failed AI attempts on the website. Problem pages will continue to be updated to reflect notable partial progress and solutions. We also modified the prompt for the problem about finding a surface with a high number of singularities. The verifier for this problem needs to be modified before it can handle what was described as Method C.

2026-03-05: We removed one problem from the benchmark, as we have determined that any solution would not meet our bar of being a publishable result in its own right. The problem page remains up: see it for more info on an AI-generated solution and subsequent human elaboration.

2026-02-24: We added two problems to the benchmark: finding a Hadamard matrix of order 668 and proving that certain “small” Diophantine equations have infinitely many solutions..

Verifier Access

Problems in FrontierMath: Open Problems are designed so that, even though no solution is known today, potential solutions can be checked for accuracy by a bespoke computer program, which we call a verifier.

Access to the verifiers is available for purchase by any party. Proceeds help fund the expansion of the benchmark. Our main cost is compensation to mathematicians, as the problems and verifiers are labor-intensive to formulate and implement.

At present, OpenAI is the only entity to have purchased access to the verifiers. OpenAI funded the creation of the original FrontierMath: Tiers 1-4, but Open Problems is developed independently and owned solely by Epoch.

Contact us with inquiries about purchasing access to the verifiers.

Downloads