![]() |
![]() |
#1 |
10100101010102 Posts |
![]()
hello! i found a formula that generates mersenne prime numbers based on the known ones.
the next mersenne prime is 88xxxxxx and the next one is 103xxxxxx. how do i claim the prize? |
![]() |
![]() |
#2 |
2×53×11 Posts |
![]()
actually the formula does not guarantees mersenne prime as it has two variables. it returned 1/3 of proven composite mersenne numbers or tested numbers.
but it did generated m49, m50, m51, however there is a false positive between m50, m51. |
![]() |
![]() |
#3 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
32×1,217 Posts |
![]()
How did your formula do on M1 -> M48?
It "returned 1/3 of proven composite mersenne numbers"? What do you mean by that? Does it yield a wrong answer 1/3 of the time? Care to share more details about the "formula"? Which prize are you trying to claim? |
![]() |
![]() |
![]() |
#4 |
682210 Posts |
![]()
the formula produced result as follows, composite = composite number, either the expooents is not prime, or it is divisible by something.
m11-m20 composite composite m21-25 composite composite m26-m29 composite m30-m32 composite m33 (misses m34) composite m35 composite x 2 m36 composite x 3 m37 composite m38 composite m39-m41 composite m42 m43 composite m44 composite x 4 m45 composite x 2 m46 composite x 2 m47 composite x 3 m48 composite m49 m50 composite x 8 m51 ... there are 4 obvious composite numbers here 3 of them already factored suspected m52 88xxxxxx 8 composite numbers, 7 of them factored, the last one looks too close to suspected m52 14 composite numbers follows all of which factored suspected m53 here 2 composite numbers after that ... my computer is still crunching the sequence that is Last fiddled with by samuel on 2019-04-24 at 20:03 |
![]() |
![]() |
#5 |
AD616 Posts |
![]()
the formula is a recurrence relation on two arbirtary sequences and values are taken on this sequence every 5 terms
an=f(bn x g(cn)) where bn,cn are sequences and f,g are functions acting on these sequences. a1,a2,a3,a4,a5,a6,... then my mersenne prime generating sequence would be something like a2,a7,a12,a17,... |
![]() |
![]() |
#6 |
"Curtis"
Feb 2005
Riverside, CA
52×229 Posts |
![]()
Fun! Run a LL test on your candidates, and let us know how you did.
|
![]() |
![]() |
![]() |
#7 |
"Luke Richards"
Jan 2018
Birmingham, UK
25×32 Posts |
![]() |
![]() |
![]() |
![]() |
#8 | |
Jan 2019
Florida
35 Posts |
![]() Quote:
If your sequence contains Mersenne Prime as a subsequence and it's nothing trivial (i.e. N -> N), I'm sure you can write it up and submit it to journal of number theory at ams or elsevier, then I'm sure the rest of the math community can dissect this and come up with a proof of the legitimacy of this and goes from there, maybe even proving the conjecture. For the prize, test it on your exponent using prime95, depending on the moderness of your computer it takes like 1 day to half a year. If it turns out to be prime as you then you get the prize of (some dollar amount). Then you can take a step further and use the same formula to calculate a prime of >100m digits, then you get something even more (some other larger dollar amount). |
|
![]() |
![]() |
![]() |
#9 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
253118 Posts |
![]() |
![]() |
![]() |
![]() |
#11 |
34568 Posts |
![]()
lukerichards
What is PRP? I downloaded mprime but i do not know how to configure the program to test an exponent. |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Formula for complex harmonic progression | jrsousa2 | Miscellaneous Math | 4 | 2019-02-05 02:11 |
Unique Groupings found in the first 49 mersenne numbers | ONeil | ONeil | 27 | 2018-12-03 01:52 |
Is this new formula for Perfect Numbers useful? | mahbel | Miscellaneous Math | 20 | 2017-03-01 22:41 |
Basic Number Theory 10: complex numbers and Gaussian integers | Nick | Number Theory Discussion Group | 8 | 2016-12-07 01:16 |
formula for largest prime found | debasish | Miscellaneous Math | 20 | 2007-09-28 03:48 |