Sum of square and cube digits of an integer are primes: Difference between revisions
Sum of square and cube digits of an integer are primes (view source)
Revision as of 20:21, 18 June 2024
, 14 days agoAdded Easylang
m (→{{header|Wren}}: Changed to Wren S/H) |
(Added Easylang) |
||
Line 510:
</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
fastfunc digsum h .
while h > 0
sum += h mod 10
h = h div 10
.
return sum
.
fastfunc isprim num .
if num < 2
return 0
.
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
for i = 1 to 99
if isprim digsum (i * i) = 1 and isprim digsum (i * i * i) = 1
write i & " "
.
.
</syntaxhighlight>
{{out}}
<pre>
16 17 25 28 34 37 47 52 64
</pre>
=={{header|F_Sharp|F#}}==
| |||