←back to thread

359 points sdsykes | 1 comments | | HN request time: 0.33s | source
Show context
stevefan1999 ◴[] No.41886077[source]
But why do we have to "discover" it when we know the formula would be 2^N - 1...? Are we trying to prove a corollary or what?
replies(2): >>41886104 #>>41886109 #
1. Jabrov ◴[] No.41886109[source]
There’s tons of numbers of the form 2^N-1 which are not prime.

To discover the primes, we have to iterate through the numbers and test their primality. With numbers that are so big, it’s very compute intensive