Erdős problem 248 · problems.science

Are there infinitely many $n$ such that $\omega(n + k) \ll k$ for all $k \geq 1$ ? Here $\omega(n)$ is the number of distinct prime divisors of $n$ .

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/248.lean

Formal Conjectures

FormalConjectures/ErdosProblems/248.leanErdos248.erdos_2481 lineExact file

1∃ C > 0, {n | ∀ k ≥ 1, ↑(ArithmeticFunction.cardDistinctFactors (n + k)) ≤ C * ↑k}.Infinite

SolvedStatement only, no proof