N
Neil Morris
Dear All
I rang the following code for finding prime numbers the results I got
for my computer is
105097565 prime numbers
2147483629 being the highest
13:31:14 taken 13 hours 31 minutes and 14 seconds
can anyone beat this on a computer, also how does this compare to a
mainframe/server farm setup
Thanks in advance
Neil Morris
ps I am using intek QX9650 4gb ram
import java.lang.*;
public class prime {
public static void main(String[] args) {
double start=(double)System.currentTimeMillis();
int input=Integer.MAX_VALUE;
int count=1;
for(int number=1;number<input;number++) {
boolean prime=true;
for(int i=2;(i*i>0)&&(i*i<=number);i++) {
if (number%i==0) {
prime=false;
break;
}
}
if(prime) {
double next=(double)System.currentTimeMillis();
double diff=(next-start)/1000;
double days=Math.floor(diff/86400);
diff=diff-(days*86400);
double hours=Math.floor(diff/3600);
diff=diff-(hours*3600);
double minutes=Math.floor(diff/60);
double seconds=diff-(minutes*60);
System.out.println(count+") "+number+"
:"+(long)days+":"+(long)hours+":"+(long)minutes+":"+(long)seconds+":");
count++;
}
}
}
}
I rang the following code for finding prime numbers the results I got
for my computer is
105097565 prime numbers
2147483629 being the highest
13:31:14 taken 13 hours 31 minutes and 14 seconds
can anyone beat this on a computer, also how does this compare to a
mainframe/server farm setup
Thanks in advance
Neil Morris
ps I am using intek QX9650 4gb ram
import java.lang.*;
public class prime {
public static void main(String[] args) {
double start=(double)System.currentTimeMillis();
int input=Integer.MAX_VALUE;
int count=1;
for(int number=1;number<input;number++) {
boolean prime=true;
for(int i=2;(i*i>0)&&(i*i<=number);i++) {
if (number%i==0) {
prime=false;
break;
}
}
if(prime) {
double next=(double)System.currentTimeMillis();
double diff=(next-start)/1000;
double days=Math.floor(diff/86400);
diff=diff-(days*86400);
double hours=Math.floor(diff/3600);
diff=diff-(hours*3600);
double minutes=Math.floor(diff/60);
double seconds=diff-(minutes*60);
System.out.println(count+") "+number+"
:"+(long)days+":"+(long)hours+":"+(long)minutes+":"+(long)seconds+":");
count++;
}
}
}
}