Primes whose sum of digits is 25: Difference between revisions
Content added Content deleted
m (→Stretch goal: added personal tag and pwa/p2js comment) |
|||
Line 1,930: | Line 1,930: | ||
done... |
done... |
||
</pre> |
</pre> |
||
=={{header|Ruby}}== |
|||
<lang ruby>require 'prime' |
|||
def digitSum(n) |
|||
sum = 0 |
|||
while n > 0 |
|||
sum += n % 10 |
|||
n /= 10 |
|||
end |
|||
return sum |
|||
end |
|||
for p in Prime.take_while { |p| p < 5000 } |
|||
if digitSum(p) == 25 then |
|||
print p, " " |
|||
end |
|||
end</lang> |
|||
{{out}} |
|||
<pre>997 1699 1789 1879 1987 2689 2797 2887 3499 3697 3769 3877 3967 4597 4759 4957 4993 </pre> |
|||
=={{header|Tcl}}== |
=={{header|Tcl}}== |