![]() |
|
|
#1 |
|
Jun 2019
2×17 Posts |
Let Mersenne number 2n -1 if 2n -1 composite 2n -1 = n2xy + (x+y)n + 1 so 2n /n = (n2xy + (x+y)n) /n = nxy+x+y Finding the x and y we can factor the number into a product (nx)+1 and (ny)+1 example 211-1 = 2047 (2047-1) /2= 186 186 = nxy+x+y = 11* 8*2 + 8+2 X= 8 Y=2 and 2047 = (88+1)*(22+1) Difficulty and complexity (nxy+x+y) like a Diophantine equation Are there any solutions? sory for my english |
|
|
|
|
|
#2 |
|
"Viliam Furík"
Jul 2018
Martin, Slovakia
2×401 Posts |
I would like to point out a few mistakes.
1. (2^n) is never divisible by (n), (2^n-2) is divisible by (n), when (n) is prime (btw, it is because of Little Fermat theorem) 2. (2047-1) /2= 186; you probably meant (2047-1)/11 = 186. Apart from these typos, I guess I will leave the topic for other guys. |
|
|
|
|
|
#3 | |
|
Jun 2019
2×17 Posts |
Quote:
Last fiddled with by baih on 2020-08-20 at 22:29 |
|
|
|
|
|
|
#4 |
|
"Serge"
Mar 2008
San Diego, Calif.
1026910 Posts |
Please demonstrate the power of this method on a tiny number 2^1277-1.
it is composite. Show us. |
|
|
|
|
|
#5 | |
|
Jun 2019
2·17 Posts |
Quote:
The difficulty is the same as the difficulty of (Trial division) But it may help in some cases If someone found a solution to the equation c=nxy+x+y Last fiddled with by baih on 2020-08-21 at 01:17 |
|
|
|
|
|
|
#6 |
|
Mar 2019
23×32×5 Posts |
|
|
|
|
|
|
#7 | |
|
"Rashid Naimi"
Oct 2015
Remote to Here/There
239810 Posts |
Quote:
The problem is you need brute-force (trying different integers for a solution) and the combinations are astronomically large. You might have some fun with Wolfram-Alpha: https://www.wolframalpha.com/input/?...er+the+integer https://www.wolframalpha.com/input/?...er+the+integer Good luck, try expanding the concept. You might get something interesting or at worst expand your thinking-power in the process. |
|
|
|
|
|
|
#8 |
|
Romulan Interpreter
"name field"
Jun 2011
Thailand
41×251 Posts |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Phantom factorization - subcubic factorization of integers? | Alberico Lepore | Alberico Lepore | 1 | 2020-05-27 12:20 |
| MEGAPOST apps to compute mersenne primes, factorization and computing decimals of pi on android | thorken | Software | 53 | 2019-01-29 15:34 |
| New Mersenne Software For Test Mersenne Prime Numbers On Android | thorken | Software | 66 | 2019-01-13 21:08 |
| Mersenne(prime exponents) factorization | science_man_88 | Miscellaneous Math | 3 | 2010-10-13 14:32 |
| Mersenne Wiki: Improving the mersenne primes web site by FOSS methods | optim | PrimeNet | 13 | 2004-07-09 13:51 |