Search:

How, cannot understand you :( writte som code pls.

I think like that its more slow!:(

while (n < MAX) {
divisible = FALSE;
for (i = 0; (i < sqrt(n)) && !divisible; i++)
divisible = ((candidat % p[i]) == 0);


Is it that ?

i don't have the level, could some one help me please ? if I don't do it, its for something.
Thanks anyway...

Could you please show me the code by using the sqrt ? thx.

Yes!!. I noticed something about you can stop by getting the sqrt of the numer. help me please :D

on a AMD Athlon64 3200 works in 1 sec :)

yes, but I don't wanna use another theorem,.. I wanna stay to Erant.
anyway i don't have the level

The program calculates the prime numbers with the Sieve of Eratosthenes. And now im asking how could I improve the program ? Any modification would be welcome!! thanks a lot. :cool:



...