id int64 1 30M | problem_number stringlengths 4 34 | title stringlengths 8 180 | statement stringlengths 11 35.2k | background stringlengths 395 52.6k | difficulty_level_id int64 1 5 | status stringclasses 3
values | proposed_by stringclasses 309
values | proposed_year int64 1.74k 2.03k ⌀ | category_id int64 1 20 | set_id int64 1 15 ⌀ | view_count int64 0 2.34k | favorite_count int64 0 156 | created_at timestamp[s]date 2024-01-01 00:00:00 2026-08-25 00:00:00 | updated_at timestamp[s]date 2024-01-01 00:00:00 2026-08-25 00:00:00 | published bool 1
class | category dict | difficulty dict | set dict | research_classification stringclasses 4
values | research_summary stringlengths 40 1.95k ⌀ | research_difficulty_suggested stringclasses 14
values | original_statement stringlengths 11 35.7k ⌀ | clean_statement stringlengths 11 35.2k ⌀ | statement_status stringclasses 4
values | statement_verification stringlengths 5 900 ⌀ | source_url stringlengths 25 84 ⌀ | tags listlengths 5 5 ⌀ | source_citation stringlengths 75 207 ⌀ | literature_assessment stringlengths 80 376 ⌀ | literature_sources listlengths 1 3 ⌀ | literature_checked_at timestamp[s]date 2026-08-21 00:00:00 2026-08-22 00:00:00 ⌀ |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1,161 | ALG-018 | Hilbert's Fifteenth Problem | Can Schubert calculus be given a rigorous foundation? | Hilbert's fifteenth problem, from his famous 1900 list, asks for a rigorous foundation of Schubert's enumerative calculus. Schubert calculus is a method for solving problems in enumerative geometry, such as counting the number of lines in 3-space that meet four given lines. While modern algebraic geometry has provided ... | 4 | open | null | null | 4 | null | 245 | 21 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,162 | ALG-019 | Hilbert's Sixteenth Problem | What is the maximum number and relative positions of limit cycles for polynomial vector fields of degree $n$ in the plane? | Hilbert's sixteenth problem consists of two parts. The first part (topology of algebraic curves) asks about the possible configurations of connected components of real algebraic curves. The second part asks for the maximum number and possible configurations of limit cycles of polynomial vector fields of degree $n$ in t... | 5 | open | null | null | 4 | null | 312 | 27 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,163 | GEO-008 | The Inscribed Square Problem | Does every simple closed curve in the plane contain four points that form the vertices of a square? | The inscribed square problem, also known as Toeplitz' conjecture, asks whether every Jordan curve (simple closed curve) in the plane contains four points forming a square. The problem has been open since 1911. It is known to be true for smooth curves and for many other special cases, but the general case for arbitrary ... | 4 | open | null | null | 6 | null | 456 | 39 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,164 | GEO-009 | Falconer's Conjecture | If a compact set in $\mathbb{R}^d$ has Hausdorff dimension greater than $d/2$, must it determine a set of distances with positive Lebesgue measure? | Falconer's conjecture concerns the relationship between the fractal dimension of a set and the set of distances between its points. Proposed by Kenneth Falconer in 1985, it states that if a compact set $E \subset \mathbb{R}^d$ has Hausdorff dimension strictly greater than $d/2$, then the distance set $\{|x-y| : x, y \i... | 5 | open | null | null | 6 | null | 289 | 25 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,165 | GT-010 | The Total Coloring Conjecture | Can every graph be totally colored with at most $\Delta + 2$ colors, where $\Delta$ is the maximum degree? | The total coloring conjecture, proposed independently by Behzad and Vizing in the 1960s, concerns coloring both vertices and edges of a graph such that no two adjacent or incident elements receive the same color. The conjecture states that every graph can be totally colored using at most $\Delta + 2$ colors where $\Del... | 3 | open | null | null | 3 | null | 234 | 20 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 3,
"name": "graph_theory",
"display_name": "Graph Theory",
"description": "Problems involving graphs, networks, and their properties.",
"slug": "graph-theory",
"order_index": 3,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 3,
"level": 3,
"name": "L3: Advanced",
"description": "Difficult problems requiring specialized knowledge and sophisticated techniques.",
"color_class": "text-yellow-600 bg-yellow-50 border-yellow-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,171 | NT-026 | The Odd Perfect Number Conjecture | Do there exist any odd perfect numbers? (A perfect number equals the sum of its proper divisors.) | A perfect number is a positive integer that equals the sum of its proper positive divisors. Euclid showed that numbers of the form $2^{p-1}(2^p - 1)$ are perfect when $2^p - 1$ is prime (Mersenne prime), giving all known even perfect numbers. Whether odd perfect numbers exist has been an open question for over 2000 yea... | 5 | open | null | null | 1 | null | 678 | 58 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,172 | NT-027 | Firoozbakht's Conjecture | Is the sequence $p_n^{1/n}$ strictly decreasing, where $p_n$ is the $n$-th prime? | Firoozbakht's conjecture, proposed in 1982, states that the sequence $(p_n)^{1/n}$ is strictly decreasing, where $p_n$ denotes the $n$-th prime number. This is equivalent to saying that $p_{n+1}^n < p_n^{n+1}$ for all $n$. The conjecture is stronger than Cramér's conjecture about prime gaps and has been verified comput... | 4 | open | null | null | 1 | null | 198 | 17 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,173 | AG-004 | The Tate Conjecture | For varieties over finite fields, are the $\ell$-adic representations arising from étale cohomology related to algebraic cycles in the expected way? | The Tate conjecture, proposed by John Tate in 1963, is a fundamental problem in arithmetic geometry. It concerns the relationship between algebraic cycles on algebraic varieties over finite fields and the Galois representations arising from étale cohomology. The conjecture would provide a powerful tool for understandin... | 5 | open | null | null | 5 | null | 256 | 22 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 5,
"name": "algebraic_geometry",
"display_name": "Algebraic Geometry",
"description": "Geometric objects defined by polynomial equations.",
"slug": "algebraic-geometry",
"order_index": 5,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,176 | SET-002 | Suslin's Problem | If a dense linear order without endpoints is complete and has the countable chain condition, must it be isomorphic to the real numbers? | Suslin's problem, posed by Mikhail Suslin in 1920, asks whether the real numbers can be characterized by certain order-theoretic properties. Specifically, it asks if every complete dense linear order without endpoints satisfying the countable chain condition (every family of disjoint open intervals is countable) must b... | 5 | open | null | null | 10 | null | 289 | 25 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 10,
"name": "set_theory",
"display_name": "Set Theory",
"description": "Foundations of mathematics, infinite sets, and cardinality.",
"slug": "set-theory",
"order_index": 10,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,179 | NT-028 | Schinzel's Hypothesis H | If polynomials satisfy certain necessary divisibility conditions, do they simultaneously produce infinitely many primes for integer inputs? | Schinzel's Hypothesis H is a sweeping generalization of many conjectures about primes, including the twin prime conjecture, Sophie Germain prime conjecture, and Dickson's conjecture. It states that if $f_1, \ldots, f_k$ are irreducible polynomials with integer coefficients and positive leading coefficients, and no prim... | 5 | open | null | null | 1 | null | 298 | 26 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,180 | ALG-020 | The Uniform Boundedness Conjecture | Is there a bound $B(g, d)$ such that every curve of genus $g$ over a number field of degree $d$ has at most $B(g, d)$ rational points? | The uniform boundedness conjecture for rational points on curves asks whether, for fixed genus $g$ and degree $d$, there exists a bound on the number of rational points on genus-$g$ curves over number fields of degree $d$. This would be a vast generalization of Mordell's conjecture (now Faltings' theorem, which shows f... | 5 | open | null | null | 4 | null | 234 | 20 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,181 | ALG-021 | The Pierce-Birkhoff Conjecture | Is every piecewise-polynomial function $f: \mathbb{R}^n \to \mathbb{R}$ the maximum of finitely many minimums of finite collections of polynomials? | The Pierce-Birkhoff conjecture asks whether every continuous piecewise polynomial function on $\mathbb{R}^n$ can be represented using only the operations of addition, multiplication, and taking finite suprema and infima of polynomial functions. The conjecture has been verified in dimension 1 and for $n = 2$ in special ... | 4 | open | null | null | 4 | null | 178 | 15 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,182 | ALG-022 | Serre's Positivity Conjecture | If $R$ is a regular local ring and $P, Q$ are prime ideals with intersecting dimensions satisfying a certain condition, is the intersection multiplicity positive? | Serre's positivity conjecture (part of Serre's multiplicity conjectures) concerns intersection multiplicities in commutative algebra. It states that if $R$ is a commutative regular local ring and $P, Q$ are prime ideals with $\dim(R/P) + \dim(R/Q) = \dim(R)$, then the intersection multiplicity $\chi(R/P, R/Q) > 0$. The... | 5 | open | null | null | 4 | null | 156 | 13 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,183 | NT-029 | Artin's Conjecture on Primitive Roots | For how many prime numbers $p$ is a given integer $a$ (not $\pm 1$ or a perfect square) a primitive root modulo $p$? | Artin's conjecture on primitive roots states that any integer $a$ that is neither $-1$, $\pm 1$, nor a perfect square is a primitive root modulo infinitely many primes, and gives a conjectured density for such primes. For example, it predicts that 2 is a primitive root for approximately 37.4% of all primes. Under the a... | 5 | open | null | null | 1 | null | 267 | 23 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,184 | NT-030 | The abc Conjecture | For coprime integers $a, b, c$ with $a + b = c$, is $c$ usually not much larger than the product of distinct primes dividing $abc$? | The abc conjecture, proposed by Oesterlé and Masser in 1985, is one of the most important open problems in number theory. It states that for any $\epsilon > 0$, there are only finitely many triples of coprime positive integers $(a,b,c)$ with $a + b = c$ such that $c > \text{rad}(abc)^{1+\epsilon}$, where $\text{rad}(n)... | 5 | open | null | null | 1 | null | 892 | 76 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,185 | GEO-010 | The Shephard's Problem | Can the unit ball in $\mathbb{R}^n$ be illuminated by fewer than $2^n$ directions? | Shephard's problem, a variant of the illumination problem, asks how many directions are needed to illuminate the entire boundary of the unit ball in $n$-dimensional space. A direction illuminates a boundary point if moving in that direction from the point leads outside the ball. It is known that $2^n$ directions suffic... | 4 | open | null | null | 6 | null | 198 | 17 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,187 | ALG-023 | The Andrews-Curtis Conjecture | Can every balanced presentation of the trivial group be transformed into a trivial presentation by a sequence of Nielsen transformations and conjugations? | Proposed in 1965 by James Andrews and Morton Curtis, this conjecture addresses the problem of simplifying group presentations. A balanced presentation has the same number of generators and relators. The question asks whether any such presentation of the trivial group can be reduced to the obvious trivial presentation t... | 4 | open | null | null | 4 | null | 412 | 28 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,188 | ALG-024 | The Bounded Burnside Problem | For which positive integers $m$ and $n$ is the free Burnside group $B(m,n)$ finite? In particular, is $B(2, 5)$ finite? | The Burnside problem, posed in 1902, asks whether a finitely generated group in which every element has finite order must itself be finite. The bounded version restricts to groups where all elements have order dividing a fixed $n$. Major breakthroughs came when Novikov and Adian (1968) proved $B(m,n)$ is infinite for o... | 5 | open | null | null | 4 | null | 687 | 52 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,189 | ALG-025 | The Guralnick-Thompson Conjecture | What are the composition factors of finite groups appearing in genus-0 systems? | This conjecture, proposed by Robert Guralnick and John Thompson, concerns the classification of finite groups that can act on Riemann surfaces of genus 0. The conjecture provides a list of simple groups that can appear as composition factors of such groups. The problem connects group theory with algebraic geometry and ... | 4 | open | null | null | 4 | null | 298 | 19 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,190 | ALG-026 | The Herzog-Schönheim Conjecture | If a finite system of left cosets of subgroups of a group $G$ partitions $G$, must some two subgroups have the same index? | Proposed independently by Marcel Herzog and Jochanan Schönheim in 1974, this conjecture states that if finitely many left cosets of subgroups partition a group, then at least two of the subgroups must have the same finite index. This problem arises naturally in the study of group coverings and has connections to number... | 4 | open | null | null | 4 | null | 321 | 22 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,191 | ALG-027 | The Inverse Galois Problem | Is every finite group the Galois group of some Galois extension of $\mathbb{Q}$? | The inverse Galois problem is one of the central open problems in Galois theory. While classical Galois theory establishes a correspondence between field extensions and groups, the inverse problem asks whether every finite group can be realized as the Galois group of an extension of the rational numbers. The problem wa... | 5 | open | null | null | 4 | null | 892 | 67 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,192 | ALG-028 | The Isomorphism Problem for Coxeter Groups | Is there an algorithm to determine whether two Coxeter groups given by presentations are isomorphic? | Coxeter groups are fundamental objects in geometric group theory, generated by reflections with certain relations. They include the symmetry groups of regular polytopes and tessellations. The isomorphism problem asks whether there exists an algorithmic procedure to decide if two Coxeter groups, given by their Coxeter d... | 4 | open | null | null | 4 | null | 367 | 25 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,193 | ALG-029 | Infinitude of Leinster Groups | Are there infinitely many Leinster groups? | A Leinster group is a finite group whose order equals the sum of the orders of its proper normal subgroups. Named after Tom Leinster who studied them in 1996, only two examples are currently known: the cyclic group of order 6 and a group of order 12. The question of whether infinitely many such groups exist remains ope... | 3 | open | null | null | 4 | null | 245 | 18 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 3,
"level": 3,
"name": "L3: Advanced",
"description": "Difficult problems requiring specialized knowledge and sophisticated techniques.",
"color_class": "text-yellow-600 bg-yellow-50 border-yellow-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,194 | ALG-030 | Existence of Generalized Moonshine | Does generalized moonshine exist for all elements of the Monster group? | Monstrous moonshine, discovered in the 1970s and proven by Borcherds (Fields Medal 1998), reveals a surprising connection between the Monster group (the largest sporadic simple group) and modular functions. Generalized moonshine extends this to other elements of the Monster group, asking whether similar connections exi... | 5 | open | null | null | 4 | null | 543 | 41 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,195 | ALG-031 | Finiteness of Finitely Presented Periodic Groups | Is every finitely presented periodic group finite? | A periodic group (or torsion group) is one in which every element has finite order. The question of whether a finitely presented periodic group must be finite was a major open problem for much of the 20th century. The restricted Burnside problem, solved by Zel'manov, showed that finitely generated groups where all elem... | 5 | open | null | null | 4 | null | 456 | 33 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,196 | ALG-032 | The Surjunctivity Conjecture | Is every group surjunctive? | A group is surjunctive if every injective cellular automaton over that group is also surjective. Equivalently, every injective endomorphism of the shift space is surjective. This property was introduced by Gottschalk in 1973 and connects symbolic dynamics, cellular automata theory, and group theory. Gromov and Weiss pr... | 4 | open | null | null | 4 | null | 389 | 27 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,197 | ALG-033 | The Sofic Groups Conjecture | Is every discrete countable group sofic? | A group is sofic if it can be approximated by finite symmetric groups in a precise sense. The concept was introduced by Gromov and Weiss around 1999 and has become central in modern group theory. All known groups are sofic: amenable groups, residually finite groups, linear groups, and many others. The soficity of all g... | 5 | open | null | null | 4 | null | 612 | 48 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,198 | ALG-034 | Arthur's Conjectures | What is the structure of the discrete spectrum of automorphic forms on reductive groups? | Proposed by James Arthur in the 1980s, these conjectures describe the decomposition of the space of automorphic forms into irreducible representations. They provide a framework for understanding the discrete spectrum in terms of endoscopic groups and Arthur packets. The conjectures connect representation theory, harmon... | 5 | open | null | null | 4 | null | 478 | 35 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,199 | ALG-035 | Dade's Conjecture | Is there a relationship between the numbers of irreducible characters in blocks of a finite group and its local subgroups? | Proposed by Everett Dade in 1992, this conjecture concerns the modular representation theory of finite groups. It relates the number of irreducible characters of a given defect in a block of a finite group to corresponding numbers in blocks of certain local subgroups (normalizers of p-subgroups). The conjecture is part... | 4 | open | null | null | 4 | null | 312 | 21 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,200 | ALG-036 | The Demazure Conjecture | Can representations of semisimple algebraic groups be characterized over the integers? | Proposed by Michel Demazure in the 1970s, this conjecture concerns the existence of certain integral structures on representations of algebraic groups. It asks whether irreducible representations of semisimple algebraic groups over fields of positive characteristic can be deformed to characteristic zero while preservin... | 4 | open | null | null | 4 | null | 289 | 18 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,203 | GEO-012 | The Spherical Bernstein Problem | What is the classification of complete minimal hypersurfaces in spheres of all dimensions? | This is a generalization of Bernstein's problem (solved by 1968) which asked whether the only minimal graph over all of Euclidean space is a hyperplane. The spherical version asks for the classification of complete minimal hypersurfaces in the sphere $S^{n+1}$. While progress has been made in specific dimensions, a com... | 4 | open | null | null | 6 | null | 387 | 24 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,204 | GEO-013 | The Carathéodory Conjecture | Does every convex, closed, twice-differentiable surface in $\mathbb{R}^3$ have at least two umbilical points? | Proposed by Constantin Carathéodory in the 1920s, this conjecture concerns umbilical points on convex surfaces—points where the principal curvatures are equal. The conjecture states that any smooth closed convex surface in 3-dimensional Euclidean space must have at least two such points. A sphere has infinitely many um... | 4 | open | null | null | 6 | null | 456 | 31 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,205 | GEO-014 | The Cartan-Hadamard Conjecture | Does the isoperimetric inequality hold for Cartan-Hadamard manifolds? | The classical isoperimetric inequality states that among all regions of fixed volume in Euclidean space, a ball has the smallest surface area. The Cartan-Hadamard conjecture asks whether this extends to Cartan-Hadamard manifolds—complete, simply connected Riemannian manifolds of nonpositive sectional curvature. The con... | 4 | open | null | null | 6 | null | 523 | 39 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,206 | GEO-015 | Chern's Affine Conjecture | Does the Euler characteristic of a compact affine manifold vanish? | Proposed by Shiing-Shen Chern, this conjecture states that every closed affine manifold (a manifold with an atlas whose transition functions are affine transformations) has Euler characteristic zero. An affine structure is stronger than a smooth structure but weaker than a Riemannian structure. The conjecture has been ... | 4 | open | null | null | 6 | null | 398 | 27 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,207 | GEO-016 | Chern's Conjecture for Hypersurfaces in Spheres | What minimal hypersurfaces in spheres have constant mean curvature? | This is actually a family of related conjectures proposed by Shiing-Shen Chern concerning the classification of minimal and constant mean curvature hypersurfaces embedded in spheres. One version asks whether the only minimal hypersurface in $S^{n+1}$ with constant scalar curvature is the totally geodesic $S^n$. These c... | 4 | open | null | null | 6 | null | 367 | 23 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,208 | GEO-017 | The Closed Curve Problem | What are necessary and sufficient conditions for an integral curve defined by two periodic functions to be closed? | This problem asks for explicit, computable conditions to determine when a curve defined parametrically by integrating two periodic functions with the same period will close up. The question arises naturally in dynamical systems, Hamiltonian mechanics, and the study of periodic orbits. While special cases are understood... | 3 | open | null | null | 6 | null | 289 | 19 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 3,
"level": 3,
"name": "L3: Advanced",
"description": "Difficult problems requiring specialized knowledge and sophisticated techniques.",
"color_class": "text-yellow-600 bg-yellow-50 border-yellow-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,209 | GEO-018 | The Filling Area Conjecture | Does a hemisphere have minimum area among shortcut-free surfaces with a given boundary length? | This conjecture in systolic geometry states that among all surfaces in Euclidean space whose boundary is a closed curve of given length and which contain no shortcuts (the surface distance between boundary points equals the Euclidean distance), the hemisphere has minimal area. The problem was proposed by Gromov and con... | 4 | open | null | null | 6 | null | 334 | 22 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,210 | GEO-019 | The Hopf Conjectures | What is the relationship between curvature and Euler characteristic for even-dimensional Riemannian manifolds? | Heinz Hopf proposed several conjectures relating the sign of sectional curvature to the Euler characteristic and other topological invariants of closed Riemannian manifolds. The most famous asks whether a closed even-dimensional manifold with positive (or negative) sectional curvature must have positive Euler character... | 5 | open | null | null | 6 | null | 567 | 43 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,211 | GEO-020 | The Osserman Conjecture | Is every Osserman manifold either flat or locally isometric to a rank-one symmetric space? | An Osserman manifold is a Riemannian manifold where the eigenvalues of the Jacobi operator are constant on the unit sphere bundle at each point. Robert Osserman conjectured that such manifolds must be either flat or locally isometric to a rank-one symmetric space (spheres, projective spaces, or hyperbolic spaces). The ... | 4 | open | null | null | 6 | null | 412 | 28 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,212 | GEO-021 | Yau's Conjecture on First Eigenvalues | Is the first eigenvalue of the Laplace-Beltrami operator on a minimal hypersurface in $S^{n+1}$ equal to $n$? | Proposed by Shing-Tung Yau, this conjecture states that for any closed embedded minimal hypersurface in the $(n+1)$-dimensional sphere $S^{n+1}$, the first nonzero eigenvalue of the Laplace-Beltrami operator equals $n$. This would provide a sharp spectral characterization of minimal hypersurfaces in spheres. The conjec... | 4 | open | null | null | 6 | null | 478 | 34 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,213 | GEO-022 | The Hadwiger Covering Conjecture | Can every $n$-dimensional convex body be covered by at most $2^n$ smaller homothetic copies? | Proposed by Hugo Hadwiger in 1957, this conjecture states that any $n$-dimensional convex body can be covered by at most $2^n$ positive homothetic (scaled and translated) copies of itself with smaller ratio. The conjecture is known to be true for $n = 1$ (trivial) and $n = 2$ (proven), but remains open for $n \geq 3$. ... | 4 | open | null | null | 6 | null | 523 | 38 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,214 | GEO-023 | The Happy Ending Problem | What is the minimum number of points in the plane needed to guarantee a convex $n$-gon? | The Happy Ending problem, named by Paul Erdős because it led to the marriage of Esther Klein and George Szekeres, asks for $g(n)$—the smallest number such that any set of $g(n)$ points in general position contains $n$ points forming a convex $n$-gon. It's known that $2^{n-2} + 1 \leq g(n) \leq \binom{2n-4}{n-2} + 1$. T... | 4 | open | null | null | 6 | null | 612 | 47 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,215 | GEO-024 | The Heilbronn Triangle Problem | What is the largest minimum area of a triangle determined by $n$ points in a unit square? | Proposed by Hans Heilbronn in 1908, this problem asks how to place $n$ points in a unit square to maximize the smallest area of any triangle they determine. Heilbronn originally conjectured the maximum was $O(1/n^2)$, but this was disproven—the actual order is between $\Omega(\log n / n^2)$ and $O(1/n^{8/7-\epsilon})$.... | 4 | open | null | null | 6 | null | 445 | 31 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,216 | GEO-025 | Kalai's $3^d$ Conjecture | Does every centrally symmetric $d$-dimensional polytope have at least $3^d$ faces? | Proposed by Gil Kalai in 1989, this conjecture states that any centrally symmetric convex polytope in $d$ dimensions must have at least $3^d$ faces (including the polytope itself and the empty set). The bound is tight, achieved by the $d$-dimensional cube which has exactly $3^d$ faces. The conjecture has been verified ... | 4 | open | null | null | 6 | null | 378 | 26 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,217 | GEO-026 | The Unit Distance Problem | What is the maximum number of unit distances determined by $n$ points in the plane? | This problem, posed by Erdős in 1946, asks for the maximum number of pairs of points at distance exactly 1 in a set of $n$ points in the Euclidean plane. The best known construction gives $\Omega(n^{4/3})$ unit distances, while the best upper bound is $O(n^{4/3})$. Determining the exact asymptotic (and whether the expo... | 4 | open | null | null | 6 | null | 567 | 42 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,219 | GEO-028 | Ehrhart's Volume Conjecture | Does a convex body in $\mathbb{R}^n$ with one interior lattice point at its center of mass have volume at most $(n+1)^n/n!$? | Proposed by Eugène Ehrhart, this conjecture concerns lattice polytopes—convex bodies whose vertices have integer coordinates. It states that if a convex body in $n$ dimensions contains exactly one lattice point in its interior (which is its center of mass), then its volume cannot exceed $(n+1)^n/n!$, the volume of a re... | 4 | open | null | null | 6 | null | 389 | 27 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,220 | ALG-039 | The Cherlin-Zilber Conjecture | Is every simple group with a stable first-order theory an algebraic group over an algebraically closed field? | Proposed by Gregory Cherlin and Boris Zilber in the 1970s, this conjecture connects model theory and group theory. It states that any infinite simple group whose first-order theory is stable must be isomorphic to a simple algebraic group defined over an algebraically closed field. The conjecture has been verified for m... | 5 | open | null | null | 4 | null | 412 | 29 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,221 | ALG-040 | The Generalized Star Height Problem | Can all regular languages be expressed with generalized regular expressions of bounded star height? | This problem in formal language theory asks whether there exists a uniform bound on the nesting depth of Kleene star operations needed to express any regular language using generalized regular expressions (which allow complementation). While the ordinary star height problem (without complementation) was solved—showing ... | 4 | open | null | null | 4 | null | 334 | 23 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 4,
"name": "algebra",
"display_name": "Algebra",
"description": "Group theory, ring theory, field theory, and algebraic structures.",
"slug": "algebra",
"order_index": 4,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,222 | NT-031 | Hilbert's Tenth Problem for Number Fields | For which number fields is there an algorithm to determine solvability of Diophantine equations? | Hilbert's tenth problem asked for an algorithm to determine whether a Diophantine equation has integer solutions. Matiyasevich (building on work by Davis, Putnam, and Robinson) proved in 1970 that no such algorithm exists for the integers. The problem remains open for other rings, particularly number fields (finite ext... | 5 | open | null | null | 1 | null | 523 | 39 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,224 | GEO-029 | Borsuk's Conjecture | Can every bounded set in $\mathbb{R}^n$ be partitioned into $n+1$ sets of smaller diameter? | Proposed by Karol Borsuk in 1933, this conjecture asks whether every bounded set in $n$-dimensional Euclidean space can be partitioned into $n+1$ parts, each with diameter strictly smaller than the original set. The conjecture held for dimensions up to 3 until 1993, when Kahn and Kalai found a counterexample in dimensi... | 4 | open | null | null | 6 | null | 523 | 39 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,225 | GEO-030 | The Kissing Number Problem | What is the maximum number of non-overlapping unit spheres that can touch a central unit sphere in $n$ dimensions? | The kissing number $\tau_n$ is the maximum number of non-overlapping unit spheres that can simultaneously touch a central unit sphere in $n$-dimensional Euclidean space. Known exactly only for dimensions 1, 2, 3, 4, 8, and 24, this problem has connections to sphere packing, coding theory, and lattice theory. The dimens... | 4 | open | null | null | 6 | null | 612 | 46 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,226 | GEO-031 | Ulam's Packing Conjecture | Is the sphere the worst-packing convex solid? | Proposed by Stanisław Ulam, this conjecture asks which three-dimensional convex body has the smallest packing density. Ulam conjectured that the sphere is the worst-packing convex solid, meaning that among all convex bodies in 3D, spheres have the smallest proportion of space filled when packed. While the sphere packin... | 4 | open | null | null | 6 | null | 445 | 32 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,227 | GEO-032 | Sphere Packing in High Dimensions | What is the densest packing of unit spheres in dimensions other than 1, 2, 3, 8, and 24? | The sphere packing problem asks for the densest arrangement of non-overlapping unit spheres in $n$-dimensional Euclidean space. Solved for dimensions 1 and 2 (trivial), dimension 3 by Hales (1998, computer-assisted proof), dimension 8 by Viazovska (2016), and dimension 24 by Cohn et al. (2016), the problem remains open... | 5 | open | null | null | 6 | null | 734 | 58 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,231 | COMB-010 | The Cap Set Problem | What is the maximum size of a cap set in $\mathbb{F}_3^n$? | A cap set is a subset of the $n$-dimensional vector space over the three-element field with no three elements in arithmetic progression (analogous to the card game SET). The problem asks for the maximum size of such a set as a function of $n$. In 2016, Ellenberg and Gijswijt proved an upper bound of $O(2.756^n)$, drama... | 4 | open | null | null | 2 | null | 523 | 40 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 2,
"name": "combinatorics",
"display_name": "Combinatorics",
"description": "Counting problems, graph theory, discrete structures.",
"slug": "combinatorics",
"order_index": 2,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,235 | COMB-012 | The Sunflower Conjecture | Does every family of at least $c^k k!$ sets of size $k$ contain a sunflower of size 3, for some absolute constant $c$? | Proposed by Erdős and Rado in 1960, a sunflower (or $\Delta$-system) is a collection of sets where every pair shares the same common intersection. The conjecture asks whether the exponential bound $c^k k!$ suffices to guarantee a sunflower of any fixed size. The best known bound is super-exponential. In 2019, Alweiss e... | 5 | open | null | null | 2 | null | 612 | 48 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 2,
"name": "combinatorics",
"display_name": "Combinatorics",
"description": "Counting problems, graph theory, discrete structures.",
"slug": "combinatorics",
"order_index": 2,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,236 | COMB-013 | Ramsey Number $R(5,5)$ | What is the exact value of the Ramsey number $R(5,5)$? | Ramsey numbers quantify the size at which complete disorder becomes impossible. $R(5,5)$ is the minimum number of vertices such that any two-coloring of the edges of the complete graph contains either a red $K_5$ or a blue $K_5$. It is known that $43 \leq R(5,5) \leq 48$, but the exact value remains unknown despite ove... | 4 | open | null | null | 2 | null | 823 | 67 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 2,
"name": "combinatorics",
"display_name": "Combinatorics",
"description": "Counting problems, graph theory, discrete structures.",
"slug": "combinatorics",
"order_index": 2,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,239 | NT-032 | Gauss Circle Problem | How far can the number of lattice points in a circle centered at the origin deviate from the area of the circle? | The Gauss circle problem asks for the tightest bound on the error term in counting integer lattice points $(m,n)$ inside a circle of radius $r$ centered at the origin. The number of such points is $\pi r^2 + E(r)$ where $E(r)$ is the error. It is known that $E(r) = O(r^{2/3})$ and $E(r) = \Omega(r^{1/2} \log r)$, but t... | 4 | open | null | null | 1 | null | 478 | 35 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,240 | NT-033 | Grimm's Conjecture | Can each element of a set of consecutive composite numbers be assigned a distinct prime divisor? | Proposed by C. A. Grimm in 1969, this conjecture states that if we have $k$ consecutive composite numbers, then there exist $k$ distinct primes each dividing one of these numbers. For example, the consecutive composites $24, 25, 26, 27, 28$ have distinct prime divisors $3, 5, 13, 7, 2$ respectively. While verified comp... | 4 | open | null | null | 1 | null | 412 | 29 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,241 | NT-034 | Hall's Conjecture | For any $\varepsilon > 0$, is there a constant $c(\varepsilon)$ such that either $y^2 = x^3$ or $|y^2 - x^3| > c(\varepsilon) x^{1/2-\varepsilon}$? | Proposed by Marshall Hall Jr. in 1970, this conjecture provides a measure of how close a perfect square can be to a perfect cube without being equal. It strengthens earlier work on Diophantine approximation and relates to the ABC conjecture. The conjecture has been verified for many special cases but remains open in ge... | 4 | open | null | null | 1 | null | 445 | 33 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,242 | NT-035 | Lehmer's Totient Problem | If Euler's totient function $\phi(n)$ divides $n-1$, must $n$ be prime? | Posed by D. H. Lehmer in 1932, this problem asks whether any composite number $n$ exists such that $\phi(n)$ divides $n-1$, where $\phi(n)$ counts integers up to $n$ coprime to $n$. For all primes $p$, we have $\phi(p) = p-1$, so the divisibility holds. Lehmer conjectured no composite number has this property. It has b... | 4 | open | null | null | 1 | null | 523 | 41 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,243 | NT-036 | Magic Square of Squares | Does there exist a 3×3 magic square composed entirely of distinct perfect squares? | A magic square has the property that all rows, columns, and diagonals sum to the same value. While magic squares of integers are well understood, the question of whether a 3×3 magic square can be constructed using only distinct perfect squares has remained open for centuries. Martin LaBar proved in 1984 that no such sq... | 4 | open | null | null | 1 | null | 589 | 47 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,244 | NT-037 | Mahler's 3/2 Problem | Is there a real number $x$ such that the fractional parts of $x(3/2)^n$ are all less than $1/2$ for every positive integer $n$? | Proposed by Kurt Mahler in the 1960s, this problem concerns the distribution of the sequence $\{x(3/2)^n\}$ modulo 1, where $\{y\}$ denotes the fractional part of $y$. Mahler conjectured that no such $x$ exists. The problem relates to ergodic theory, uniform distribution, and Diophantine approximation. While various pa... | 4 | open | null | null | 1 | null | 398 | 28 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,245 | NT-038 | Newman's Conjecture | Does the partition function satisfy any arbitrary congruence infinitely often? | Proposed by Morris Newman, this conjecture concerns the partition function $p(n)$, which counts the number of ways to write $n$ as a sum of positive integers. Newman conjectured that for any integers $a$ and $m$ with $\gcd(a,m) = 1$, there are infinitely many $n$ such that $p(n) \equiv a \pmod{m}$. This would imply the... | 4 | open | null | null | 1 | null | 367 | 26 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,246 | NT-039 | Scholz Conjecture | Is the shortest addition chain for $2^n - 1$ at most $n - 1$ plus the length of the shortest addition chain for $n$? | An addition chain for $m$ is a sequence $1 = a_0 < a_1 < \cdots < a_r = m$ where each $a_i$ (for $i > 0$) is the sum of two earlier terms. Scholz conjectured in 1937 that $\ell(2^n-1) \leq n-1+\ell(n)$ where $\ell(m)$ denotes the minimum length of an addition chain for $m$. This has applications to efficient exponentia... | 4 | open | null | null | 1 | null | 412 | 30 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,248 | NT-041 | Infinitely Many Perfect Numbers | Are there infinitely many perfect numbers? | A perfect number equals the sum of its proper divisors (divisors excluding itself). Examples include 6 = 1+2+3 and 28 = 1+2+4+7+14. Euclid proved that if $2^p - 1$ is prime (a Mersenne prime), then $2^{p-1}(2^p-1)$ is perfect. All known perfect numbers have this form and are even. Whether infinitely many exist depends ... | 4 | open | null | null | 1 | null | 678 | 54 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,250 | NT-043 | Quasiperfect Numbers | Do quasiperfect numbers exist? | A quasiperfect number is a natural number $n$ such that the sum of its divisors equals $2n + 1$ (one more than twice the number). No quasiperfect number has ever been found. It has been proven that if one exists, it must be an odd square number greater than $10^{35}$, and have at least seven distinct prime factors. The... | 4 | open | null | null | 1 | null | 398 | 28 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,251 | NT-044 | Almost Perfect Numbers Beyond Powers of 2 | Do any almost perfect numbers exist that are not powers of 2? | An almost perfect number $n$ has the sum of its proper divisors equal to $n - 1$. All powers of 2 are almost perfect, since the divisors of $2^k$ are $1, 2, 4, \ldots, 2^{k-1}$ which sum to $2^k - 1$. It remains unknown whether any odd almost perfect number exists, or any even almost perfect number that is not a power ... | 4 | open | null | null | 1 | null | 356 | 25 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,252 | NT-045 | The Number of Idoneal Numbers | Are there exactly 65 idoneal numbers, or could there be 66 or 67? | Idoneal numbers (also called suitable or convenient numbers) are positive integers $D$ such that if $n = ax^2 + by^2$ with coprime $a,b$ is uniquely representable, then $n$ is a prime power or twice a prime power. Euler conjectured 65 such numbers exist, the largest being 1848. Weinberger proved in 1973 that at most on... | 4 | open | null | null | 1 | null | 334 | 24 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,253 | NT-046 | Amicable Numbers of Opposite Parity | Do any pairs of amicable numbers exist where one is odd and one is even? | Two numbers are amicable if each equals the sum of the proper divisors of the other. For example, 220 and 284 are amicable (both even). Over 12 million amicable pairs are known, all with matching parity (both even or both odd). It remains unknown whether a mixed-parity pair exists. Such a pair would require unusual div... | 4 | open | null | null | 1 | null | 389 | 27 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,254 | NT-047 | Infinitely Many Amicable Pairs | Are there infinitely many pairs of amicable numbers? | Amicable numbers are pairs where each number equals the sum of the other's proper divisors. While over 12 million pairs have been discovered, it remains unknown whether infinitely many exist. Thabit ibn Qurra (9th century) gave a formula generating some pairs, and Euler found many more. Various conjectures suggest thei... | 4 | open | null | null | 1 | null | 445 | 33 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,255 | NT-048 | Infinitely Many Giuga Numbers | Are there infinitely many Giuga numbers? | A Giuga number is a composite number $n$ such that $p$ divides $(n/p - 1)$ for every prime divisor $p$ of $n$. Equivalently, $\sum_{p|n} (1/p) - 1/n$ is an integer. Only 15 Giuga numbers are known, the smallest being 30. Giuga conjectured that if $1 + \sum_{i=1}^{n-1} i^{n-1} \equiv 0 \pmod{n}$ for composite $n$, then ... | 4 | open | null | null | 1 | null | 367 | 26 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,256 | NT-049 | Lychrel Numbers in Base 10 | Do Lychrel numbers exist in base 10? | A Lychrel number is a natural number that never forms a palindrome through the iterative process of adding it to its reverse. For example, 89 is not Lychrel: 89 + 98 = 187, 187 + 781 = 968, 968 + 869 = 1837, 1837 + 7381 = 9218, 9218 + 8129 = 17347, 17347 + 74371 = 91718, 91718 + 81719 = 173437, 173437 + 734371 = 907808... | 3 | open | null | null | 1 | null | 512 | 39 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 3,
"level": 3,
"name": "L3: Advanced",
"description": "Difficult problems requiring specialized knowledge and sophisticated techniques.",
"color_class": "text-yellow-600 bg-yellow-50 border-yellow-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,257 | NT-050 | Odd Weird Numbers | Do any odd weird numbers exist? | A weird number is a natural number that is abundant (the sum of its proper divisors exceeds the number) but not semiperfect (no subset of its divisors sums to the number). The smallest weird number is 70. All known weird numbers are even, and it has been conjectured that no odd weird numbers exist. If an odd weird numb... | 4 | open | null | null | 1 | null | 378 | 27 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,258 | NT-051 | Normality of Pi | Is $\pi$ a normal number in base 10? | A number is normal in base 10 if every digit 0-9 appears with equal frequency (1/10) in its decimal expansion, and more generally, every sequence of $k$ digits appears with frequency $1/10^k$. While the digits of $\pi$ appear statistically random in computational tests extending to trillions of digits, no proof of norm... | 5 | open | null | null | 1 | null | 823 | 68 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,259 | NT-052 | Normality of Irrational Algebraic Numbers | Are all irrational algebraic numbers normal in every base? | An algebraic number is a root of a polynomial with integer coefficients. Normal numbers have every digit sequence appear with the expected frequency in their base expansions. It is conjectured that all irrational algebraic numbers like $\sqrt{2}$ are normal in every integer base, but not a single irrational algebraic n... | 5 | open | null | null | 1 | null | 567 | 45 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,260 | NT-053 | Is 10 a Solitary Number? | Is 10 a solitary number (no other number shares its abundancy index)? | The abundancy index of $n$ is $\sigma(n)/n$ where $\sigma(n)$ is the sum of divisors of $n$. A number is solitary if no other number has the same abundancy index. For 10, we have $\sigma(10) = 1+2+5+10 = 18$, giving abundancy $18/10 = 9/5$. It remains unknown whether any other number has abundancy $9/5$. Numbers in ami... | 3 | open | null | null | 1 | null | 334 | 24 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 3,
"level": 3,
"name": "L3: Advanced",
"description": "Difficult problems requiring specialized knowledge and sophisticated techniques.",
"color_class": "text-yellow-600 bg-yellow-50 border-yellow-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,262 | NT-055 | Erdős Conjecture on Arithmetic Progressions | If the sum of reciprocals of a set of positive integers diverges, does the set contain arbitrarily long arithmetic progressions? | Erdős conjectured that if $A \subseteq \mathbb{N}$ and $\sum_{a \in A} 1/a = \infty$, then $A$ contains arithmetic progressions of arbitrary length. This strengthens Szemerédi's theorem, which only requires positive density. The conjecture remains open even for progressions of length 3. In 2020, Bloom and Sisask made m... | 5 | open | null | null | 1 | null | 534 | 42 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,263 | NT-056 | Erdős-Turán Conjecture on Additive Bases | If $B$ is an additive basis of order 2, must the representation function tend to infinity? | An additive basis of order 2 is a set $B$ such that every sufficiently large integer can be written as the sum of two elements of $B$. The representation function $r_B(n)$ counts the number of ways to write $n$ as $b_1 + b_2$ with $b_1, b_2 \in B$. Erdős and Turán conjectured in 1941 that if $B$ is an additive basis of... | 4 | open | null | null | 1 | null | 456 | 34 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,265 | NT-058 | Lander-Parkin-Selfridge Conjecture | If the sum of $m$ $k$-th powers equals the sum of $n$ $k$-th powers, must $m + n \geq k$? | This conjecture generalizes Fermat's Last Theorem to sums of powers. It states that if $a_1^k + \cdots + a_m^k = b_1^k + \cdots + b_n^k$ with positive integers and the two sums are different, then $m + n \geq k$. Euler conjectured the stronger statement that at least $k$ $k$-th powers are needed, but this was disproved... | 4 | open | null | null | 1 | null | 489 | 37 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,266 | NT-059 | Lemoine's Conjecture | Can every odd integer greater than 5 be expressed as the sum of an odd prime and an even semiprime? | Proposed by Émile Lemoine in 1894, this conjecture states that every odd number $n > 5$ can be written as $n = p + 2q$ where $p$ and $q$ are primes. An even semiprime is twice a prime. For example, $27 = 13 + 2(7)$, $31 = 19 + 2(6)$ is invalid since 6 isn't prime, but $31 = 5 + 2(13)$ works. This is weaker than Goldbac... | 4 | open | null | null | 1 | null | 445 | 33 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,267 | NT-060 | Recamán's Sequence Completeness | Does every nonnegative integer appear in Recamán's sequence? | Recamán's sequence starts with $a_0 = 0$ and follows the rule: $a_n = a_{n-1} - n$ if that value is positive and not already in the sequence, otherwise $a_n = a_{n-1} + n$. This produces: 0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, ... Named after Colombian mathematician Bernardo Recamán Santos, this sequence has... | 3 | open | null | null | 1 | null | 512 | 40 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 3,
"level": 3,
"name": "L3: Advanced",
"description": "Difficult problems requiring specialized knowledge and sophisticated techniques.",
"color_class": "text-yellow-600 bg-yellow-50 border-yellow-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,268 | NT-061 | Skolem Problem | Can an algorithm determine if a constant-recursive sequence contains a zero? | A constant-recursive sequence satisfies a linear recurrence with constant coefficients, like the Fibonacci sequence. The Skolem problem asks whether there exists an algorithm to determine if such a sequence ever equals zero. This is known to be decidable for sequences of order up to 4, but the general problem remains o... | 4 | open | null | null | 1 | null | 389 | 28 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,269 | NT-062 | Waring's Problem: Exact Values | What are the exact values of $g(k)$ and $G(k)$ for all $k$ in Waring's problem? | Waring's problem concerns representing integers as sums of $k$-th powers. Let $g(k)$ be the minimum number such that every positive integer can be written as a sum of at most $g(k)$ $k$-th powers, allowing any number of terms. Let $G(k)$ be the same but excluding a finite set of exceptions. We know $g(2)=4$ (Lagrange),... | 5 | open | null | null | 1 | null | 567 | 44 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,270 | NT-063 | Density of Ulam Numbers | Do the Ulam numbers have a positive density? | The Ulam numbers start with 1, 2, and each subsequent number is the smallest integer that can be expressed as the sum of two distinct earlier Ulam numbers in exactly one way: 1, 2, 3, 4, 6, 8, 11, 13, 16, 18, ... Named after Stanisław Ulam, these numbers appear to have density around 0.07, but whether the density exist... | 4 | open | null | null | 1 | null | 398 | 29 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,271 | NT-064 | Class Number Problem | Are there infinitely many real quadratic number fields with unique factorization? | A number field has unique factorization if every nonzero element factors uniquely into irreducibles. For real quadratic fields $\mathbb{Q}(\sqrt{d})$ with $d > 0$ square-free, unique factorization is equivalent to having class number 1. Gauss conjectured infinitely many such fields exist. While infinitely many imaginar... | 5 | open | null | null | 1 | null | 478 | 36 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,272 | NT-065 | Hilbert's Twelfth Problem | Can the Kronecker-Weber theorem on abelian extensions of $\mathbb{Q}$ be extended to any base number field? | The Kronecker-Weber theorem states that every abelian extension of the rationals $\mathbb{Q}$ is contained in a cyclotomic field (generated by roots of unity). Hilbert's 12th problem asks for an analogous explicit construction of abelian extensions of arbitrary number fields. For imaginary quadratic fields, complex mul... | 5 | open | null | null | 1 | null | 512 | 40 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,273 | NT-066 | Leopoldt's Conjecture | Does the $p$-adic regulator of an algebraic number field not vanish? | Leopoldt's conjecture, proposed in 1962, states that the $p$-adic regulator of an algebraic number field $K$ is nonzero for every prime $p$. The regulator measures the "size" of the unit group. The conjecture has been verified for abelian extensions of $\mathbb{Q}$ and many other special cases, but remains open in gene... | 5 | open | null | null | 1 | null | 389 | 29 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,274 | NT-067 | Lindelöf Hypothesis | For all $\varepsilon > 0$, does $\zeta(1/2 + it) = o(t^\varepsilon)$ as $t \to \infty$? | The Lindelöf hypothesis concerns the growth rate of the Riemann zeta function $\zeta(s)$ on the critical line $\text{Re}(s) = 1/2$. It states that for any $\varepsilon > 0$, we have $|\zeta(1/2 + it)| = o(t^\varepsilon)$. This is weaker than the Riemann Hypothesis but still unproven. The best known bound is $O(t^{13/84... | 5 | open | null | null | 1 | null | 545 | 43 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,275 | NT-068 | Hilbert-Pólya Conjecture | Do the nontrivial zeros of the Riemann zeta function correspond to eigenvalues of a self-adjoint operator? | The Hilbert-Pólya conjecture proposes a spectral interpretation of the Riemann Hypothesis: the nontrivial zeros of $\zeta(s)$ at $1/2 + i\gamma_n$ correspond to eigenvalues of some self-adjoint operator, with $\gamma_n$ being the eigenvalues. This would imply RH since eigenvalues of self-adjoint operators are real. Con... | 5 | open | null | null | 1 | null | 623 | 51 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,276 | NT-069 | Grand Riemann Hypothesis | Do all automorphic L-functions have their nontrivial zeros on the critical line? | The Grand Riemann Hypothesis extends RH to all automorphic L-functions, a vast class including Dirichlet L-functions, Dedekind zeta functions, and L-functions of modular forms. It asserts that all nontrivial zeros lie on the critical line $\text{Re}(s) = 1/2$. This would have profound consequences for prime distributio... | 5 | open | null | null | 1 | null | 712 | 59 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,277 | NT-070 | Montgomery's Pair Correlation Conjecture | Does the pair correlation function of Riemann zeta zeros match that of random Hermitian matrices? | Montgomery conjectured in 1973 that the statistical distribution of gaps between zeros of the Riemann zeta function matches the pair correlation of eigenvalues from the Gaussian Unitary Ensemble (GUE) of random matrix theory. This remarkable connection between number theory and quantum physics was discovered through nu... | 5 | open | null | null | 1 | null | 567 | 46 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,278 | NT-071 | Dirichlet's Divisor Problem | What is the optimal exponent in the error term for the divisor summatory function? | Let $D(x) = \sum_{n \leq x} d(n)$ where $d(n)$ counts the divisors of $n$. Dirichlet proved $D(x) = x \log x + (2\gamma - 1)x + \Delta(x)$ where $\gamma$ is Euler's constant and $\Delta(x)$ is the error. The problem asks for the infimum $\theta$ such that $\Delta(x) = O(x^\theta)$. It is known that $1/4 \leq \theta < 1... | 5 | open | null | null | 1 | null | 445 | 34 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,279 | GEO-033 | Erdős-Ulam Problem | Is there a dense set of points in the plane with all pairwise distances rational? | Proposed by Paul Erdős and Stanisław Ulam, this problem asks whether there exists a dense subset of the Euclidean plane (dense in the usual topology) such that the distance between any two points is a rational number. While finite and countable dense sets with rational distances are known (like rational points on a cir... | 4 | open | null | null | 6 | null | 478 | 36 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 6,
"name": "geometry",
"display_name": "Geometry",
"description": "Euclidean and non-Euclidean geometry, geometric structures.",
"slug": "geometry",
"order_index": 6,
"created_at": "2026-07-31T15:26:25.671Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,281 | NT-073 | Four Exponentials Conjecture | If $x_1, x_2$ are linearly independent over $\mathbb{Q}$ and $y_1, y_2$ are linearly independent over $\mathbb{Q}$, is at least one of $e^{x_1 y_1}, e^{x_1 y_2}, e^{x_2 y_1}, e^{x_2 y_2}$ transcendental? | This conjecture, a consequence of Schanuel's conjecture, asserts that under the stated conditions, at least one of the four exponentials must be transcendental. The six exponentials theorem (proven) states that if $x_1, x_2, x_3$ are $\mathbb{Q}$-linearly independent and $y_1, y_2$ are $\mathbb{Q}$-linearly independent... | 5 | open | null | null | 1 | null | 445 | 34 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,282 | NT-074 | Irrationality of Euler's Constant | Is the Euler-Mascheroni constant $\gamma$ irrational? | Euler's constant $\gamma = \lim_{n \to \infty} (1 + 1/2 + 1/3 + \cdots + 1/n - \ln n) \approx 0.5772$ appears throughout mathematics but its arithmetic nature remains mysterious. It is not even known whether $\gamma$ is irrational, let alone transcendental. While computational evidence suggests irrationality (verified ... | 5 | open | null | null | 1 | null | 712 | 58 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,283 | NT-075 | Transcendence of Apéry's Constant | Is $\zeta(3) = 1 + 1/8 + 1/27 + 1/64 + \cdots$ transcendental? | Apéry's constant $\zeta(3) \approx 1.202$ is the value of the Riemann zeta function at 3. Roger Apéry proved its irrationality in 1978 using ingenious continued fraction methods, surprising the mathematical community. Whether $\zeta(3)$ is transcendental remains unknown. More generally, the transcendence of $\zeta(2k+1... | 5 | open | null | null | 1 | null | 589 | 47 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,284 | NT-076 | Littlewood Conjecture | For any two real numbers $\alpha, \beta$, does $\liminf_{n \to \infty} n \|n\alpha\| \|n\beta\| = 0$? | Proposed by John Edensor Littlewood around 1930, where $\|x\|$ denotes the distance from $x$ to the nearest integer. The conjecture asserts a simultaneous approximation property: for any pair of real numbers, infinitely many integers $n$ exist such that both $n\alpha$ and $n\beta$ are simultaneously close to integers, ... | 5 | open | null | null | 1 | null | 456 | 35 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,285 | NT-077 | Integer Factorization in Polynomial Time | Can integer factorization be solved in polynomial time on a classical computer? | The integer factorization problem asks: given a composite number $n$, find its prime factors. The best known classical algorithm (general number field sieve) runs in sub-exponential time $\exp(O((\ln n)^{1/3}(\ln \ln n)^{2/3}))$. Whether a polynomial-time classical algorithm exists is unknown and has profound implicati... | 4 | open | null | null | 1 | null | 734 | 61 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 4,
"level": 4,
"name": "L4: Expert",
"description": "Very challenging problems at the frontier of mathematical research.",
"color_class": "text-red-600 bg-red-50 border-red-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,286 | NT-078 | Beal's Conjecture | For $A^x + B^y = C^z$ with $x, y, z > 2$, must $A$, $B$, and $C$ share a common prime factor? | Proposed by banker and amateur mathematician Andrew Beal in 1993, this conjecture generalizes Fermat's Last Theorem. It asserts that if $A^x + B^y = C^z$ where $A, B, C, x, y, z$ are positive integers with $x, y, z > 2$, then $A$, $B$, and $C$ must have a common prime factor. For example, $3^3 + 6^3 = 3^5$ satisfies th... | 5 | open | null | null | 1 | null | 712 | 59 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
1,289 | NT-081 | Fermat-Catalan Conjecture | Are there finitely many solutions to $a^m + b^n = c^k$ with coprime $a,b,c$ and $1/m + 1/n + 1/k < 1$? | This conjecture generalizes both Fermat's Last Theorem and the Catalan-Mersenne conjecture. It asserts that the equation $a^m + b^n = c^k$ has only finitely many solutions in coprime positive integers $a,b,c$ and integers $m,n,k \geq 2$ satisfying $1/m + 1/n + 1/k < 1$. Ten solutions are known, including $1^m + 2^3 = 3... | 5 | open | null | null | 1 | null | 634 | 52 | 2024-01-01T00:00:00 | 2024-01-01T00:00:00 | true | {
"id": 1,
"name": "number_theory",
"display_name": "Number Theory",
"description": "Properties of integers, prime numbers, Diophantine equations.",
"slug": "number-theory",
"order_index": 1,
"created_at": "2026-07-31T15:26:25.670Z"
} | {
"id": 5,
"level": 5,
"name": "L5: Millennium Prize",
"description": "Millennium Prize Problems and problems of equivalent difficulty.",
"color_class": "text-purple-600 bg-purple-50 border-purple-200"
} | null | null | null | null | null | null | null | null | null | null | null | null | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.