for (int p = 1; p <= N; ++p) { for (int q = p; q <= N; q += p) { } }
n(1 + 1/2 + 1/3 + … + 1/n) = O(n log n)