Rare numbers: Difference between revisions
m
→advanced
m (→advanced) |
|||
Line 1,184:
-- (see allTerms below)
integer nd, -- number of digits
count -- of solutions found earlier, for
sequence rares -- (cleared after sorting/printing for each nd)
Line 1,204:
int_to_bits(#02020212,32) -- in 32/64-bit compatible way.
function isSquare(atom n) -- determine if n is a perfect square or not
if psq[and_bits(n,63)+1] then
atom r = floor(sqrt(n))
Line 1,249:
end procedure
procedure fnmr(sequence terms, list, candidates, indices, fml, dmd, integer level)
-- generate (n-r) candidates with a given number of digits.
| |||