Composite numbers k with no single digit factors whose factors are all substrings of k: Difference between revisions
Content added Content deleted
m (→{{header|Phix}}: use gcd() (no faster just neater)) |
SqrtNegInf (talk | contribs) (Added Perl) |
||
Line 34: | Line 34: | ||
5526173 11610313 13436683 13731373 13737841 13831103 15813251 17692313 19173071 28118827 |
5526173 11610313 13436683 13731373 13737841 13831103 15813251 17692313 19173071 28118827 |
||
</pre> |
</pre> |
||
=={{header|Perl}}== |
|||
{{trans|Raku}} |
|||
{{libheader|ntheory}} |
|||
<lang perl> use strict; |
|||
use warnings; |
|||
use ntheory qw<is_prime factor gcd>; |
|||
my($values,$cnt); |
|||
LOOP: for (my $k = 11; $k < 1E10; $k += 2) { |
|||
next if 1 < gcd($k,2*3*5*7) or is_prime $k; |
|||
map { next if index($k, $_) < 0 } factor $k; |
|||
$values .= sprintf "%10d", $k; |
|||
last LOOP if ++$cnt == 20; |
|||
} |
|||
print $values =~ s/.{1,100}\K/\n/gr;</lang> |
|||
{{out}} |
|||
<pre> 15317 59177 83731 119911 183347 192413 1819231 2111317 2237411 3129361 |
|||
5526173 11610313 13436683 13731373 13737841 13831103 15813251 17692313 19173071 28118827</pre> |
|||
=={{header|Phix}}== |
=={{header|Phix}}== |