mersenneforum.org > Math New test for Mersenne prime
 Register FAQ Search Today's Posts Mark Forums Read

2011-05-20, 22:48   #34
science_man_88

"Forget I exist"
Jul 2009
Dartmouth NS

841810 Posts

Quote:
 Originally Posted by CRGreathouse The squarings and modulus you speak of are parts of a single modular squaring (which may not have distinct "squaring" and "reducing" steps). The subtractions are cheap compared to the squarings. Technically, squaring is different from (easier than) multiplication, but at a minimum a test designed to supplant LL can't do more than p full-length multiplications, because those alone would take longer than the LL.
I have a possible property of most (exception when using $MPE_1$ in my idea as one of the exponents.)of the confirmed order exponents I think but it may be nothing but it does work for all exponents up to ${MPE}_{40}$ according to the values of the exponents given at: http://primes.utm.edu/mersenne/

PS. looks to have failed as a definitive test!

Last fiddled with by science_man_88 on 2011-05-20 at 23:05

 2022-09-11, 13:03 #35 billymac00   Nov 2006 SW Virginia USA 1002 Posts revive very old post but ... Pari can be used, just use modular exponentiation using repeated squaring. On my pathetic computer things really slow down beginning at exp=756839. I haven't framed the timing as a f{exp size}. If someone has superior computing capability I would be curious as to their timing for 756839, I can supply the script.

 Similar Threads Thread Thread Starter Forum Replies Last Post dabaichi News 571 2020-10-26 11:02 paulunderwood Miscellaneous Math 18 2017-01-26 20:33 spkarra Math 21 2015-01-23 18:13 jocelynl Math 8 2006-10-20 19:36 illman-q Miscellaneous Math 33 2004-09-19 05:02

All times are UTC. The time now is 22:52.

Sat Jan 28 22:52:11 UTC 2023 up 163 days, 20:20, 0 users, load averages: 0.66, 1.02, 1.05