20080918, 07:17  #1 
Feb 2004
France
2×457 Posts 
A Euro Reward for a proof
Hello,
I will give a 100Euro reward for the author of the first (mathematical !) proof of one of the conjectures I will provide in this thread. I invite other GIMPS addicts to participate and to also offer an amount of reward. I'm also looking for reviewers. I invite Bob Silverman to participate. It is required that he candidate proofs are written in LaTeX (or in any other Mathenabled tool) and that they will be provided as a post in this thread with a link to a .pdf paper. Or they can be sent to me by private email, so that I put them on my site. For sure, the winner will not be rich ! However, Maths students may be interested, for fame and glory. So, I ask Math teachers/searchers in this forum for talking of this to their students and to any Math journal or website. As you may know, these conjectures deal with LLT and cycles in a digraph under x^22 modulo a prime. Some of these conjectures are mine, or are Anton Vrba and mine, based on my work. My hope/goal is that, at the end, a new proof technique will emerge and will enable to build a faster proof, based on LLT cycles (instead of the tree) under x^22 modulo a Mersenne prime and thus in (q1)/n iterations, for saying that a Mersenne number is composite. Which will speed up the GIMPS project ! Look at this (not perfect, I know) paper for some information about the underlying facts I've found for Fermat and mainly Mersenne numbers. I perfectly know that, though all our experiments have shown that the conjectures say yes for known primes and no for composites, either there exist exceptions or there is no way to prove them (Gödel !). Now, go and work ! Regards, Tony Last fiddled with by T.Rex on 20080918 at 08:13 
20080918, 07:33  #2 
Feb 2004
France
914_{10} Posts 
Conjecture N°1 : A big q1 Cycle for Mersennes
Here is the first conjecture to prove:
A LLTlike test for Mersenne numbers, based on cycles of the Digraph under x^22 modulo a Mersenne prime. Happy guys, I've already done half the work ! You only have to prove the converse ! (which is the most difficult part, though...) . Look at my paper: First part of the proof. Tony Last fiddled with by T.Rex on 20080918 at 08:08 
20080918, 08:06  #3 
Feb 2004
France
2×457 Posts 
Conjecture N°2 : A Big q1 Cycle for Wagstaffs
Here is the second conjecture (by Anton Vrba and myself) to prove:
A LLTlike test for Wagstaff numbers, based on cycles of the Digraph under x^22 modulo a Wagstaff prime. This "VrbaReix PRP" conjecture for Wagstaff numbers has been tested (private communication) very high by Jean Penné by means of his new version 3.7.2 of his famous LLR tool based on Prime95 library v24, which now implements this "VrbaReix PRP" test. Tony Last fiddled with by T.Rex on 20080918 at 08:08 
20080918, 10:07  #4 
Feb 2004
France
2×457 Posts 
Conjecture N°3: A Big 2^n1 Cycle for Fermats
Here is the third conjecture (by Anton Vrba and myself) to prove:
A LLTlike test for Fermat numbers, based on cycles of the Digraph under x^22 modulo a Fermat prime. It is perfectly clear that such a test will not speed up proving F33 is prime or not (and programs like Mlucas or Prime95 are already ready to test it) ! But it could be a first step for speeding up a proof that F33 is not prime (I cannot wait for about 2025 !). Note that I already provided a proof that the LLT can be used for Fermat numbers and that the proof technic used for proving this theorem also proves the Pépin's test (see bottom of page 4 of this paper). Edouard Lucas already provided such a proof of LLT for Fermat numbers but, as usual, it was not a clear and complete proof. Maybe other people have built such a proof in the past, by I have found no paper about that. Tony Last fiddled with by akruppa on 20080921 at 14:23 Reason: fixed link 
20080918, 10:23  #5 
Feb 2004
France
1622_{8} Posts 
Some PARI/gp code for experimenting
For those wanting to see the conjectures at work, here is some simple PARI/gp code that exercises the 3 conjectures:
Code for conjecture about Mersennes: Code:
q=5;M=2^q1;S=Mod(3^2+1/3^2,M);print(S) for(i=1,q1,S=Mod(S^22,M);print(S)) Mod(3, 31) Mod(7, 31) Mod(16, 31) Mod(6, 31) Mod(3, 31) Code:
q=5;N=2^q+1;W=N/3;S=Mod(3/2,N);print(Mod(S,W)) for(i=1,q1,S=Mod(S^22,N);print(Mod(S,W))) Mod(7, 11) Mod(3, 11) Mod(7, 11) Mod(3, 11) Mod(7, 11) Code:
n=2;F=2^2^n+1;S=Mod(3/2,F);print(S) for(i=1,2^n1,S=Mod(S^22,F);print(S)) Mod(7, 17) Mod(13, 17) Mod(14, 17) Mod(7, 17) Tony 
20080918, 13:58  #6 
Feb 2004
France
2·457 Posts 
A common property
Note that we have the following properties:
Mersennes: Wagstaffs: Fermats: Tony 
20080918, 14:05  #7  
Nov 2003
2^{2}·5·373 Posts 
Quote:
General hint: Think 'analogue of Wilson's Theorem". What does one get when you multiply the elements of an Abelian group? Now ask "what group are we working in"? It is either the full twisted group [of GF(p^2)] or a subgroup of the same. Proving the conjectures amounts to showing that the starting element, S0 always has the correct order in this group. 

20080918, 14:22  #8  
Feb 2004
France
2×457 Posts 
Welcome to the game, Bob !
If there are proof proposals, would you mind contributing in reviewing them ? Quote:
Never mind, thanks to help ! Tony 

20080918, 14:25  #9 
Nov 2003
2^{2}·5·373 Posts 
I will try to find a proof. I am particularly intested in Conjecture 2.

20080918, 15:29  #10  
"Kyle"
Feb 2005
Somewhere near M52..
388_{16} Posts 
Quote:


20080918, 19:11  #11 
Feb 2004
France
2·457 Posts 
Thanks for your help, Bob and Primeinator !
You're welcome ! Primeinator, my Number Theory Math level is... very low. However, I bought and read (and read again, and again, and again...) several books, like the one of Paulo Ribenboim. I have some (limited !) knowledge, now. With some work, you can make terrific progress ! Bob, would you mind recommending some books to Primeinator ? Tony 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
UEFA Euro 2012, 2016  davieddy  Hobbies  68  20160711 17:07 
500€ Reward for a proof for the Wagstaff primality test conjecture  Tony Reix  Wagstaff PRP Search  7  20131010 01:23 
"Russ Feingold, American Terrorist": Russ's Reward for Bravery  cheesehead  Soap Box  4  20130317 13:43 
help with a proof  vtai  Math  12  20070628 15:34 
A Second Proof of FLT?  jinydu  Math  5  20050521 16:52 