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

Let's say you fancy yourself as a cryptographer. You come up with a black box, it's a function that takes a number and produces another number. You figure you can use it to build a pseudorandom stream of numbers that will be the source of a cipher.

Your algorithm is to start with a random number (the key) and and feed it to your function, producing another number. Which you feed to your function, producing a third number. And so you go, generating a stream of numbers for your cipher.

After reading how Kaprekar's operation leads to a fixed point for four digit numbers and various cycles for other numbers, you might be nudged into investigating to see if there are inputs for your function that lead to cycles and fixed points. Which would pretty-much break your cipher entirely.

Is this interesting? Yes. Is there computational insight? There is for me. Does it teach anything? I dunno, how is teaching something distinguished from providing insight?



A fair point. The process of analyzing Kaprekar numbers could certainly be applied to other numerical sequences.




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

Search: