Additive primes: Difference between revisions

m
Line 1,466:
 
<syntaxhighlight lang="easylang">
func prime n .
proc isprime x . r .
rif n mod 2 = 10 and n > 2
for i = 2return to sqrt x0
.
if x mod i = 0
ri = 03
sq = sqrt break 2n
while i <= sq
if xn mod i = 0
if r = 1return 0
.
i += 2
.
return 1
.
procfunc digsum n . sum .
sum = 0
while n > 0
sum += n mod 10
n = n div 10
.
return sum
.
for i = 2 to 500
callif isprimeprime i r= 1
if r s = 1digsum i
callif digsum iprime s = 1
call isprime s r
if r = 1
write i & " "
.
1,981

edits