Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

A more challenging 'edition' is to find a number that spells out one of its prime factors.

But then, that long number wouldn't be a prime, so it's more like prime-ception. :)



That isn't very difficult. Choose a prime, say 2. Now pick a sufficiently large number of digits to get a high enough resolution. Pick a number that graphically spells out 2. Replace the least significant bit of the number with a zero. You are done.

In general, "fixing" a number such that it is divisible by a given prime is easy.


Something like this - https://youtu.be/3IMAUm2WY70 ?




Consider applying for YC's Fall 2026 batch! Applications are open till July 27.

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

Search: