Erdős problem 680 · problems.science

Is it true that, for all sufficiently large $n$ , there exists some $k$ such that $p(n+k)>k^2+1,$ where $p(m)$ denotes the least prime factor of $m$ ?

Sources

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

2 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

680.lean

Retained formal statement1 of 2

Is it true that, for all sufficiently large $n$ , there exists some $k$ such that $p(n+k)>k^2+1,$ where $p(m)$ denotes the least prime factor of $m$ ?

FormalConjectures/ErdosProblems/680.leanErdos680.erdos_680.parts.i1 lineExact file

1True ↔ ∀ᶠ (n : ℕ) in Filter.atTop, ∃ k, k ≠ 0 ∧ (n + k).minFac > k ^ 2 + 1

OpenStatement only, no proof

Sources

Search problems.science