mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2018-01-15, 21:21   #1
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

17×79 Posts
Default InterimResidues -prime 95

Since many of you use Prime95 for LL checking , I will ask one thing

If I remember correctly ( and there is possibility that my recollection is false) that was option in Prime95 ( or in other program that can make LL test) that show some kind of residue every xxx iterations. And if program is PRP or prime that residue drops to 0000000000.
Most similar that i found is InterimResidues and it looks similar , but it doesnot drop to 0000000000 when I test prime.

So am I missed something , or there is no such option.
Thanks for reply
pepi37 is offline   Reply With Quote
Old 2018-01-16, 00:35   #2
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

2×1,471 Posts
Default

For example
InterimResidues=1000000
in prime.txt will output the residues every 1M iterations to screen and to results.txt.

Actually in results.txt it will output 3 consecutive residues lines each times: n*1M, n*1M+1 and n*1M+2, and it is the n*1M+2 line that will match the n*1M residue from CUDALucas / Mlucas since they number iterations differently.

It is only the very final residue that will be 0000000000000000 for the known primes, not the Interrim Residues.
ATH is offline   Reply With Quote
Old 2018-01-16, 09:30   #3
pacionet
 
pacionet's Avatar
 
Oct 2005
Italy

3×113 Posts
Default

Do some math analysis exist on the residues of composite Mersenne candidates? Can the residue values suggest something of next Mersenne?
pacionet is offline   Reply With Quote
Old 2018-01-16, 11:43   #4
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

134310 Posts
Default

Quote:
Originally Posted by ATH View Post
For example
InterimResidues=1000000
in prime.txt will output the residues every 1M iterations to screen and to results.txt.

Actually in results.txt it will output 3 consecutive residues lines each times: n*1M, n*1M+1 and n*1M+2, and it is the n*1M+2 line that will match the n*1M residue from CUDALucas / Mlucas since they number iterations differently.

It is only the very final residue that will be 0000000000000000 for the known primes, not the Interrim Residues.
So my recollection is false :(
Thanks for answer ATH
pepi37 is offline   Reply With Quote
Old 2018-01-16, 12:59   #5
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by pacionet View Post
Do some math analysis exist on the residues of composite Mersenne candidates? Can the residue values suggest something of next Mersenne?
Theoretically, if we could store the other divisor of S_n we could start a test at the nearest mersenne prime exponent. It gets a bit harder with non-zero residues though. There are properties a residue has to have if the number is composite, these are at best useful for checking factors slower than trial factoring currently though.
science_man_88 is offline   Reply With Quote
Old 2018-01-16, 16:38   #6
GP2
 
GP2's Avatar
 
Sep 2003

22×3×5×43 Posts
Default

Quote:
Originally Posted by pacionet View Post
Do some math analysis exist on the residues of composite Mersenne candidates? Can the residue values suggest something of next Mersenne?
In nearly all cases, all we retain are the final 64 hexadecimal bits of each residue.

You could check to make sure that the frequency of each hexadecimal digit is roughly equal. I think I did that at one point and found nothing out of the ordinary.

I don't think that Mersenne primes create some kind of numerological distortion field that leaves clues in the residues of nearby Mersenne exponents.
GP2 is offline   Reply With Quote
Old 2018-01-16, 17:16   #7
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

20C016 Posts
Default

Quote:
Originally Posted by GP2 View Post
I don't think that Mersenne primes create some kind of numerological distortion field that leaves clues in the residues of nearby Mersenne exponents.
I can tell you outright , that the residue of the even exponent mersenne after a mersenne prime exponent gives you
(-(2r+1))^2-2 mod the even exponent mersenne, where 2(2r+1)*adjacent mersenne prime = previous S_n. 14=2*7 tells you the next value mod 15 is 14 (aka -1). That being said I can't extend the math usefully to help.okay not quite right but close.

Last fiddled with by science_man_88 on 2018-01-16 at 18:15
science_man_88 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED! dabaichi News 561 2013-03-29 16:55
disk died, prime work lost forever? where to put prime? on SSD or HDD? emily PrimeNet 3 2013-03-01 05:49
How do I determine the xth-highest prime on prime pages? jasong Data 7 2005-09-13 20:41
The 40th known Mersenne prime, 220996011-1 is not PRIME! illman-q Miscellaneous Math 33 2004-09-19 05:02
InterimResidues= Gary Edstrom Lounge 1 2003-12-05 04:28

All times are UTC. The time now is 03:51.

Wed Sep 30 03:51:46 UTC 2020 up 20 days, 1:02, 0 users, load averages: 1.51, 1.65, 1.56

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.