Chernick's Carmichael numbers: Difference between revisions

m
→‎{{header|Perl 6}}: Simplify, tidy
(→‎{{header|Go}}: Added much faster version to deal with optional requirement.)
m (→‎{{header|Perl 6}}: Simplify, tidy)
Line 439:
use ntheory:from<Perl5> <:all>;
 
sub chernick-carmichael-factors ($n, $m) {
6*$m + 1, 12*$m + 1, |((1 .. $n-2).map: { (1 +< $_) * 9*$m + 1 } )
}
Line 445:
sub chernick-carmichael-number ($n) {
 
my $multiplier = 1 +< (($n-4) max 0);
my $iterator = $n < 5 ?? (1 .. *) !! (1 .. *).map: * * 5;
 
if$multiplier * $niterator.first: -> 4$m {
[&&] chernick-carmichael-factors($n, $m * $multiplier).map: { is_prime($_) #`[ .is-prime ] }
$multiplier = 1 +< ($n-4);
$iterator = (1..*).map: * * 5;
}
 
my $i = $iterator.first: -> $m {
[&&] chernick-carmichael-factors($n, $m * $multiplier).map: { is_prime($_) #`[ .is-prime ] }
}
 
chernick-carmichael-factors($n, $i * $multiplier)
 
}
 
for 3 .. 9 -> $n {
my @f$m = chernick-carmichael-number($n);
say "a($n): {[*]my @f} = {@f.joinchernick-factors('$n, ⨉ '$m)}";
say "U($n, $m): {[*] @f} = {@f.join(' ⨉ ')}";
}</lang>
{{out}}
<pre>aU(3, 1): 1729 = 7 ⨉ 13 ⨉ 19
aU(4, 1): 63973 = 7 ⨉ 13 ⨉ 19 ⨉ 37
aU(5, 380): 26641259752490421121 = 2281 ⨉ 4561 ⨉ 6841 ⨉ 13681 ⨉ 27361
aU(6, 380): 1457836374916028334162241 = 2281 ⨉ 4561 ⨉ 6841 ⨉ 13681 ⨉ 27361 ⨉ 54721
aU(7, 780320): 24541683183872873851606952966798288052977151461406721 = 4681921 ⨉ 9363841 ⨉ 14045761 ⨉ 28091521 ⨉ 56183041 ⨉ 112366081 ⨉ 224732161
aU(8, 950560): 53487697914261966820654105730041031613370337776541835775672321 = 5703361 ⨉ 11406721 ⨉ 17110081 ⨉ 34220161 ⨉ 68440321 ⨉ 136880641 ⨉ 273761281 ⨉ 547522561
aU(9, 950560): 58571442634534443082821160508299574798027946748324125518533225605795841 = 5703361 ⨉ 11406721 ⨉ 17110081 ⨉ 34220161 ⨉ 68440321 ⨉ 136880641 ⨉ 273761281 ⨉ 547522561 ⨉ 1095045121</pre>
</pre>
 
=={{header|Sidef}}==
10,339

edits