Re: Re: [math-fun] Add no digit of n to n

10 Dec 2006


      Paul R. Pudaite <pudaite@pipeline.com> wrote:
...
For binary numbers, the sequence has one term (no iterations):  1.  :)
Hmm, good point:

2   1
3   12
4   132
5   1324
6   12543
7   123546
8   1234576
9   12345876
10  123456978, as before; this is the first one that takes significant
time to compute.

f[x_,b_] := x +
Module[{y=Complement[Range[b-1],IntegerDigits[x,b]]},If[Length[y]>0,Min[y],0]]

g[b_] := Print @@ IntegerDigits[FixedPoint[f[#,b]&,1], b]

--Michael Kleber

-- 
It is very dark and after 2000.
If you continue you are likely to be eaten by a bleen.