![]() |
Alex, I think naïvely that a jury will do the difference between a result obtained by a logic method (with proof) and a result obtained by a random method (qui s'en remet au seul hasard). Is'nt true ?
Alain |
They certainly will. From everything I have seen so far, your method is purely random.
Alex |
[QUOTE=akruppa;105827]They certainly will. From everything I have seen so far, your method is purely random.[/QUOTE]
It may not *be* random, but certainly seems "no better than random." |
[QUOTE=Uncwilly;105721]An update:
3) finish with an odd number (other than 5) 3.5) check and make sure that the number is being tested. :crank: :raman: :party:[/QUOTE] I stand corrected :blush: :blush: , it seems like my algortim will fail in 1 out of 5 :grin: -Eivind |
No, only my process of reading seems to be "random". But it comes from the difficulties to applicate rules that are not "hasardeuses".
For example, the interval I have given in my last post is real. You can calculate it easily. Idem, I can propose such an interval for all the mersenne's numbers of the list, from the beginning. Alain |
Just post the damn method! If it's even possible that it could get rid of possible candidates, someone will say so.
|
Alain,
Either you post your method or you buy some computers and use them and your method to find M45. Tony |
OK
OK, I'am a little tired.
You can consult the famous method (for some hours) at this address : [URL]http://home.tele2.fr/lacanmaths/peremersenne.html[/URL] I avise George Woltman of this post I am waiting your reactions Alain |
Sorry if this approach prove to be wrong.
Alain |
Proth-Gilbreath's conjecture
OK. Why not.
Here are some references for the Proth-Gilbreath's conjecture: [URL="http://mathworld.wolfram.com/GilbreathsConjecture.html"]MathWorld[/URL] [URL="http://primes.utm.edu/glossary/page.php?sort=GilbreathsConjecture"]PrimeGlossary[/URL] You have a method for computing, but I see no explaination about why this calculus should give the exponent of M45 ... Too late now. I'll see tomorrow. T. |
Umm... are you trying to invert Gilbreath's conjecture by starting with a list of absolute differences of all 1s, then adding them up in different ways hoping that a prime appears after 45 steps? And even if a prime appears, what is there to suggest that that is the exponent of the 45th Mersenne prime? However, I can't say I really understand the explanation on your web page. Can you give a small example, step by step, how your method can be used to discover the 13th Mersenne prime, M521?
Alex |
| All times are UTC. The time now is 08:55. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.