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.
Combinatorics
Erdős 535
Let r≥3, and let fr(N) denote the size of the largest subset of {1,…,N}
such that no subset of size
r
has the same pairwise greatest common divisor between all
elements. Erdős [Er64] proved that
f3(N)>Nc/loglogN
for some constant
c>0
, and
conjectured this should also be an upper bound; here we state the conjectural upper bound
for all
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.