Vela

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_37aec80d874a0239
vela reproduce examples/erdos-problems

formal

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}.Infinite
formal-conjectures/429.lean ↗

status

solved

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 0851d6c3f5a263eb5a48cbd8f14cf2e6c78be5c50a42ced7c971ef5002d5895e

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.