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$ .

Sources

Browse retained paths and inspect the exact material available for this Problem.

1 retained statement2415f78e850a

FormalConjectures/ErdosProblems/

248.lean

Retained formal statement1 of 1

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$ .

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