Questions, not proof records

Open-problem statements, with their sources attached.

Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.

“Open” is a dated source assertion. In these pinned sources, sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.
1 topic

741 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openErdős Problems · Number theory

Erdős Problem 979

Let k2k ≥ 2, and let fk(n)f_k(n) count the number of solutions to n=p1k++pkkn = p_1^k + \dots + p_k^k, where the pip_i are prime numbers. Is it true that lim supfk(n)=\limsup f_k(n) = \infty?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Number theory

Erdős Problem 985

Is it true that, for every prime pp, there is a prime qpq \leq p which is a primitive root modulo pp?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Ben Green's Open Problem 2

Let AZA \subset \mathbf{Z} be a set of nn integers. Is there a set SAS \subset A of size (logn)100(\log n)^{100} such that the restricted sumsetS+^SS \hat{+} S is disjoint from AA?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Ben Green's Open Problem 3

Suppose that A[0,1]A \subset [0,1] is open and has measure greater than 13\frac{1}{3}. Is there a solution to xy=zxy = z with x,y,zAx, y, z \in A?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Green's Open Problem 44

Sieve [N][N] by removing half the residue classes mod pip_i, for primes 2p1<p2<<p1000<N9/102 \leqslant p_1 < p_2 < \dots < p_{1000} < N^{9/10}. Does the remaining set have size at most 110N\frac{1}{10} N?

We interpret "half the residue classes" as pi/2\lfloor p_i / 2 \rfloor.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Ben Green's Open Problem 46: Improve Lower

We conjecture that the best-known lower bound can be improved.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Ben Green's Open Problem 46: Improve Upper

We conjecture that the best-known upper bound can be improved.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Green's Open Problem 47

Suppose that a large sieve process leaves a set of quadratic size. Is that set quadratic?

The following very particular instance is probably the simplest [Gr24]: Suppose that ANA \subset \mathbb{N} is a set with the property that A(modp)12(p+1)|A \pmod p| \leqslant \frac{1}{2}(p + 1) for all sufficiently large pp. Is it true that either A[X]X1/2/log100X|A \cap [X]| \ll X^{1/2} / \log^{100} X, or AA is contained in the image of Z\mathbb{Z} under a quadratic map ϕ:QQ\phi : \mathbb{Q} \to \mathbb{Q}?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Ben Green's Open Problem 60

Is there an absolute constant c>0c > 0 such that, whenever ANA ⊆ \mathbb{N} is a set of squares with A2|A| ≥ 2, the sumset A+AA + A satisfies A+AA1+c|A + A| ≥ |A|^{1 + c}?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Ben Green's Open Problem 61

Suppose that A+AA + A contains the first nn squares. Is An1o(1)|A| \geq n^{1 - o(1)}?

It is known that necessarily An2/3o(1)|A| \geq n^{2/3 - o(1)}, whilst in the other direction there do exist such AA with ACn/logCn|A| \ll_C n / \log^C n for any CC.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Ben Green's Open Problem 62

Let pp be a large prime, and let AA be the set of all primes less than pp. Is every x{1,,p1}x \in \{1, \ldots, p-1\} congruent to some product a1a2a_1 a_2 where a1,a2Aa_1, a_2 \in A?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Number theory

Ben Green's Open Problem 66

Is there always a sum of two squares between X110X1/4X - \frac{1}{10}X^{1/4} and XX? We formalize this as an eventual statement for sufficiently large real XX.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openLitt's Problems · Number theory

Lam--Litt conjecture: Omega Integrality Implies Algebraicity

  1. implies 2): if the coefficients of ff satisfy the ω\omega-integrality condition for some superlinear ω\omega, then there exists NN such that for all nn, the nn-th coefficient of ff is in Z[1/N]\mathbb{Z}[1/N].
Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openLitt's Problems · Number theory

Lam--Litt conjecture: Integrality Implies Algebraicity

  1. implies 1): if the coefficients of ff are in Z[1/N]\mathbb{Z}[1/N] for some NN, then ff is algebraic over Q[z]\mathbb{Q}[z]. Also the version of conjecture of Litt's problem 1 on his website.
Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Number theory

17560

If 2x2^x and 3x3^x are integers, then xx must be an integer.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Number theory

Mathoverflow 75792

Is 2n the complexity of 2^n for 0 < n?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMillennium Problems · Number theory

Riemann Hypothesis and its generalizations

The Riemann Hypothesis: all non-trivial zeros of the Riemann zeta function have real part 12\frac{1}{2}. That is, if ζ(s)=0\zeta(s) = 0, s1s \neq 1, and ss is not a trivial zero 2(n+1)-2(n+1) for some nNn \in \mathbb{N}, then Re(s)=12\operatorname{Re}(s) = \frac{1}{2}.

This is the official Millennium Prize Problem as posed by the Clay Mathematics Institute.

This uses the RiemannHypothesis type from Mathlib, which is defined as ∀ (s : ℂ), riemannZeta s = 0 → (¬∃ n : ℕ, s = -2 * (n + 1)) → s ≠ 1 → s.re = 1 / 2.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMillennium Problems · Number theory

Riemann Hypothesis and its generalizations

The Generalized Riemann Hypothesis asserts that all the non-trivial zeros of the Dirichlet LL-function L(χ,s)L(\chi, s) of a primitive Dirichlet character χ\chi have real part 12\frac{1}{2}.

Source checked Jul 26, 20261 pinned Lean statementInspect problem