The following are Mersenne Primes 2, 3, 15, 29 and 39 MP2 =: <:2x^3 MP3 =: <: 2x^5 MP5 =: <: 2x^13 MP15 =: <: 2x^1279 MP29 =: <: 2x^110503 MP39 =: <: 2x^13466917
As an example <: 2x^3 in binary is 1000 - 1 which is binary 111 Any mersenne prime of the form <: 2x^N is "N binary 1s" It takes a very long time to calculate MP39. How could I accomplish the same thing by noting that in the case of MP39, I need to create an extended value that is "13466917 binary 1s" thanks ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
