Erdős problem 385 · problems.science

Note that trivially $F(n) \leq n + \sqrt{n}$ .

Sources

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

4 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

385.lean

Retained formal statement1 of 4

Let $F(n) := \max\{m + p(m) \mid \textrm{$ m < n $composite}\}\}$ where $p(m)$ is the least prime divisor of $m$ . Is it true that $F(n)>n$ for all sufficiently large $n$ ?

FormalConjectures/ErdosProblems/385.leanErdos385.erdos_385.parts.i1 lineExact file

1sorry ↔ ∀ᶠ (n : ℕ) in Filter.atTop, n < Erdos385.F n

OpenStatement only, no proof

Sources

Search problems.science