Combinations with repetitions/Square digit chain: Difference between revisions

Line 224:
end
return m
end
 
function uniquepermcount(a)
ret = factorial(length(a))
elems = unique(a)
for elem in elems
ret /= factorial(sum(x -> x == elem, a))
end
Int(ret)
end
 
Line 242 ⟶ 233:
continue
end
pcount = uniquepermcountInt(factorial(length(combo)) /
ret /= prod(y -> factorial(sum(x -> x == elemy, acombo)), unique(combo)))
if iterate(sum(combo)) == 89
eightyninecount += pcount
Line 276 ⟶ 268:
12024696404768024 numbers produce 1 and 87975303595231975 numbers produce 89.
</pre>
 
 
=={{header|Kotlin}}==
4,105

edits