Mersenne: Java factoring
I decided to test java perfomance. Doing what? Well, why not to try mersenne factoring. OK, said - done. Do you think java mersenne factoring is 1,000 times slower then native factoring? Or even 10,000 times? Or you are supposing it's 1,000,000 times slower? No! Java works quite fast. You can [try to ;-(] find my applet via http://www2.crosswinds.net/russia/~aga/jFactor.html and figure out yourself if java fast or slow - doing REAL work. Don't forget to turn JIT on before running my applet ;-) P.S. After some improvements I think that applet could be nice way to introduce how distributed tasks works. Walking to a friend you don't need to prepare last version of some program on diskette, then spend time configuring it. Just open corresponding www page with my applet. That's all demo you need to explain your friend why he should join the search ;-)
Mersenne: Factoring
Ok, George's programs looks for only for factors of M(n) in form 1) 2kn+1 that's clear why 2) 1,7,17,23,31,41,47,49,71,73,79,89,97,103,113,or 119 modulo 120 but this is not. Why factors 120k+13 are not considered? Or 120k+19? Why only those 16 reminders of ~30 primes below 120?
Re: Mersenne: Mathematics of Computation, January 1994
On Thu, 01 Oct 1998 10:40:55 +1000, Simon Burge wrote: >On Wed, 30 Sep 1998 14:40:59 +0100 Nico Sterk wrote: > >> Hello, I am trying to find the contents of the article about FFT for >> multiplying very large integers in Mathematics of Computation, January >> 1994. Take a look at http://www.ul.cs.cmu.edu/books/numerical_recipes/bookcpdf.html. 20.6 is seems exactly about what you want to know.
