Results 21 to 27 of 27
Thread: crunching large numbers
 11202009, 01:59 AM #21
 11202009, 04:08 AM #22
 Join Date
 Jul 2007
 Location
 Colombo, Sri Lanka
 Posts
 11,370
 Blog Entries
 1
 Rep Power
 21
 11202009, 04:13 AM #23
 Join Date
 Jul 2007
 Location
 Colombo, Sri Lanka
 Posts
 11,370
 Blog Entries
 1
 Rep Power
 21
In most of the cases calculating such a large numbers (specially related with physics theory and so on), the calculating algorithm make a big difference some times. I've that experience when I'm at University. One of professors shows us two ways to calculate the thickness of a human hair. Two ways use, one method take three days to calculate and the other method take couple of seconds to calculate. Actually it's bit complex, but use of different algorithms solve the problem.
Just adding something I've experienced.
 11202009, 06:34 AM #24
I haven't spent a dime and I have verifiable code,the above posted code,(but only mersenne right now) it will be at least 2 years though but i want to start a seperate project of passing remainders because I believe the first 100 million digit number that is prime has a 1... allot of zeroes and the last 3 digits are less than 121... but to be verified it has to be tested with all primes up to 5 million digits but I have an idea where each person handles 10,000 digits and the leader passes his remainders to computer 2 ,3,etc. If I could get 100 java progammers to sign up for the task we would all get $1,500 for finding it. it would take organization though...and even if gimps found it first we would be recognized for implementing a different type of verification system
I have done an initial test of verifying primes up to 18 digits starting with 1,000,000.... and alot of the first primes in the first set of however many digits end in 33 39 67 etc...
I need people with spare pc's that are off the internet and don't restart. or we can create methods to save data for restart but I need serious math junkies and java programmers and I believe it is possible
gimps is only testing mersenne primes which are far apart (only 43 known)...because the lucas test is fastest. But I think a group of us could at least find the largest non mersenne prime with this remainder passing idea that I have...It is a little more complicated than that though...so let me know if you are interested in frying up your cpu :)Last edited by aaroncarpet; 11202009 at 06:56 AM.
 11212009, 04:49 PM #25
 Join Date
 Jul 2007
 Location
 Colombo, Sri Lanka
 Posts
 11,370
 Blog Entries
 1
 Rep Power
 21
If you can do a simple survey among experienced programmers, no need to specific on Java, and let them your task/logic. Nowadays you can find lots of free surveys on the web. Those comments can be really helpful to you.
 11292009, 06:15 PM #26Senior Member
 Join Date
 Nov 2009
 Posts
 150
 Rep Power
 7
do you know that the biginteger class in java has a function for finding primes?
 11302009, 03:10 AM #27
Similar Threads

Getting rid of commas in large numbers?
By wwuster in forum Advanced JavaReplies: 12Last Post: 03052012, 11:35 AM 
Large data over RMI
By JavaDesigner in forum New To JavaReplies: 7Last Post: 10162009, 08:48 PM 
Draw Large Images
By Sreekanth.m in forum Java 2DReplies: 1Last Post: 09082009, 04:53 PM 
Reading large XML
By gkumar in forum XMLReplies: 3Last Post: 08062009, 04:38 AM 
printing two smallest numbers from a series of numbers
By trofyscarz in forum New To JavaReplies: 2Last Post: 10142008, 11:46 PM
Bookmarks