Processing math: 100%


USAMO
1982


Problem - 3498
Prove that there exists a positive integer k such that k2n+1 is composite for every integer n.

report an error