mersenneforum.org faster than LL?
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2016-08-01, 22:56 #12 paulunderwood     Sep 2002 Database er0rr 353110 Posts I have extended the nub of this thread a little further, but it still seems to be computationally useless. For example b = 3 and p = 61 so that mp = 2^61 - 1, I ran this: Code: ? p=61;mp=2^p-1;D=mp-1;V=factor(D,1000000);forbigdiv(D,d -> r=lift(Mod(3,mp)^(D/d));if(2^logint(r,2)==r,print(">>>"d))) >>>1 >>>61 >>>3 >>>183 >>>9 >>>549 Where "forbigdiv" is given here This means 3^((mp-1)/549) == 2^n for some n OR 3^4200078341008550 == 2^n for some n, thus implying M61 is prime. I will experiment with other bases b, for example p ... Last fiddled with by paulunderwood on 2016-08-01 at 23:21
2016-08-01, 23:38   #13
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts

Quote:
 Originally Posted by paulunderwood Code: ? p=61;mp=2^p-1;D=mp-1;V=factor(D,1000000);forbigdiv(D,d -> r=lift(Mod(3,mp)^(D/d));if(2^logint(r,2)==r,print(">>>"d))) >>>1 >>>61 >>>3 >>>183 >>>9 >>>549
is your intent for D/d to get the largest one's out of the way first as D/2 will be the biggest exponent and will also be a divisor of D.

Last fiddled with by science_man_88 on 2016-08-01 at 23:46

2016-08-02, 00:05   #14
paulunderwood

Sep 2002
Database er0rr

3×11×107 Posts

Quote:
 Originally Posted by science_man_88 is your intent for D/d to get the largest one's out of the way first as D/2 will be the biggest exponent and will also be a divisor of D.
Some order is possible, I guess.

 Similar Threads Thread Thread Starter Forum Replies Last Post arbiter21 Information & Answers 17 2016-02-05 05:04 lidocorc Software 2 2008-11-08 09:26 bearnol Math 35 2005-10-12 14:33 1260 Miscellaneous Math 23 2005-09-04 07:12 clowns789 Miscellaneous Math 3 2004-05-27 23:39

All times are UTC. The time now is 07:46.

Wed Jan 20 07:46:16 UTC 2021 up 48 days, 3:57, 0 users, load averages: 4.31, 3.83, 3.77