looking for java programmers interested in testing code
i am using my own java program to find huge mersenne primes (for example 2^62,000,000 power - 1) with the lucas lehmer test ...if you have a spare pc and are interested in the .java file and want to help tweak it let me know I will thoughroly comment the code so you can modify it and test it with smaller verfiable mersenne primes.
Learning the ways of the forum
my understanding is that I need to post more on other peoples threads then? I didn't use "urgent"
no one will run this because of runtime
It takes months to verify primes of 40 million digits plus because you have to use big integer(not primitive type)....and if the computer restarts you are SOL but i created a method to capture mid testing data but i need to create another method to read it from a file because the string is too long at compile time...