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 8 of 21

A Hard Analysis · Formal Conjectures (Lean)

Bloch and Landau constants

Ahlfors and Grunsky also conjectured in [AG37] that this upper bound is the precise value of the Bloch constant.

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

Borsuk's conjecture

Borsuk's conjecture, open range: every bounded subset of ℝ^n with at least two points can be partitioned into n + 1 sets of strictly smaller diameter, for 4 ≤ n ≤ 62. The conjecture is known to be true for n ≤ 3 and false for n ≥ 63.

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

Brocard's Conjecture

Brocard's Conjecture For every n ≥ 2, between the squares of the n-th and (n+1)-th primes, there are at least four prime numbers.

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

Büchi's problem

Büchi's problem There exists a positive integer M such that, for all integers x and a, if (x+n)^2 + a is a square for M consecutive values of n, then a = 0.

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

Bunyakovsky conjecture

Bunyakovsky conjecture If a polynomial f over integers satisfies both Schinzel and Bunyakovsky conditions, there exist infinitely many natural numbers m such that f(m) is prime.

No claims yet Be the first →
A Hard Logic & formalisation · Formal Conjectures (Lean)

Busy Beaver

Determine the value of the Busy Beaver function at n = 6.

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

Can a prime p satisfy 2^p-1 ≡ 1 pmodp^2 and 3^p-1 ≡ 1 pmodp^2?

Can a prime p satisfy 2^p-1 ≡ 1 pmodp^2 and 3^p-1 ≡ 1 pmodp^2 simultaneously? That is, does there exist a prime p that is both a Wieferich prime and a Mirimanoff prime? Wikipedia's list of unsolved problems poses this question, citing J. B. Dobson, On Lerch's formula for the Fermat quotient.

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

Casas-Alvero Conjecture

The Casas-Alvero conjecture states that in characteristic zero, if a monic polynomial P has the Casas-Alvero property, then P = (X - α)ᵈ for some α.

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

Central trinomial coefficients

An integer n > 3 is prime if and only if a(n) ≡ 1 pmodn^2. We have verified this for n up to 8 · 10^5, and proved that a(p) ≡ 1 pmodp^2 for any prime p > 3 (cf. A277640). - Zhi-Wei Sun, Nov 30 2016

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

Chvátal's Conjecture

If F is a decreasing family of sets of some finite type α, then there is some element x of α such that the family consisting of all members of F containing x is an intersecting subfamily of F with maximal cardinality.

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

Coefficients of Π_k>0 (1 - x^k/k!)

The coefficients c(n) of A(x)^2 = (Σ_n ≥ 0 a(n) x^n)^2 differ in sign from c(n-1) if and only if n is a triangular number. - _Peter Bala_, Mar 17 2022

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

Congruent Number

Tunnell's theorem (sufficient condition assuming BSD) for odd squarefree congruent numbers.

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

Conjecture 1.40

Is a group a nilgroup if it is the product of two normal nilsubgroups? Since H and K are normal, the product HK coincides with the join H sqcup K, so "G is the product of H and K" is stated as H sqcup K = G.

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

Conjecture 19.25

Let G and H be finite groups of the same order with Σ_g ∈ G φ(|g|) = Σ_h ∈ H φ(|h|), where φ is the Euler totient function. Suppose that G is simple. Is H necessarily simple?

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

Conjecture 20.76

Let G be a finite p-group and assume that all abelian normal subgroups of G have order at most p^k. Is it true that every abelian subgroup of G has order at most p^2k?

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

Conjecture 8.8

Does there exist a non-cyclic finitely presented group G which contains an element a such that each element of G is conjugate to some power of a? Here a power of a means a^n for some n ∈ ℤ.

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

Conjectures about Mersenne primes

For any odd natural number p if two of the following conditions hold, then all three must hold: 1. 2^p-1 is prime 2. (2^p+1)/3 is prime 3. Exists a number k such that p = 2^k pm 1 or p = 4^k pm 3

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

Conjectures about Weakly First Countable spaces

Problem 2 in [Ar2013]: Give an example in ZFC of a weakly first- countable compact Hausdorff space X such that 𝔠 < |X|. Note: [Ar2013] uses a blanket convention that all spaces are Tychonoff and "compact" means compact Hausdorff.

No claims yet Be the first →

Browse by field

Collections and topics