Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Number theory
Erdős 1142
Are there infinitely many n>2 such that n−2k is prime for all k≥1
[Va99] Various, Some of Paul's favorite problems. Booklet produced for the conference "Paul Erdős and his mathematics", Budapest, July 1999 (1999).
[MiWe69] Mientka, W. E. and Weitzenkamp, R. C., On f-plentiful numbers, Journal of Combinatorial Theory, Volume 7, Issue 4, December 1969, pages 374-377.
No one has attempted this yet.
Formal statement
Lean type
True ↔ Infinite ↑{n | Erdos1142.Erdos1142Prop n}
What you must prove
import FormalConjectures.ErdosProblems.«1142»
import TaskSupport
namespace Bounty
theorem target : ¬ (fcTypeOfName% "Erdos1142.erdos_1142") := by
sorry
end Bounty
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.