Lucas-Lehmer test: Difference between revisions

Lucas-Lehmer test (view source)

2 bytes added , 11 years ago

m

→‎{{header|Java}}: Program never actually tests M2, but we all know it should be there

Anonymous user

Revision as of 09:58, 12 July 2012 (view source) Walterpachl (talk \| contribs) m (→‎{{header\|REXX}}) ← Older edit		Revision as of 18:17, 17 July 2012 (view source) rosettacode>Mwn3d m (→‎{{header\|Java}}: Program never actually tests M2, but we all know it should be there) Newer edit →
Line 622: upb = Integer.parseInt(args[0]); System.out.~~println~~print(" Finding Mersenne primes in M[2.." + upb + "]:\nM2 "); for (int p = 3; p <= upb; p += 2) if (isPrime(p) && isMersennePrime(p))