Let f ( x ) = 1 0 1 0 x , g ( x ) = lo g 1 0 ( 1 0 x ) , h 1 ( x ) = g ( f ( x ) ) , and h n = h 1 ( h n − 1 ( x ) ) for integers n ≥ 2 . The sum of the digits of h 2 0 1 1 ( 1 ) is a 5-digit multiple of 173 and can be written in the form 1 7 3 Q . What is the value of Q ?
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.
h 1 ( x ) = lo g 1 0 ( 1 0 1 0 1 0 x ) = 1 0 x − 1 ,so h 1 ( 1 ) = 9 , h 2 ( 1 ) = 8 9 , h 3 ( 1 ) = 8 8 9 , . . . , h n ( 1 ) = Number of 8s = n − 1 8 8 8 ⋯ 8 8 8 9
The digit sum of h 2 0 1 1 ( 1 ) is 8 × 2 0 1 1 + 1 = 1 7 3 × 9 3
We are given f ( x ) = 1 0 1 0 x , g ( x ) = lo g ( 1 0 x ) , h 1 ( x ) = g ( f ( x ) ) = lo g ( 1 0 1 0 x − 1 ) = 1 0 x − 1 , and h n ( x ) = h 1 ( h n − 1 ( x ) ) .
Looking at the first couple functions in the sequence h n ( x ) :
h 1 ( x ) = 1 0 x − 1
h 2 ( x ) = 1 0 ( 1 0 x − 1 ) − 1 = 1 0 0 x − 1 1
h 3 ( x ) = 1 0 ( 1 0 0 x − 1 1 ) − 1 = 1 0 0 0 x − 1 1 1
It is clear that h n ( x ) = 1 0 n x − 9 1 0 n − 1 . If x = 1 , then h n ( 1 ) = 8 8 8 . . . 9 for n − 1 occurrences of 8.
The digit sum of h n ( 1 ) is thereby given by s ( n ) = 9 + 8 ( n − 1 ) . s ( 2 0 1 1 ) = 9 + 8 ∗ 2 0 1 0 = 1 6 0 8 9 = 1 7 3 ∗ 9 3 . Therefore, Q = 9 3 .
Problem Loading...
Note Loading...
Set Loading...
h 1 ( x ) h 2 ( x ) h 3 ( x ) = g ( f ( x ) ) = g ( 1 0 1 0 x ) = lo g 1 0 ( 1 0 1 0 1 0 x ) = lo g 1 0 ( 1 0 1 0 x − 1 ) = 1 0 x − 1 = h 1 ( h 1 ( x ) ) = 1 0 ( 1 0 x − 1 ) − 1 = 1 0 2 x − 1 1 = 1 0 2 x − 9 1 0 2 − 1 = 1 0 ( 1 0 2 x − 1 1 ) − 1 = 1 0 3 x − 1 1 1 = 1 0 3 x − 9 1 0 3 − 1
⟹ h n ( x ) h 2 0 1 1 ( 1 ) = 1 0 n x − 9 1 0 n − 1 = 1 0 2 0 1 1 − 9 1 0 2 0 1 1 − 1 = 1 Number of 0’s = 2011 0 0 0 0 0 0 ⋯ 0 0 0 0 0 0 − Number of 1’s = 2011 1 1 1 1 1 1 ⋯ 1 1 1 1 1 1 = Number of 8’s = 2010 8 8 8 8 8 8 ⋯ 8 8 8 8 8 8 9 See proof by induction below.
The sum of digits of h 2 0 1 1 ( 1 ) is 2 0 1 0 × 8 + 9 = 1 6 0 8 9 = 1 7 3 × 9 3 . Therefore Q = 9 3 .
Proof by induction: The claim h n ( x ) = 1 0 n x − 9 1 0 n − 1 . When n = 1 , h 1 ( x ) = 1 0 1 x − 9 1 0 − 1 = 1 0 x − 1 as given. Therefore the claim is true for n = 1 . Now assuming that it is true for n , then:
h n + 1 = h 1 ( h n ( x ) ) = 1 0 ( 1 0 n x − 9 1 0 n − 1 ) − 1 = 1 0 n + 1 x − 9 1 0 n + 1 − 1 0 + 9 = 1 0 n + 1 x − 9 1 0 n + 1 − 1
Therefore, the claim is true for n + 1 and hence true for all n ≥ 1 .