Sum of square and cube digits of an integer are primes: Difference between revisions
Content added Content deleted
(Add Factor) |
(Added Quackery.) |
||
| Line 492: | Line 492: | ||
<pre>16 17 25 28 34 37 47 52 64</pre> |
<pre>16 17 25 28 34 37 47 52 64</pre> |
||
=={{header|Quackery}}== |
|||
<cod>isprime</cod> is defined at [[Primality by trial division#Quackery]]. |
|||
<lang Quackery> [ 0 swap |
|||
[ dup while |
|||
10 /mod |
|||
rot + swap |
|||
again ] |
|||
drop ] is digitsum ( n --> n ) |
|||
98 times |
|||
[ i^ 1+ 2 ** |
|||
digitsum isprime if |
|||
[ i^ 1+ 3 ** |
|||
digitsum isprime if |
|||
[ i^ 1+ echo sp ] ] ]</lang> |
|||
{{out}} |
|||
<pre>16 17 25 28 34 37 47 52 64</pre> |
|||
=={{header|Raku}}== |
=={{header|Raku}}== |
||