it has no practical use we just like finding new primes
-
-
-
modern cryptography is entirely built on factorization of large prime numbers. also algorithms for procedural generation used in games often use irrational numbers or large primes as a source of randomness
- 4 more replies
New conversation -
-
-
If anyone wonders how many digits are there: 1 + floor(77232917·lg2) = 23249425 digits
-
Is that formula exact?
- 2 more replies
New conversation -
-
-
How is it possible that such big numbers can't be divided?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I read in
@JSEllenberg's book that many properties of prime number make sense if you just think of them as randomly distributed. Intuitively it feels right that 2^{p-1} has a high 'chance' of being prime.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
how many digits does it have?
-
Roughtly 2.3 million I reckon.
End of conversation
New conversation -
-
-
This Tweet is unavailable.
-
You probably wouldn't want to use Mersenne primes to make a public/private key for the RSA algorithm, simply because they're easily guessed. But if a publicly-known large prime needed to be chosen for an algorithm, a Mersenne could be useful.
End of conversation
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.