Sum of square and cube digits of an integer are primes: Difference between revisions
Content added Content deleted
SqrtNegInf (talk | contribs) m (→{{header|Perl}}: note use of 'ntheory' module) |
m (julia example) |
||
| Line 81: | Line 81: | ||
next n</lang> |
next n</lang> |
||
{{out}}<pre>16 17 25 28 34 37 47 52 64</pre> |
{{out}}<pre>16 17 25 28 34 37 47 52 64</pre> |
||
=={{header|Julia}}== |
|||
<lang julia>using Primes |
|||
is_sqcubsumprime(n) = isprime(sum(digits(n*n))) && isprime(sum(digits(n*n*n))) |
|||
println(filter(is_sqcubsumprime, 1:100)) # [16, 17, 25, 28, 34, 37, 47, 52, 64] |
|||
</lang> |
|||
=={{header|Perl}}== |
=={{header|Perl}}== |
||