17 lines
440 B
Text
17 lines
440 B
Text
function isPrime(n)
|
|
if n < 2 then isPrime = 0 : goto [exit]
|
|
if n = 2 then isPrime = 1 : goto [exit]
|
|
if n mod 2 = 0 then isPrime = 0 : goto [exit]
|
|
isPrime = 1
|
|
for i = 3 to int(n^.5) step 2
|
|
if n mod i = 0 then isPrime = 0 : goto [exit]
|
|
next i
|
|
[exit]
|
|
end function
|
|
|
|
e = 0.5772156
|
|
|
|
for x = 2 to 100000 ' more prime numbers do not add more precision
|
|
if isPrime(x) then m = m + log(1-(1/x)) + (1/x)
|
|
next x
|
|
print "MM = "; e + m
|