Erdős problem 371 · problems.science

Let $P(n)$ denote the largest prime factor of $n$ . Show that the set of $n$ with $P(n+1) > P(n)$ has density $\frac{1}{2}$ .

No current result

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

FormalConjectures/ErdosProblems/371.lean

Formal Conjectures

FormalConjectures/ErdosProblems/371.leanErdos371.erdos_3711 lineExact file

1{n | (n + 1).maxPrimeFac > n.maxPrimeFac}.HasDensity (1 / 2)

OpenStatement only, no proof