Let and equal the number of digits and the number of unique digits in the base representation of , respectively.
Let .
Let equal the smallest positive integer such that .
Given , it can be shown that for all integers above some value, , where and are constants.
Find the sum of the digits of ( represented in base ).
Examples
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let us consider a number g , and try to find out r β ( g ) . First note that f β ( r β ( g ) ) = g ⟹ a β + b β = g . If g ≥ 2 β , then, note that, since b β ≤ β , and a β ≥ b β , the only possible solution is b β = β , a β = g − β . Then, we have r β ( g ) = β g − β ⋅ 1 + β g − β − 1 ⋅ 0 + β g − β − 2 ⋅ 1 + β g − β − 3 ⋅ 2 + ⋯ + β 0 ⋅ ( β − 1 ) , i.e. κ β = β , λ β = β g − β − 2 ⋅ 1 + β g − β − 3 ⋅ 2 + ⋯ + β 0 ⋅ ( β − 1 ) . Thus, the required answer is ∑ i = 2 β − 1 i = ( 2 β ) − 1 = ( 2 1 0 0 ) − 1 = 4 9 4 9 .