![]() |
|
|
#1 |
|
Jan 2014
2·19 Posts |
(That is, prime-exponent Mersenne numbers.)
I wonder if we shall hear about developments regarding the mentioned open problem (not necessarily in the near future). In any case, and in a hope to start a discussion about it, here are a few immediate (elementary) results if we assume a square divisor exists: Let p and q be odd primes s.t. (Not all properties below are unique to our assumption.) 1. It is known that 2. From this theorem: 3. Because Here are a couple of notes regarding the problem: http://cybrary.uwinnipeg.ca/people/d...e_numbers.html (which I haven't thoroughly looked at as of now) It goes without saying that the facts above won't get us anywhere
|
|
|
|
|
|
#2 | |
|
"Forget I exist"
Jul 2009
Dumbassville
26×131 Posts |
Quote:
|
|
|
|
|
|
|
#3 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
251616 Posts |
Because your statement contains a trivial arithmetic error.
Remove this error and the statement becomes vacuous: therefore nothing. |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Are Mersenne numbers really square? | JM Montolio A | Miscellaneous Math | 23 | 2018-03-08 14:24 |
| Square Riesel numbers < 3896845303873881175159314620808887046066972469809^2 | Citrix | Math | 8 | 2017-04-10 10:50 |
| square free Mersenne Numbers? | kurtulmehtap | Math | 0 | 2012-09-17 13:04 |
| Finding the square root of a large mersenne number | Fusion_power | Math | 29 | 2010-10-14 17:05 |
| Square numbers and binary representation | ET_ | Miscellaneous Math | 40 | 2010-06-06 12:55 |