Thread: faster than LL?
View Single Post
Old 2016-02-06, 13:30   #2
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

203008 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
Code:
? gettime();p=44497;N=2^p-1;q=(N-1)/p;lift(Mod(3,N)^N);gettime()
6132
Code:
? gettime();p=44497;N=2^p-1;q=(N-1)/p;lift(Mod(3,N)^q);gettime()
6125
The result of Mod(3,n)^q is a power of 2 less than 2^p-1 -- but only for Prime Mp?
it will depend on which version or coding of the LL test you use to test it against on my system for exponent 110503 your code runs for 1min, 29,975 ms. the lucas example takes about 2min, 17,097 ms. and the code from http://mersenneforum.org/showpost.ph...86&postcount=2 runs in under 29 seconds.
science_man_88 is offline   Reply With Quote