Skip to content
1047 problems

Open problems

Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.

Not sure where to start? Get a task picked for you →

1047 shown· page 17 of 21

A Hard Number theory · Formal Conjectures (Lean)

Fibonacci Primes

There are infinitely many Fibonacci primes, i.e., Fibonacci numbers that are prime It is also a barrier to defining a benchmark from this paper: https://arxiv.org/html/2505.13938v1 (see Figure 8).

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

Firoozbakht's conjecture

Firoozbakht's conjecture The inequality sqrt[n+1]p_n+1 < sqrt[n]p_n holds for all prime numbers p_n.

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

First Hardy–Littlewood conjecture

Let P = (m_1, …, m_k) be a tuple of distinct positive even integers. Let π_P(n) denote the number of primes p≤ n such that (p, p + m_1, …, p + m_k) forms an admissible prime constellation.

No claims yet Be the first →
A Hard Algebra · Formal Conjectures (Lean)

Gap conjecture

If a finitely generated group has superpolynomial growth, then with respect to any finite generating set its growth function is at least e^sqrt n in Grigorchuk's preorder on growth functions, where the comparison is witnessed by linearly rescaling the radius.

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

Gauss circle problem

It is conjectured that the correct bound is |E(r)| = O(r^1/2 + o(1)) [Ha59] Hardy, G. H. (1959). _Ramanujan: Twelve Lectures on Subjects Suggested by His Life and Work_(3rd ed.). New York: Chelsea Publishing Company. p. 67 See also https://arxiv.org/abs/2305.03549

No claims yet Be the first →
A Hard Algebra · Formal Conjectures (Lean)

Generic and maximal rank of 3-tensors

Friedland's conjecture. In the critical range m_3 ≤ (m_1 - 1)(m_2 - 1), and away from the formats (3, 2p+1, 2p+1), the generic rank of a tensor of format (m_1, m_2, m_3) is the value ⌈ m_1m_2m_3 / (m_1 + m_2 + m_3 - 2) ⌉ predicted by a dimension count [Fri12, Conjecture 5.1].

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

Gilbreath's conjecture

Gilbreath's conjecture Gilbreath's conjecture states that every term in the sequence d^k_0 for k > 0 is equal to 1.

No claims yet Be the first →
A Hard Algebra · Formal Conjectures (Lean)

Gottschalk's surjunctivity conjecture

Gottschalk's surjunctivity conjecture (1973): every group is surjunctive. That is, for every group G and every finite alphabet A, every injective cellular automaton on A^G is surjective.

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 12

Let G be an abelian group of size N, and suppose that A ⊂ G has density α. Are there at least α^15 N^10 tuples (x_1, …, x_5, y_1, …, y_5) ∈ G^10 such that x_i + y_j ∈ A whenever j ∈ i, i+1, i+2? Note: We interpret indices modulo 5.

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 15

Does there exist a Lipschitz function f : ℕ → ℤ whose graph Γ = (n, f(n)) : n ∈ ℕ ⊆ ℤ^2 is free of 3-term progressions?

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 22

If 1, …, N is r-coloured then, for N geqslant N_0(r), there are integers x, y geqslant 3 such that x + y, xy have the same colour. Find reasonable bounds for N_0(r). The goal is to improve upon the Green-Sawhney bound.

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 24

If A is a set of n integers, what is the maximum number of affine translates of the set lbrace 0,1,3 rbrace that A can contain? Conjectured in [Aa19] p.579: (1/3 + o(1)) n^2.

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 25

For which values of k is the following true: whenever we partition [N] = A_1 ∪ … ∪ A_k, |bigcup^k_i=1 (A_i hat+ A_i)| ≥ 1/10 N?

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 27

What is the size of the smallest set A ⊂ ℤ / pℤ (with at least two elements) for which no element in the sumset A + A has a unique representation?

No claims yet Be the first →
A Hard Probability · Formal Conjectures (Lean)

Green's Open Problem 28

Suppose that X, Y are two finitely-supported independent random variables taking integer values, and such that X + Y is uniformly distributed on its range. Are X and Y themselves uniformly distributed on their ranges?

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 32

Let p be a prime and let A ⊂ ℤ/pℤ be a set of size ⌊ √(p) ⌋. Is there a dilate of A containing a gap of length 100√(p)?

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 36

Do the following exist, for arbitrarily large n? An abelian group H with |H| = n^2+o(1), together with subsets A_1, ..., A_n, B_1, ..., B_n satisfying |A_i||B_i| ≥ n^2-o(1) and |A_i + B_i| = |A_i||B_i|, such that the sets A_i + B_i are disjoint from the sets A_j + B_k (j ≠ k)?

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 38

Can we improve the best upper bound? The base c must be positive, since =O compares norms.

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 39

If A ⊂ ℤ/pℤ is random, |A| = √(p), can we almost surely cover ℤ/pℤ with 100√(p) translates of A? [Gr24]

No claims yet Be the first →
A Hard Geometry · Formal Conjectures (Lean)

Green's Open Problem 42

Can the Cohn-Elkies scheme be used to prove the optimal bound for circle-packings in 2 dimensions?

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

Green's Open Problem 44

Sieve [N] by removing half the residue classes mod p_i, for primes 2 leqslant p_1 < p_2 < … < p_1000 < N^9/10. Does the remaining set have size at most 1/10 N? We interpret "half the residue classes" as ⌊ p_i / 2 ⌋.

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 51

Suppose that A ⊂ 𝔽_2^n is a set of density α. What is the largest size of coset guaranteed to be contained in 2A? We phrase this by asking for the exact function F(α, n) giving the maximum dimension of a guaranteed coset.

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 52

Suppose that A ⊂ 𝔽_2^n is a set with an additive complement of size K. Does 2A contain a coset of codimension O_K(1)?

No claims yet Be the first →
A Hard Combinatorics · Formal Conjectures (Lean)

Green's Open Problem 53

Suppose that 𝔽_2^n is partitioned in to sets A_1, ..., A_K. Does 2A_i contain a coset of codimension O_K(1) for some i?

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

Green's Open Problem 64

Do there exist infinitely many primes p for which p - 2 has an odd number of prime factors, counted with multiplicity (i.e. Ω(p - 2) is odd)?

No claims yet Be the first →
A Hard Analysis · Formal Conjectures (Lean)

Green's Open Problem 85

Suppose that A is an open subset of [0, 1]^2 with measure α. Are there four points in A determining an axis-parallel rectangle with area gt c α^2?

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

Grimm's conjecture

Grimm's Conjecture If n, n+1, …, n+k-1 are all composite numbers, then there are k distinct primes p_i such that p_i divides n + i for all 0 ≤ i ≤ k-1.

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

Hypothesis H

Schinzel conjecture (H hypothesis) If a finite set of polynomials f_i satisfies both Schinzel and Bunyakovsky conditions, there exist infinitely many natural numbers n such that f_i(n) are primes for all i.

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

Infinitude of Wall–Sun–Sun primes

A prime p is a Wall–Sun–Sun prime if and only if L_p ≡ 1 pmodp^2, where L_p is the p-th Lucas number. It is conjectured that there is at least one Wall–Sun–Sun prime.

No claims yet Be the first →
A Hard Algebra · Formal Conjectures (Lean)

Jacobson Conjecture

The Jacobson conjecture (in its modern form): In a (noncommutative) ring which is left and right Noetherian, the intersection of the powers of the Jacobson ideal is trivial

No claims yet Be the first →
A Hard Number theory · Formal Conjectures (Lean)

Juggler conjecture

Now form a sequence beginning with any positive integer, where each subsequent term is obtained by applying the operation defined above to the previous term. The Juggler Conjecture states that for any positive integer n, there exists a natural number m such that the m-th term of the sequence is 1.

No claims yet Be the first →

Browse by field

Collections and topics