🇳🇱
Adapted my primality test algorithm to do a check for if a number is a "Perfect Number" (the sum of all its dividends equals the number itself). This one was fun and turned out to be super fast as well. It was written in Haskell.
@freemo Another cool feature I found is how to quickly find prime numbers for RSA.
@LWFlouisa Yea we have a lot of really cool probabilistic methods for finding large primes. Did you discover a new novel way or just read about an existing one?
@freemo A little bit of both if I were being completely honest.
Tesla I think accidentally stumbled on a way to generate large prime numbers, then Marko Rodin used to come up with the Rodin coil.
I borrowed 3, 6, and 9 to use smaller primes to quadruple the size of the key pair rather than merely multiplying two.
I can do a drawing on it later if you want.
@LWFlouisa yea id like to see the math or an example or something.
@freemo Will do, as I'd really like for engineers that know more math than I do to know about it.