Hacker News new | ask | show | jobs
by PaulHoule 19 days ago
... or just considering the even numbers almost all of them are 2 x N where N>2^32 and that gets you to within a hair of "most" and if you add in the odd thirds for which the same is true you get a bound of 2/3 - epsilon.
2 comments

It's a bit more subtle than that -- most n>2^32 are not prime in which case 2 x n has more factorizations you would have to check.

(Just by way of example, for n=2^33, 2n=2^34 but also =2^17*2^17)

I'm not sure I understand your comment. Just because a number of of the form 2N with N > 2^32 doesn't mean it can't also be written as the product of two numbers below 2^32.

    E.g. 2^40 = 2^20 * 2^20