Sum of square and cube digits of an integer are primes: Difference between revisions
Content added Content deleted
(Clarified task description and added an example.) |
|||
Line 48: | Line 48: | ||
[1..99]|>List.filter(fun g->isPrime(fN 0 (g*g)) && isPrime(fN 0 (g*g*g)))|>List.iter(printf "%d "); printfn "" |
[1..99]|>List.filter(fun g->isPrime(fN 0 (g*g)) && isPrime(fN 0 (g*g*g)))|>List.iter(printf "%d "); printfn "" |
||
</lang> |
</lang> |
||
{{out}} |
|||
<pre> |
|||
16 17 25 28 34 37 47 52 64 |
|||
</pre> |
|||
=={{header|Perl}}== |
|||
<lang perl>#!/usr/bin/perl |
|||
use strict; # https://rosettacode.org/wiki/Sum_of_square_and_cube_digits_of_an_integer_are_primes |
|||
use warnings; |
|||
use ntheory qw( is_prime vecsum ); |
|||
my @results = grep |
|||
is_prime( vecsum( split //, $_ ** 2 ) ) && |
|||
is_prime( vecsum( split //, $_ ** 3 ) ), 1 .. 100; |
|||
print "@results\n";</lang> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |