First perfect square in base n with n unique digits: Difference between revisions
First perfect square in base n with n unique digits (view source)
Revision as of 10:05, 21 May 2019
, 5 years ago→{{header|Perl 6}}: tweak
(Added Go) |
Thundergnat (talk | contribs) m (→{{header|Perl 6}}: tweak) |
||
Line 125:
sub first-square (Int $n) {
my $start = (($n - 1)/2).exp($n).floor || 1;
my $sq = ($start .. *).map( *² ).hyper.first: *.base($n).comb.
sprintf "Base %2d: %10s² == %s", $n, $sq.sqrt.base($n), $sq.base($n);
}
|