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 statement2 of 4

Let $F(n) := \max\{m + p(m) \mid \textrm{$ m < n $composite}\}\}$ where $p(m)$ is the least prime divisor of $m$ . Does $F(n) - n \to \infty$ as $n\to\infty$ ?

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

1sorry ↔ Filter.Tendsto (fun n => Erdos385.F n - n) Filter.atTop Filter.atTop

OpenStatement only, no proof

Sources

Search problems.science