f ( x ) g ( x ) h 1 ( x ) h n ( x ) = = = = 1 0 1 0 x lo g 1 0 ( 1 0 x ) g ( f ( x ) ) h 1 ( h n − 1 ( x ) )
Denote the set functions above. Evaluate the sum of digits of h 2 0 1 1 ( 1 ) .
Note - This is not original. Adapted from a Math contest.
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.
BTW @Krishna Ar , this was from which math contest ?
Log in to reply
Some AMC :P ...I think AMC 10..I felt its level was bit high for it , thus posted it! :D
Log in to reply
Whose level was high for AMC ? This problem ? You sure ?
Log in to reply
@Aditya Raut – Yeah! Me sure-You think this is easy? Yes, I solved it. But the composition of triple functions confuses many!!!!!!!!
Log in to reply
@Krishna Ar – Use \log in stead of log, because \log is a valid LaTeX code.
\begin{array}{|c||c|} \textbf{Input} & \textbf{Output}\\ \hline \\ \text{log} & log\\ \text{\log} & \log \\ \text{log\_10} & log_10\\ \text{\log\_{10}} & \log_{10}\\ \end{array}
Log in to reply
@Aditya Raut – Okay, thanks sure :). BTW, I have a few questions to ask you? When could I?
I found h n = 1 0 n − p ( n ) where p ( n ) is 1111111...n times.
the digital sum of 16089 is 6 right??(1+6+0+8+9=24,2+4=6)
Log in to reply
No no, it means sum of digits. Not the final single digit answer. I've edited that as a moderator...
h_(n) (x) =10^n x - (n-1)1's. Thus, for n = 2011 => 10^2011 - (2011)1's = (2010)8's and last a 9. Thus, 2010 8 +9 =16089
Problem Loading...
Note Loading...
Set Loading...
h 1 ( x ) = g ( f ( x ) ) = lo g ( 1 0 f ( x ) ) = lo g ( 1 0 1 0 1 0 x ) = 1 0 x − 1
Thus, we have h 1 ( x ) = 1 0 x − 1 , and as h n = h 1 ( h n − 1 ( x ) ) , we have
h n = 1 0 × h n − 1 ( x ) − 1
Thus we have a recurrence, so now, we'll substitute the value of x as 1 .
h 1 ( 1 ) = 1 0 − 1 = 9 . Hence we have a recursive formula as
a n = 1 0 a n − 1 − 1 with given that a 1 = 9 . (Here a n = h n ( 1 ) )
Computing the terms, simply, we have
a 1 = 1 0 × 1 − 1 = 9 a 2 = 1 0 × 9 − 1 = 8 9 a 3 = 1 0 × 8 9 − 1 = 8 8 9 a 4 = 1 0 × 8 8 9 − 1 = 8 8 8 9 . . . . . . . .
Now observe that a n is simply a n − d i g i t number, which has last digit 9 and all other digits are 8 .
Hereby, we conclude that a 2 0 1 1 = h 2 0 1 1 ( 1 ) = 2010 times digit ’8’ 8 8 8 . . . . . 8 8 8 9
Hence digit sum is 2 0 1 0 × 8 + 9 = 1 6 0 8 0 + 9 = 1 6 0 8 9