2006-07-16, 13:57 | #1 |
May 2006
29 Posts |
mersenne analysis
Please, look into the attached file.
Y.s. |
2006-07-16, 14:40 | #2 |
Feb 2004
France
1110101001_{2} Posts |
I do not see anything new.
Please do not attach .doc or .doc.zip files. Just write in the forum. T. |
2006-07-17, 03:18 | #3 |
Aug 2003
Snicker, AL
2^{6}·3·5 Posts |
Your work is thought out pretty well but as Tony says, it does not seem to be anything new. Please take a look at this webpage and see how it relates.
http://primes.utm.edu/notes/proofs/MerDiv.html Fusion P.S. The underlying failure of your method is that it does not take into account the tremendous number of possible factors in for example a 10 million digit number. Do the math. Work out the decimal expression of a 10 million digit number and then figure out how many possible factors exist based on your method. Now figure out how long it will take to test all the possible factors. Last fiddled with by Fusion_power on 2006-07-17 at 03:26 |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
CLOCK_WATCHDOG_TIMEOUT (101) analysis | TObject | Software | 4 | 2013-02-05 23:53 |
Dimensional analysis | davieddy | Puzzles | 9 | 2011-08-02 09:59 |
Knuth-Schroeppel analysis | akruppa | Factoring | 8 | 2010-01-08 17:01 |
Analysis puzzle | Kees | Puzzles | 19 | 2007-04-12 14:47 |
Tensor Analysis books | Damian | Math | 14 | 2006-12-25 21:58 |