Erdős problem 459
Let be the largest such that no is composed entirely of primes dividing . Estimate .
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/459.lean∀ {u : ℕ}, 2 ≤ u → u + 2 ≤ Erdos459.f u ∧ Erdos459.f u ≤ u ^ 2Proof manifests naming this Problem
- Jayyhk Erdős Lean
jayyhk:erdos:459 - PLBY Lean proofs
ErdosProblems.Erdos459
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
Formalization
- Machine