erdős #429
Is it true that, if is sparse enough and does not cover all residue classes modulo for any prime , then there exists some such that is prime for all ?
Worked, still open.
number theory · solved · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsformal
AMS 11 · solved (literature)
theorem erdos_1209.parts.i :
answer(False) ↔
∃ f : ℕ → ℕ, ∀ a : ℕ → ℕ, StrictMono a → (∀ k, f k ≤ a k) →
(∃ n, ∀ k, (n + a k).Prime) →
{n | ∀ k, (n + a k).Prime}.Infiniteformal-conjectures/429.lean ↗links
Create a formalisation here · link
status
solved