mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2021-06-03, 16:41   #936
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

291D16 Posts
Default

Quote:
Originally Posted by pepi37 View Post
Yesterday my "small Ryzen 3700x" start producing continuous beep, so PRP is found. Right now PRP is proven prime!
This is my second largest prime I ever found.


4*650^498101-1
A big congrats! Very nice find! :-)


Last fiddled with by gd_barnes on 2021-06-03 at 16:42
gd_barnes is online now   Reply With Quote
Old 2021-06-03, 23:22   #937
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

1,483 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
A big congrats! Very nice find! :-)


Thanks Gary!
pepi37 is offline   Reply With Quote
Old 2021-06-04, 00:50   #938
R. Gerbicz
 
R. Gerbicz's Avatar
 
"Robert Gerbicz"
Oct 2005
Hungary

5·13·23 Posts
Default

Quote:
Originally Posted by pepi37 View Post
Yesterday my "small Ryzen 3700x" start producing continuous beep, so PRP is found. Right now PRP is proven prime!
...
4*650^498101-1
Not very surprising.
R. Gerbicz is offline   Reply With Quote
Old 2021-06-04, 00:55   #939
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

1,483 Posts
Default

Quote:
Originally Posted by R. Gerbicz View Post
Not very surprising.
Can you explain, why is not surprising?
pepi37 is offline   Reply With Quote
Old 2021-06-04, 01:02   #940
R. Gerbicz
 
R. Gerbicz's Avatar
 
"Robert Gerbicz"
Oct 2005
Hungary

5·13·23 Posts
Default

Quote:
Originally Posted by pepi37 View Post
Can you explain, why is not surprising?
We are expecting that basically all of these (say >1000 digits) Prps are really primes, so not composite.

Last fiddled with by R. Gerbicz on 2021-06-04 at 01:03 Reason: typo
R. Gerbicz is offline   Reply With Quote
Old 2021-06-04, 01:06   #941
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

1,483 Posts
Default

Quote:
Originally Posted by R. Gerbicz View Post
We are expecting that basically all of these (say >1000 digits) Prps are really primes, so not composite.
In past, I read that many computers produced false positive primes when they are - 1. For now prime95 never failed on my machine. 😁
pepi37 is offline   Reply With Quote
Old 2021-06-04, 02:35   #942
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·4,787 Posts
Exclamation

Strictly speaking it is not UTM servers' job to _prove_ your PRP prime.
In fact, Caldwell (consequently) should be credited with proving this PRP prime. You should be credited at prptop Lifchitz' website, that would be correct.

It is the discoverer's burden to prove the PRP first, and only after that submit to UTM.

Is it so hard to install LLR on your computer?
Quote:
Originally Posted by pepi37 View Post
In past, I read that many computers produced false positive primes when they are - 1.
So, then, why do you submit a PRP (or possibly even a false positive) to UTM?
Instant gratification generation victim?
Batalov is offline   Reply With Quote
Old 2021-06-04, 08:02   #943
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

1,483 Posts
Default

Quote:
Originally Posted by Batalov View Post
Strictly speaking it is not UTM servers' job to _prove_ your PRP prime.
In fact, Caldwell (consequently) should be credited with proving this PRP prime. You should be credited at prptop Lifchitz' website, that would be correct.

It is the discoverer's burden to prove the PRP first, and only after that submit to UTM.

Is it so hard to install LLR on your computer?

So, then, why do you submit a PRP (or possibly even a false positive) to UTM?
Instant gratification generation victim?

Language barrier for many times ( like this one)
I have LLR on my computer and I test and prove it is prime.

But UTM server has last word , not me or my computer :) ( that is what I learn from you Batalov, when I found first prime here, many years ago)
pepi37 is offline   Reply With Quote
Old 2021-06-04, 12:38   #944
Happy5214
 
Happy5214's Avatar
 
"Alexander"
Nov 2008
The Alamo City

3·11·23 Posts
Default

Quote:
Originally Posted by pepi37 View Post
Language barrier for many times ( like this one)
I have LLR on my computer and I test and prove it is prime.

But UTM server has last word , not me or my computer :) ( that is what I learn from you Batalov, when I found first prime here, many years ago)
LLR 3.8.24 can run PRP/GEC tests now, followed automatically by the standard primality proof on whatever turns up as a probable prime. You don't really need Prime95 for GEC anymore.
Happy5214 is offline   Reply With Quote
Old 2021-06-04, 13:13   #945
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

148310 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
LLR 3.8.24 can run PRP/GEC tests now, followed automatically by the standard primality proof on whatever turns up as a probable prime. You don't really need Prime95 for GEC anymore.
I prefer prime95 over llr
pepi37 is offline   Reply With Quote
Old 2021-06-16, 11:01   #946
rebirther
 
rebirther's Avatar
 
Sep 2011
Germany

11×271 Posts
Default

170*709^183988-1 found by grcpool.com (524487 digits)
rebirther is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Report top-5000 primes for all k<=1001 gd_barnes No Prime Left Behind 1525 2021-10-24 23:00
Report top-5000 primes for k=1003-3000 gd_barnes No Prime Left Behind 688 2020-04-24 07:31
All top 5000 primes will have the same number of digits in 2014 ;-) Batalov Conjectures 'R Us 10 2013-03-29 01:29
Twenty Oldest Primes on Top 5000 List masser Lounge 9 2008-08-27 12:31
get all the 5000 biggest primes above 100K digits jasong jasong 1 2007-06-09 22:51

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


Tue Oct 26 22:55:16 UTC 2021 up 95 days, 17:24, 1 user, load averages: 1.45, 1.32, 1.25

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.