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 389

Is it true that for every n1n \geq 1 there is a kk such that

n(n+1)(n+k1)(n+k)(n+2k1)? n(n + 1) \cdots (n + k - 1) \mid (n + k) \cdots (n + 2k - 1)?
Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Number theory

Erdős Problem 39

Is there an infinite Sidon set ANA\subset \mathbb{N} such that A{1,N}ϵN1/2ϵ\lvert A\cap \{1\ldots,N\}\rvert \gg_\epsilon N^{1/2-\epsilon} for all ε>0\varepsilon > 0?

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

Erdős Problem 390

Does there exists a constant c such that f n - 2 * n ~ c * (n / log n)?

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

Erdős Problem 394: I

Is it true that nxt2(n)x2(logx)c\sum_{n\leq x}t_2(n)\ll \frac{x^2}{(\log x)^c} for some c>0c>0?

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

Erdős Problem 394: Ii

Is it true that, for k2k\geq 2, nxtk+1(n)=o(nxtk(n))?\sum_{n\leq x}t_{k+1}(n) =o\left(\sum_{n\leq x}t_k(n)\right)?

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

Erdős Problem 394: Hall Conjecture

Erdős and Hall conjecture that the sum is o(x2/(logx)c)o(x^2/(\log x)^c) for any c<log2c<\log 2.

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

Erdős Problem 394: Factorial Gap Conjecture

They ask about the behaviour of tn3(n!)t_{n-3}(n!) and also ask whether, for infinitely many nn, tk(n!)<tk1(n!)1t_k(n!)< t_{k-1}(n!)-1 for all 1k<n1\leq k < n.

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

Erdős Problem 396

Is it true that for every kk there exists nn such that 0ik(ni)(2nn)?\prod_{0\leq i\leq k}(n-i) \mid \binom{2n}{n}?

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

Ben Green's Open Problem 50

Let AF2nA \subset \mathbb{F}_2^n be a set of density α>0\alpha > 0. Does 10A10A contain a coset of some subspace of dimension at least nO(log(1/α))n - O(\log(1/\alpha))?

More precisely: does there exist an absolute constant C>0C > 0 such that for all n1n \geq 1 and all nonempty AF2nA \subseteq \mathbb{F}_2^n with density α>0\alpha > 0, the sumset 10A10A contains a coset of some subspace of dimension at least nClog2(1/α)n - C \log_2(1/\alpha)?

The sumset 10A10A is defined as {a1+a2++a10:aiA}\{a_1 + a_2 + \cdots + a_{10} : a_i \in A\}, using the pointwise scalar multiplication notation 10 • A where denotes the iterated addition of a set.

Note: We model F2n\mathbb{F}_2^n as Fin n → ZMod 2, which is an nn-dimensional vector space over F2\mathbb{F}_2.

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

Erdős Problem 398

Brocard's Problem* Does n!+1=m2n! + 1 = m^2 have integer solutions other than n=4,5,7n = 4, 5, 7?

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

Green's Open Problem 51

Suppose that AF2nA \subset \mathbb{F}_2^n is a set of density α\alpha. What is the largest size of coset guaranteed to be contained in 2A2A?

We phrase this by asking for the exact function F(α,n)F(\alpha, n) giving the maximum dimension of a guaranteed coset.

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

Erdős Problem 40

For what functions g(N)g(N) → \infty is it true that A{1,,N}N1/2g(N)\lvert A\cap \{1,\ldots,N\}\rvert \gg \frac{N^{1/2}}{g(N)} implies lim sup1A1A(n)=\limsup 1_A\ast 1_A(n)=\infty?

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

Green's Open Problem 51: One Half

Suppose that AF2nA \subset \mathbb{F}_2^n has density α>1/2C/n\alpha > 1/2 - C/\sqrt{n}. Does A+AA + A contain a subspace of co-dimension OC(1)O_C(1)? [Sa11, Question 5.1]

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

Erdős Problem 400: I

Can one show that nxgk(n)ckxlogx\sum_{n\leq x}g_k(n) \sim c_k x\log x for some constant ckc_k?

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

Green's Open Problem 52

Suppose that AF2nA \subset \mathbb{F}_2^n is a set with an additive complement of size KK. Does 2A2A contain a coset of codimension OK(1)O_K(1)?

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

Erdős Problem 400: Ii

Is it true that there is a constant ckc_k such that for almost all n<xn < x we have gk(n)=cklogx+o(logx)g_k(n)=c_k\log x+o(\log x)?

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

Green's Open Problem 52

Could 2A2A even contain a coset of codimension O(logK)O(\log K)?

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

Erdős Problem 406

Is it true that there are only finitely many powers of 22 which have only the digits 00 and 11 when written in base 33?

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

Ben Green's Open Problem 58

Suppose A,B{1,,N}A, B ⊆ \{1, \dots, N\} both have size at least N0.49N^{0.49}. Must the sumset A+BA + B contain a composite number?

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

Erdős Problem 406: One Two

If we only allow the digits 11 and 22 then 2152^{15} seems to be the largest such power of 22.

Source checked Jul 26, 20261 pinned Lean statementInspect problem