Open-problem statements, with their sources attached.

Does $f$ become stationary at some point?

Let $a_1 = 2$ and $a_2 = 3$ and continue the sequence by appending to $a_1, \ldots, a_n$ all possible values of $a_i a_j - 1$ with $i \neq j$. Is it true that the set of integers which eventually appear has positive density?

Is there a set $A\subseteq \mathbb{N}$ such that, for infinitely many $n$, all of $n-a$ are prime for all $a\in A$ with $0 < a < n$ and $\liminf\frac{\lvert A\cap [1,x]\rvert}{\pi(x)}>0?$

Is it true that, for any $c>1/2$, if $p$ is a sufficiently large prime then, for any $n\geq 0$, there exist $a,b\in(n,n+p^c)$ such that $ab\equiv 1\pmod{p}$?

This is discussed in this MathOverflow question [MathOverflow].

Is it true that limsup (fun n => (f n - 2 * n.nth Prime : ℕ∞)) atTop = ⊤?

Let q : ℕ → ℕ be a strictly increasing sequence of primes such that q (n + 2) - q (n + 1) ≥ q (n + 1) - q n. Must lim q n / (n ^ 2) = ∞?

Is it true that $m_n<p_n$ for almost all $n$?

Does $p_n/m_n \to \infty$ for almost all $n$?

Are there infinitely many primes $p$ such that $p-1$ is the only $n$ for which $m_n=p$?

More generally, let $q(n, k)$ denote the least prime which does not divide $\prod_{1 \le i \le k}(n + i)$. This problem asks whether $q(n, \log n) \ge (2 + \epsilon) \log n$ infinitely often.

Taking $n$ to be the product of primes between $\log n$ and $(2 + o(1)) \log n$ gives an example where

Can one prove that $q(n, \log n) < (1 - \epsilon) (\log n)^2$ for all large $n$ and some $\epsilon > 0$?

Let $\operatorname{lcm}(1, \dots, n)$ denote the least common multiple of $\{1, \dots, n\}$. Let $p_k$ be the $k$-th prime. Is it true that for all $k \geq 1$, $\operatorname{lcm}(1, \dots, p_{k+1}-1) < p_k \cdot \operatorname{lcm}(1, \dots, p_k)$?

Is there a function $f$ with $f(n)\to\infty$ as $n\to\infty$ such that, for all large $n$, there is a composite number $m$ such that

Here $p(m)$ is the least prime factor of $m$.

Let $A$ be the set of all $n$ such that $n = d_1 + ⋯ + d_k$ with $d_i$ distinct proper divisors of $n$, but this is not true for any $m ∣ n$ with $m < n$. Does:

converge?

Are there any odd weird numbers?

Are there infinitely many primitive weird numbers?

Is it true that, for all $k\neq 1$, there are infinitely many $n$ such that $2^n\equiv k\pmod{n}$?

For each $n \in \mathbb{N}$ choose some $X_n \subseteq \mathbb{Z}/n\mathbb{Z}$. Let $B = \{m \in \mathbb{N} : \forall n, m \not\equiv x \pmod{n} \text{ for all } x \in X_n\}$. Must $B$ have a logarithmic density?

Let $A\subseteq \mathbb{N}$ be a set such that $\lvert A\cap [1,x]\rvert=o(x^{1/2})$. Let $B=\{ n\geq 1 : a\nmid n\textrm{ for all }a\in A\}$. If $B=\{b_1 < b_2 < \cdots\}$ then is it true that $\lim_{x \to \infty} \frac{1}{x}\sum_{b_i < x}(b_{i+1}-b_i)^2$ exists (and is finite)?

For example, when $A=\{p^2: p\textrm{ prime}\}$ then $B$ is the set of squarefree numbers, and the existence of this limit was proved by Erdős.

See also [208].

Let $\alpha,\beta \in \mathbb{R}$. Is it true that$\liminf_{n\to \infty} n \| n\alpha \| \| n\beta\| =0$? This is also known as the Littlewood conjecture.