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 08:06, 1 May 2023
, 1 year ago→{{header|jq}}: jaq
(→{{header|jq}}: jaq) |
|||
Line 1,535:
Some useful filters, but nothing fancy here.
With a few minor tweaks, notably replacing `sqrt` with `isqrt` (see e.g. [[Isqrt_(integer_square_root)_of_X#jq]]),
the following program also works with jaq, the Rust implementation of jq.
<syntaxhighlight lang=jq>
# Input: an integral decimal number
| |||