Quote:
Originally Posted by AntonioLao  Thanks. What I can provide might be Fermat's last algorithm on primes factorization. For the calculation check out on the TI-84 up to 8-digit numbers. I would like to test the same in a supercomuter and maybe compare to others. As a bonus, I can also throw in the algorithmic proof for Goldbach conjecture. Maybe you and me can share the millennium prize when this algorithm is accepted as the correct one for also proving Riemann Hypothesis. |
Thank you, Antonio, for sharing the Million Dollar Prize with me with the entire ToeQuest team as our witness.
I accept your offer at a minimum of 25%, preferably 50% of the prize.
And you, do you accept under same conditions?
P.S. What do you think of Louis de Branges de Bourcia (University of Purdue)'s attempt of solving the Hypothesis?
http://www.math.purdue.edu/~branges/site