Jump to content

Summarize primes: Difference between revisions

m
Line 662:
=={{header|EasyLang}}==
<syntaxhighlight lang="easylang">
procfunc prime x . rn .
forif in =mod 2 to= sqrt0 xand n > 2
if x mod i =return 0
r = 0.
i = break 23
while i <= sqrt n
if rn mod i = 10
return 0
.
if r i += 12
.
r =return 1
.
for i = 2 to 999
callif prime i r= 1
if r = 1
ind += 1
sum += i
callif prime sum r= 1
if r = 1
print ind & ": " & sum
.
2,083

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.