| Fermat’s lost algorithm? -
07-14-2008, 02:18 PM
Fermat was presented by a correspondent with this number 100895598169 and was asked whether it is a prime number. He quickly replied that it is composite and its prime factors are 898423 and 112303. To this day, nobody knows how he did it even more amazing is the fact that this was done when there are no supercomputers. The speculation that he had a secret method of factorization and since lost could now be said that it has been rediscovered. In addition, this algorithm can also provide algorithmic proof for Goldbach conjecture.
Time independence: [∂E(g)]²=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: ¶a(t)·¶r(t)=c²
| 
Linear Mode
