Hacker News new | past | comments | ask | show | jobs | submit login

It's not 10^10 ≈ 2^33 though, it's 2^(10^10) = 2^10000000000, or about 9 999 999 967 orders of magnitude more.



You only need to check the actual powers of two.

Checking about 10^10 of them is just about doable as vhcr correctly showed. (I mean it wasn't optimal, but 'leave this running for 400 hours' is far from impossible)


It is 10^10 cases, checking numbers up to 2^(10^10). The numbers themselves are pretty big (~9 gigabytes each if you want to write full binary representation), but nothing that modern computers can't handle.


Just by sheer numbers, the comment you're replying to must be one of the provably wrong-est comments in history of hacker news =).




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: