Thread: faster than LL?
View Single Post
Old 2016-02-06, 11:28   #1
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

5×701 Posts
Default faster than LL?

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?
paulunderwood is offline   Reply With Quote