June 2018 Update
This commit is contained in:
parent
ba8067c3b7
commit
22f33d4004
5278 changed files with 84726 additions and 14379 deletions
|
|
@ -1,19 +1,18 @@
|
|||
require('ntheory')
|
||||
var kap = Hash()
|
||||
|
||||
for n (1..15) {
|
||||
for n in (1..15) {
|
||||
var np = (10**n - 1)
|
||||
%S<ntheory>.fordivisors({ |d|
|
||||
var dp = np//d
|
||||
if ((d `gcd` dp) == 1) {
|
||||
np.divisors.each { |d|
|
||||
var dp = np/d
|
||||
if (is_coprime(dp, d)) {
|
||||
kap{ dp == 1 ? d : d*invmod(d, dp) } := 0 ++
|
||||
}
|
||||
}, np)
|
||||
}
|
||||
}
|
||||
|
||||
var nums = kap.keys.map{.to_n}.sort
|
||||
var nums = kap.keys.map{ Num(_) }.sort
|
||||
|
||||
for n (6 .. 14) {
|
||||
for n in (6 .. 14) {
|
||||
var np = (10**n - 1)
|
||||
printf("Kaprekar numbers <= 10^%2d: %5d\n", n, nums.count_by { .<= np })
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue