Problem

erdos:1209

False ↔ ∃ f, ∀ (a : ℕ → ℕ), StrictMono a → (∀ (k : ℕ), f k ≤ a k) → (∃ n, ∀ (k : ℕ), Nat.Prime (n + a k)) → {n | ∀ (k : ℕ), Nat.Prime (n + a k)}.Infinite

Open Current State

Declared status: open
Formalization: formalized
Subjects: number theory
OEIS: possible
Sources: source:erdos-ai-contributions-wikisource:erdos-problemssource:formal-conjectures
Statement: www.erdosproblems.com

Matching claims

0

No direct claims

This problem has no directly related claim record.

Browse this Repository’s Claims