![]() |
![]() |
#1 |
Feb 2004
France
3×311 Posts |
![]()
Hi,
I have the following conjecture about the Mersenne prime numbers, where: I've checked it up to q = 110503 (M29). I previously talked of this conjecture on Mersenne forum ; but I have now more experimental data. Conjecture (Reix): With A longer description with experimental data is available at: ConjectureOrder3Mersenne. Samuel Wagstaff was not aware of this conjecture and has no idea (yet) about how to prove it. I need a proof... Any idea ? Tony |
![]() |
![]() |
![]() |
#3 |
Feb 2004
France
3×311 Posts |
![]()
The conjecture is wrong.
David BroadHurst has found counter-examples. The "law of small numbers" has struck again... (but the numbers were not so small...). I've updated the paper and just conjectured that the highest power of 3 that divides the order of 3 mod M_q is 2. But it is not so much interesting... Never mind, we learn by knowing what's false too. Tony |
![]() |
![]() |
![]() |
#4 |
"Nancy"
Aug 2002
Alexandria
1001101000112 Posts |
![]()
Out of curiosity: what are the counter-examples?
Alex |
![]() |
![]() |
![]() |
#5 | |
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
136178 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 |
"Richard B. Woods"
Aug 2002
Wisconsin USA
22·3·641 Posts |
![]()
Tony,
May all your future numbers be large! ![]() |
![]() |
![]() |
![]() |
#8 |
Feb 2004
France
3·311 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Higher order Wierferich prime pairs | carpetpool | Miscellaneous Math | 2 | 2018-04-15 00:28 |
Factorial modulo a prime | axn | Computer Science & Computational Number Theory | 66 | 2011-09-01 21:55 |
square root modulo prime | Raman | Math | 1 | 2010-02-16 21:25 |
Conjecture about multiplicative order of 3 modulo a Mersenne prime | T.Rex | Math | 9 | 2007-03-26 17:35 |
Fast calculations modulo small mersenne primes like M61 | Dresdenboy | Programming | 10 | 2004-02-29 17:27 |