mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Miscellaneous Math (https://www.mersenneforum.org/forumdisplay.php?f=56)
-   -   I think (wish) I find a new prime number record (https://www.mersenneforum.org/showthread.php?t=25562)

Glenio 2020-05-23 11:02

I think (wish) I find a new prime number record
 
hello i'm new to the forum and i discovered a new prime number how do i claim the reward?

retina 2020-05-23 11:41

[QUOTE=Glenio;546282][B][COLOR="Red"]hello i'm new to the forum and i discovered a new prime number how do i claim the reward?[/COLOR][/B][/QUOTE]The first step is to post your number for verification.

You won't get anything unless you show us your number is both large enough and is prime.

Glenio 2020-05-23 11:48

Descobri um número primo maior que o atual
 
2^102589933:sorriso: já mandei a reedificação

[b][color=red][size=4]MODERATOR NOTE:[/size] Moved from "Mersenne prime in a Cunningham chain" thread.[/color][/b]

[b]Note on current status:[/b] (assuming poster meant 2^102589933 [b]- 1[/b]) Exponent status, No factors below 2[sup]74[/sup]

pinhodecarlos 2020-05-23 11:55

Submit it here please: [url]https://primes.utm.edu/primes/[/url]

Glenio 2020-05-23 11:59

This is the number
 
This is the number 2^102589933

LaurV 2020-05-23 13:34

[QUOTE=Glenio;546287]This is the number 2^102589933[/QUOTE]
This number can not be prime, as it is divisible by 2. Actually, you can divide it by 2 about a hundred million times, and you still get integers all along, which are still not prime, none of them is prime.

kriesel 2020-05-23 13:56

[QUOTE=Glenio;546287]This is the number 2^102589933[/QUOTE]That number is composite (not prime) by definition. b[SUP]a[/SUP] for b>1, a>1, a and b integer, is composite; b is a factor. This may win the prize for most obviously NOT prime (which is public embarrassment). It has one prime factor and over a hundred million distinct composite factors 2[SUP]1[/SUP], 2[SUP]2[/SUP], 2[SUP]3[/SUP], ..., 2[SUP]102589932[/SUP].
[URL]https://www.mersenneforum.org/showpost.php?p=521665&postcount=3[/URL]
It also happens to have a superficial relationship to the largest known Mersenne prime, 2[SUP]82589933[/SUP]-1, whose exponent is 20M less.
See also, for the perfect record of predicting large primes,by various means, [URL]https://www.mersenneforum.org/showpost.php?p=512904&postcount=5[/URL]
Possibilities, more likely first: Inaccurate post lacking +-c, trolling, combination, computation error, something else, new prime discovery.

In the very unlikely event that it's a Mersenne prime discovery, verification should have quietly occurred without posting an exponent, then announcement via MRI Inc. press release. [URL]https://www.mersenneforum.org/showpost.php?p=490315&postcount=14[/URL]

paulunderwood 2020-05-23 14:15

[QUOTE=kriesel;546292]That number is composite (not prime) by definition. b[SUP]a[/SUP] for b>1, a>1, a and b integer, is composite; b is a factor. This may win the prize for most obviously NOT prime.
[URL]https://www.mersenneforum.org/showpost.php?p=521665&postcount=3[/URL]
It also happens to have a superficial relationship to the largest known Mersenne prime, 2[SUP]82589933[/SUP]-1, whose exponent is 20M less.
See also, for the perfect record of predicting large primes,by various means, [url]https://www.mersenneforum.org/showpost.php?p=512904&postcount=5[/url][/QUOTE]

The "8" --> "10" in the exponent would be beyond expectation. It would take a day on a GPU you to dismiss this claim, assuming P-1 does not turn up a factor.

kriesel 2020-05-23 14:28

[QUOTE=paulunderwood;546294]The "8" --> "10" in the exponent would be beyond expectation. It would take a day on a GPU [for] you to dismiss this claim, assuming P-1 does not turn up a factor.[/QUOTE]P-1 to full PrimeNet bounds on M102589933 under way here, will complete in hours. [URL]https://www.mersenne.ca/exponent/102589933[/URL] says 5.6% probability of factor, no p-1 result reported yet. It would be silly to have primality tested it without doing that first.
Maybe he meant a Fermat number. That claim would be safe from computational attack for a while.
As stated in his post, a large power of two being prime, it's too absurd a claim to even bother including in the count in the "dubious claims" list behind the stats in [URL]https://www.mersenneforum.org/showpost.php?p=512904&postcount=5[/URL]

There are few rhyming prime exponents surviving even cursory TF above M82589933.
[M]102589933[/M] NF 74, further TF assigned to gpu72, P-1 underway
112589933 small factor
222589933 small factor
[M]232589933[/M] NF 71, go to 79 assigned, no p-1 yet 2290000,68700000
312589933 small factors
532589933 smallish factor
612589933 smallish factor
[M]642589933[/M] NF 70, go to 84 assigned, no p-1 yet 5740000,172200000
[M]652589933[/M] NF 71, go to 84 assigned, no p-1 yet 5820000,174600000
672589933 smallish factors
702589933 small factors
892589933 smallish factor
912589933 smallish factor
952589933 small factors
(up to 999M)

The 3 other survivors are being addressed with TF and may get some P-1 attention after.

Glenio 2020-05-23 18:02

Prime Number
 
70237298350549551468899 á is congruent with 1 (mod 4) and no cofactor is also known; therefore, there may still be a chance that 2 ^ 70237298350549551468899-1 is prime. This is just an example that I am taking into account.

Uncwilly 2020-05-23 18:02

What software did you use to test it?
If you were using mprime or Prime95, email the save files to George Woltman.
If you used mlucas, contact Ernst Meyer with your save files.
Do you have any interim residues? Those would be helpful (we could have others test it and if there are mis-matches, we can see which 2 of 3 agree.)


All times are UTC. The time now is 17:53.

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