Kaprekar numbers: Difference between revisions
→{{header|Factor}}: rewrite (old version was deprecated)
m (→{{header|Sidef}}: code simplifications) |
(→{{header|Factor}}: rewrite (old version was deprecated)) |
||
Line 1,912:
=={{header|Factor}}==
This solution is based on the following Haskell code: [https://dev.to/heikodudzus/comment/1cl6].
<lang factor>USING:
math.
::
1 lfrom
[ 10 swap ^ ] lmap-lazy
[ n > ] lfilter
[ sqr swap mod n < ] lwhile
list>array
[ 1 - sqr n - swap mod zero? ] any?
n 1 = or ;
"Count of Kaprekar numbers <= 1,000,000: " write .</lang>
▲ 10000 [1,b) [ kaprekar? ] filter { 1 } prepend . ;
{{out}}
<pre>
Line 1,961 ⟶ 1,948:
7777
9999
...
851851
857143
961038
994708
999999
}
Count of Kaprekar numbers <= 1,000,000: 54
</pre>
|