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.
All topics

617 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openErdős Problems · Number theory

Erdős Problem 218: Ge

The set of indices nn for which a prime gap is preceeded by a larger or equal prime gap has a natural density of 12\frac 1 2.

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

Erdős Problem 218: Infinite Equal Prime Gap

There are infintely many indices nn such that the prime gap at nn is equal to the prime gap at n+1n+1. This is equivalent to the existence of infinitely many arithmetic progressions of length 33, see erdos_141.variants.infinite_three.

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

Erdős Problem 233

A conjecture by Heath-Brown: The sum of squares of the first NN gaps between consecutive primes behaves like N(logN)2N * (log N)^2.

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

Erdős Problem 234

Is it true that for all c ≥ 0, the density f c of integers for which (p (n + 1) - p n) / log n < c exists and is a continuous function of c?

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

Erdős Problem 238

Let c₁, c₂ > 0. Is it true that for any sufficiently large x, there exists more than c₁ * log x many consecutive primes ≤ x such that the difference between any two is > c₂?

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

Erdős Problem 242

For every n>2n>2 there exist distinct integers 1x<y<z1 ≤ x < y < z such that 4n=1x+1y+1z\frac 4 n = \frac 1 x + \frac 1 y + \frac 1 z.

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

Erdős Problem 242: Schinzel Generalization

Schinzel conjectured (see [Si56]) the generalisation that, for any fixed aa, if nn is sufficiently large in terms of aa then there exist distinct integers 1x<y<z1\leq x < y < z such that an=1x+1y+1z.\frac{a}{n} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z}.

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

Erdős Problem 244

Let C>1C > 1. Does the set of integers of the form p+Ckp + \lfloor C^k \rfloor, for some prime pp and k0k\geq 0, have density >0>0?

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

Erdős Problem 247

Let n1<n2<n_1 < n_2 < \cdots be a sequence of integers such that

lim supnkk=. \limsup \frac{n_k}{k} = \infty.

Is

k=112nk \sum_{k=1}^{\infty} \frac{1}{2^{n_k}}

transcendental?

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

Erdős Problem 249

Is nϕ(n)2n\sum_{n} \frac{\phi(n)}{2^n} irrational? Here ϕ\phi is the Euler totient function.

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

Erdős Problem 25

Let n1<n2<n_1 < n_2 < \dots be an arbitrary sequence of integers, each with an associated residue class ai(modni)a_i \pmod{n_i}. Let AA be the set of integers nn such that for every ii either n<nin < n_i or n≢ai(modni)n \not\equiv a_i \pmod{n_i}. Must the logarithmic density of AA exist?

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

Erdős Problem 251

Is n=1pn2n\sum_{n=1}^\infty \frac{p_n}{2^n} irrational? Here pnp_n is the nn-th prime (p1=2,p2=3,p_1=2, p_2=3, \dots).

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

Erdős Problem 252

Erdős Problem 252: irrationality of the sum for a given kk.

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

Erdős Problem 252: K Ge Five

For a fixed k ≥ 5, is ∑ σ k n / n! irrational?.

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

Erdős Problem 254

Let ANA\subseteq \mathbb{N} be such that A[1,2x]A[1,x] as x\lvert A\cap [1,2x]\rvert -\lvert A\cap [1,x]\rvert \to \infty\textrm{ as }x\to \infty and nA{θn}=\sum_{n\in A} \{ \theta n\}=\infty for every θ(0,1)\theta\in (0,1), where {x}\{x\} is the distance of xx from the nearest integer. Then every sufficiently large integer is the sum of distinct elements of AA.

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

Erdős Problem 257

Let ANA\subseteq\mathbb{N} be an infinite set. Is

nA12n1\sum_{n\in A} \frac{1}{2^n - 1}

irrational?

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

Erdős Problem 260

Let a1<a2<a_1 < a_2 < \cdots be an increasing sequence such that ann\frac{a_n}{n} \to \infty. Is the sum nan2an\sum_{n}^{\infty} \frac{a_n}{2^{a_n}} irrational?

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

Erdős Problem 263: I

Is an=22na_n = 2^{2^n} an irrationality sequence in the above sense?

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

Erdős Problem 264: Ii

Is n!n! an example of an irrationality sequence?

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

Erdős Problem 267

Let F1=F2=1F_1=F_2=1 and Fn+1=Fn+Fn1F_{n+1} = F_n + F_{n-1} be the Fibonacci sequence. Let n1<n2<n_1 < n_2 < \dots be an infinite sequence with nk+1nkc>1\frac{n_{k+1}}{n_k} \ge c > 1. Must k1Fnk\sum_k \frac 1 {F_{n_k}} be irrational?

Source checked Jul 26, 20261 pinned Lean statementInspect problem