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 11:16, 17 April 2024
, 1 month ago→{{header|EasyLang}}
(Added Easylang) |
|||
Line 695:
.
proc find b . .
n = floor pow b ((b - 1) div 2)
repeat
sq = n * n
|