Skip to content

Erdős problem 680

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

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/680.lean

Formal Conjectures

FormalConjectures/ErdosProblems/680.leanErdos680.erdos_680.parts.i1 lineExact file
True ↔ ∀ᶠ (n : ℕ) in Filter.atTop, ∃ k, k ≠ 0 ∧ (n + k).minFac > k ^ 2 + 1
OpenStatement only, no proof

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page