mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2018-03-07, 03:01   #23
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

8,369 Posts
Default

Quote:
Originally Posted by gophne View Post
The fact that the Lucas-Lehmer iteration works suggests to me that the distribution of mersenne prime numbers are "regular', dependant on the outcome of the LL iteration, but never-the-less "regular".

My question would be if anybody has ever looked or found any "marker/s" in the set of values generated by each mersenne prime iteration. Such things as say the term nearest to the "square root" position value of the set of iterations being of a certain relationship to the value of the successful value which would yield a return of "0", or any other relationship between the values comprising the set of iterations for a specific mersenne prime.

Any such marker could then either reduce the time needed to "prove" primality, or be an indicator whether it would be fruitful to continue with that iteration.
Iterations that hit -2,-1,0,1,2 mod the mersenne, prior to the final iteration are either bad, or not prime. We also know (uselessly) that the residue has the same parity as the floor of the full number divided by the mersenne. Another useless fact is that a candidate factor can be tested using a modified LL test mod the candidate ( given at least 1 LL test using the mersenne). About the only interesting fact I come up with on the fly, is that a candidate mersenne prime, has to have an even multiple of the product of all previous mersenne primes( except maybe pairs of twin prime exponents), congruent to -2 mod the candidate.

Last fiddled with by science_man_88 on 2018-03-07 at 03:12
science_man_88 is offline   Reply With Quote
Old 2018-03-07, 09:45   #24
JM Montolio A
 
Feb 2018

25×3 Posts
Default

I never find any rule for primes.

I believe that is the only rule true here.

If you detect a rule, wrong way.
JM Montolio A is offline   Reply With Quote
Old 2018-03-08, 18:00   #25
gophne
 
Feb 2017

3·5·11 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
Iterations that hit -2,-1,0,1,2 mod the mersenne, prior to the final iteration are either bad, or not prime. We also know (uselessly) that the residue has the same parity as the floor of the full number divided by the mersenne. Another useless fact is that a candidate factor can be tested using a modified LL test mod the candidate ( given at least 1 LL test using the mersenne). About the only interesting fact I come up with on the fly, is that a candidate mersenne prime, has to have an even multiple of the product of all previous mersenne primes( except maybe pairs of twin prime exponents), congruent to -2 mod the candidate.
Wow interesting. Does this last relationship hold for all the known mersenne primes?
gophne is offline   Reply With Quote
Old 2018-03-11, 23:20   #26
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

8,369 Posts
Default

Quote:
Originally Posted by gophne View Post
Wow interesting. Does this last relationship hold for all the known mersenne primes?
Has to for primes testable by LL. Once 0 mod a number is hit, -2 mod that number is hit, followed by repeating 2 forever. 2 mod coprimes, is 2 mod their product. Etc.

Last fiddled with by science_man_88 on 2018-03-11 at 23:21
science_man_88 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Lucas-Lehmer test Mathsgirl Information & Answers 23 2014-12-10 16:25
proof the lucas lehmer test kurtulmehtap Math 13 2009-10-02 12:12
Lucas-Lehmer Test storm5510 Math 22 2009-09-24 22:32
Lucas-Lehmer Test proof alpertron mersennewiki 16 2006-03-18 07:23
Lucas-Lehmer primality test CMOSMIKE Math 5 2002-09-06 18:46

All times are UTC. The time now is 11:36.

Wed Nov 25 11:36:35 UTC 2020 up 76 days, 8:47, 4 users, load averages: 1.62, 1.77, 1.70

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.