Jump to content

Kaprekar numbers: Difference between revisions

m
→‎{{header|Sidef}}: code simplifications
(Added Erlang version)
m (→‎{{header|Sidef}}: code simplifications)
Line 4,363:
=={{header|Sidef}}==
{{trans|Perl}}
<lang ruby>requirevar kap = Hash('ntheory')
var kap = Hash()
 
for n in (1..15) {
var np = (10**n - 1)
%S<ntheory>np.fordivisors(divisors.each { |d|
var dp = np//d
if (is_coprime(dp, d `gcd` dp) == 1) {
kap{ dp == 1 ? d : d*invmod(d, dp) } := 0 ++
}
}, np)
}
 
var nums = kap.keys.map{.to_n Num(_) }.sort
 
for n in (6 .. 14) {
var np = (10**n - 1)
printf("Kaprekar numbers <= 10^%2d: %5d\n", n, nums.count_by { .<= np })
2,747

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.