Open-problem statements, with their sources attached.

Let $h(n)$ be maximal such that if $A\subseteq \mathbb{Z}$ with $\lvert A\rvert=n$ then there is $B\subseteq A$ with $\lvert B\rvert \geq h(n)$ such that if $a_1+\cdots+a_r=b_1+\cdots+b_s$ with $a_i,b_i\in B$ then $r=s$.

Is $h(n) = \Theta((n\log(n)))^{1/3})$?

Let $P$ be a finite set of primes with $|P| \ge 2$ and let $\{a_1 < a_2 < \dots\}$ be the set of positive integers whose prime factors are all in $P$. Is the sum $\sum_{n=1}^\infty \frac{1}{[a_1,\ldots,a_n]}$ irrational?

By the solved variant erdos_789.variants.cube_root_linearithmic_isBigO, in order to prove erdos_789.variants.cube_root_linarithmic it suffices to show $h(n) = O((n\log(n))^{1/3})$.

Is there an infinite Lucas sequence $a_0, a_1, \ldots$ where $a_{n+2} = a_{n+1} + a_n$ for $n \ge 0$ such that all $a_k$ are composite, and yet no integer has a common factor with every term of the sequence?

Is it true that $\frac{R(n+1)}{R(n)}\geq 1+c$ for some constant $c>0$, for all large $n$?

Let $k\geq 3$. Is there a choice of congruence classes $a_p\pmod{p}$ for every prime $p$ such that all sufficiently large integers can be written as $a_p+tp$ for some prime $p$ and integer $t\geq k$?

Is it true that $R(n+1)-R(n) \gg n^2$?

If $A ⊆ \mathbb{N}$ is such that $A + A$ contains all but finitely many integers then $\limsup 1_A ∗ 1_A(n) = \infty$.

Let $k \geq 3$. Define $g_k(n)$ to be the minimal $N$ such that $\{1, ..., N\}$ contains some $A$ of size $|A| = n$ such that

contains no non-trivial $k$-term arithmetic progression. Estimate $g_k(n)$. In particular, is it true that

Let $k\geq2$. Is it true that, for any distinct integers $1 < n_1 < \cdots < n_k$ such that $\sum_{i=1}^k \frac{1}{n_i} = 1$, we must have $\max(n_{i+1} - n_i) \geq 3$?

$F(n) / \log n \to \infty as n \to \infty$

For all large $N$, there exists a prime $p \in [N, 2N]$ such that $\frac{p+1}{2}$ is also prime.

This is an open conjecture. If true, it would imply erdos_287 for all but at most finitely many exceptions (see erdos_287.variants.prime_conjecture_implies).

Does there exist a $k>2$ such that the $k$-sized subsets of {1,...,2k} can be coloured with $k+1$ colours such that for every $A\subset \{1,\ldots,2k\}$ with $\lvert A\rvert=k+1$ all $k+1$ colours appear among the $k$-sized subsets of $A$?

Is it true that there are only finitely many pairs of intervals $I_1$, $I_2$ such that

Alternative statement of Erdős Problem 835 using the chromatic number of the Johnson graph. This is equivalent to asking whether there exists $k > 2$ such that the chromatic number of the Johnson graph $J(2k, k)$ is $k+1$.

This is still open even if $|I_2| = 1$.

Is the chromatic number of J(2 * k, k) always at least k + 2?

It is perhaps true with two intervals replaced by any $k$ intervals.

Is it true that, for all large $n$, $f(n + 1) \ge f(n)$?

Is it true for any $k > 2$ that only finitely many $k$ intervals satisfy this condition?