Rem Find the sum of all the primes below two million (Project Euler 10)

flag=0

sum=2

print 2+"....Sum="+sum

for h= 2 to 2000000

flag=0

i=1

while flag=0 and i < h^(1/2)

i=i+1

if int(h/i)=h/i then flag=1

end while

if flag=0 then

sum=sum+h

print (h)+"....Sum="+sum

end if

next h

## Wednesday, December 8, 2010

Subscribe to:
Post Comments (Atom)

## No comments:

## Post a Comment