Erdős problem 383
Is it true that for every there are infinitely many primes such that the largest prime divisor of is ?
Sources
FormalConjectures/ErdosProblems/
383.lean
Retained formal statement
Is it true that for every there are infinitely many primes such that the largest prime divisor of is ?
True ↔ ∀ (k : ℕ), {p | Nat.Prime p ∧ (∏ i ∈ Finset.Icc 0 k, (p ^ 2 + i)).maxPrimeFac = p}.InfiniteOpenStatement only, no proof