Lucas-Lehmer test: Difference between revisions
Content deleted Content added
Walterpachl (talk | contribs) |
m →{{header|Java}}: Program never actually tests M2, but we all know it should be there |
||
| Line 622: | Line 622: | ||
upb = Integer.parseInt(args[0]); |
upb = Integer.parseInt(args[0]); |
||
System.out. |
System.out.print(" Finding Mersenne primes in M[2.." + upb + "]:\nM2 "); |
||
for (int p = 3; p <= upb; p += 2) |
for (int p = 3; p <= upb; p += 2) |
||
if (isPrime(p) && isMersennePrime(p)) |
if (isPrime(p) && isMersennePrime(p)) |
||