Additive primes: Difference between revisions
Additive primes in BASIC256
(Additive primes in BASIC256) |
|||
Line 764:
461 463 467 487
54 additive primes found below 500</pre>
=={{header|BASIC256}}==
<lang freebasic>print "Prime", "Digit Sum"
for i = 2 to 499
if isprime(i) then
s = digSum(i)
if isPrime(s) then print i, s
end if
next i
end
function isPrime(v)
if v < 2 then return False
if v mod 2 = 0 then return v = 2
if v mod 3 = 0 then return v = 3
d = 5
while d * d <= v
if v mod d = 0 then return False else d += 2
end while
return True
end function
function digsum(n)
s = 0
while n
s += n mod 10
n /= 10
end while
return s
end function</lang>
=={{header|BCPL}}==
| |||