Erdős problem 961 · problems.science

It is conjectured that $f(k) \ll (\log k)^O(1)$ .

Sources

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

6 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

961.lean

Retained formal statement2 of 6

Sylvester and Schur [Er34] proved that every set of $k$ consecutive integers greater than $k$ contains an integer divisible by a prime greater than $k$ , i.e. not $(k+1)$ -smooth.

FormalConjectures/ErdosProblems/961.leanErdos961.erdos_961.sylvester_schur1 lineExact file

1∀ (k : ℕ), 0 < k → Erdos961.Erdos961Prop k k

SolvedStatement only, no proof

Sources

Search problems.science