erdős #219 · Green-Tao theorem
Are there arbitrarily long arithmetic progressions of primes?
Worked, still open.
number theory · solved · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsformal
AMS 5 11 · test (literature)
theorem primeArithmeticProgression_3_5_7 : {3, 5, 7} ∈ primeArithmeticProgressionsformal-conjectures/219.lean ↗oeis
A005115 — Let i, i+d, i+2d, ..., i+(n-1)d be an n-term arithmetic progression of primes; choose the one which minimizes the last term; then a(n) = last term i+(n-1)d.2,3,7,23,29,157,907,1669,1879,2089,249037,262897,725663,36850999,173471351,198793279,4827507229,17010526363,83547839407,A113827 — Initial terms associated with the arithmetic progressions of primes in A005115.2,2,3,5,5,7,7,199,199,199,110437,110437,4943,31385539,115453391,53297929,3430751869,4808316343,8297644387,214861583621,5A123556 — Number of elements in longest possible arithmetic progression of primes with difference n.2,3,2,3,2,5,1,3,2,3,2,5,1,3,2,2,2,4,1,3,2,2,1,4,1,2,2,3,2,6,1,2,1,3,2,4,1,3,2,3,2,5,1,2,2,2,1,5,1,3,2,2,1,4,1,2,2,2,2,6,
links
status
solved