I want to do: bigNum =: 2 $ 0 _1 + _1 + 2x^13466917
The trouble is: 13466917 is a big exponent and it takes a long time long time to do 2^13466917 I would like to create bigNumber by using left-shifts. if bigNum were a c pointer, I would just set big bit 13466917 to 1 with all the rest of the bits of bigNum set to 0. bigNum =: 2 $ 0 _1 + 2x^216091 completes in about 30 seconds. I have been running : bigNum =: 2 $ 0 _1 + _1 + 2x^13466917 for about 2 hours. Given the definition: congruent =: [: =/ |~ and bigNum =: 2 $ 0 _1 + _1 + 2x^1257787 bigNum congruent _1 1 Which proves that _1 + 2x^1257787 is a prime number. This was proved 1996 by "Slowinski and Gage" I am trying to prove that: _1 + 2x^13466917 is a prime number. This was proven in 2001 by "Cameron, Woltman, Kurowski" If interested in primes, see http://primes.utm.edu/mersenne/index.html#known ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
