[QUOTE=pepi37;579849]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.


[URL="https://primes.utm.edu/primes/page.php?id=132360"]4*650^498101-1[/URL][/QUOTE]

A big congrats! Very nice find! :-)

:bow wave:

[QUOTE=gd_barnes;579882]A big congrats! Very nice find! :-)

:bow wave:[/QUOTE]


Thanks Gary!

[QUOTE=pepi37;579849]Yesterday my "small Ryzen 3700x" start producing continuous beep, so PRP is found. Right now PRP is proven prime!
...
[URL="https://primes.utm.edu/primes/page.php?id=132360"]4*650^498101-1[/URL][/QUOTE]

Not very surprising.

[QUOTE=R. Gerbicz;579909]Not very surprising.[/QUOTE]

Can you explain, why is not surprising?

[QUOTE=pepi37;579910]Can you explain, why is not surprising?[/QUOTE]

We are expecting that basically all of these (say >1000 digits) Prps are really primes, so not composite.

[QUOTE=R. Gerbicz;579911]We are expecting that basically all of these (say >1000 digits) Prps are really primes, so not composite.[/QUOTE]

In past, I read that many computers produced false positive primes when they are - 1. For now prime95 never failed on my machine. 😁

Strictly speaking it is [B]not [/B]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 [B]after that[/B] submit to UTM.

Is it so hard to install LLR on your computer? :rolleyes:
[QUOTE=pepi37;579912]In past, I read that many computers produced false positive primes when they are - 1. [/QUOTE]
So, then, why do you submit a PRP (or possibly even a false positive) to UTM?
Instant gratification generation victim?

[QUOTE=Batalov;579913]Strictly speaking it is [B]not [/B]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 [B]after that[/B] submit to UTM.

Is it so hard to install LLR on your computer? :rolleyes:

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


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)

[QUOTE=pepi37;579924]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)[/QUOTE]

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.

[QUOTE=Happy5214;579930]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.[/QUOTE]

I prefer prime95 over llr

170*709^183988-1 found by grcpool.com (524487 digits)