Erdős problem 681 · problems.science

Erdős problem 681. Is it true that for all large $n$ there exists $k$ such that $n + k$ is composite and $p(n+k) > k^2$ , where $p(m)$ is the least prime factor of $m$ ?

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/681.lean

Formal Conjectures

FormalConjectures/ErdosProblems/681.leanErdos681.erdos_6811 lineExact file

1True ↔ ∀ᶠ (n : ℕ) in Filter.atTop, ∃ k > 0, (n + k).Composite ∧ ∀ (p : ℕ), Erdos681.IsLPF p (n + k) → p > k ^ 2

OpenStatement only, no proof

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Continue

Search problems.science