The infinite monkey theorem states that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type any given text, including the complete works of William Shakespeare.
Monkeys are old hat. I much prefer to calculate pi in binary and then dump the result into a bitmap, then scroll through it infinitely. Eventually I’ll learn everyone’s secrets…
I vaguely remember reading about a way of writing down prime numbers that ended up in a pattern that could be translated into some kind of image. Math is awesome.
Considering a large portion of cryptography is based around large prime numbers being incredibly hard to find, I find it hard to believe anybody has found a significant pattern in them. That’s kind of the whole point.
Unfortunately I cannot find this article about patterns in prime numbers. I remember it was pretty technical but apart from the general idea I’m not able to provide anymore details.
I wonder how many monkeys NVIDIA has? /s
Monkeys are old hat. I much prefer to calculate pi in binary and then dump the result into a bitmap, then scroll through it infinitely. Eventually I’ll learn everyone’s secrets…
I vaguely remember reading about a way of writing down prime numbers that ended up in a pattern that could be translated into some kind of image. Math is awesome.
Considering a large portion of cryptography is based around large prime numbers being incredibly hard to find, I find it hard to believe anybody has found a significant pattern in them. That’s kind of the whole point.
Can you link to what you’re talking about?
Unfortunately I cannot find this article about patterns in prime numbers. I remember it was pretty technical but apart from the general idea I’m not able to provide anymore details.
Thanks for looking
https://libraryofbabel.info/
First thing that came to mind.