Let A = set: 1 1 2 3 4 5 6 7 8 9 and B = set: 2 9 8 7 6 5 4 3 2 1
Let, x = 300 alternate sets or 150 A B ’s 1 2 3 4 5 6 7 8 9 9 8 7 6 5 4 3 2 1 … 1 2 3 4 5 6 7 8 9 9 8 7 6 5 4 3 2 1
Find the sum of digits of 9 x .
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.
Why did you choose to present 9ABAB as "constant 1 , repetitive number y, constant 2"?
Isn't it true that 9ABAB is "repetitive number z, repetitive number z"? That would make it much easier to explain why this is true (which you have glossed over in your approach).
print(sum(int(i) for i in str(9 * int(('123456789' + '987654321') * 150))))
Problem Loading...
Note Loading...
Set Loading...
We have 9 A = 9 × 1 2 3 4 5 6 7 8 9 = 1 1 1 1 1 1 1 1 0 1 and 9 B = 9 × 9 8 7 6 5 4 3 2 1 = 8 8 8 8 8 8 8 8 8 9
Now, let's find 9 A B = 1 1 1 1 1 1 1 1 0 1 0 0 0 0 0 0 0 0 0 + 8 8 8 8 8 8 8 8 8 9 = constant: 1 1 1 1 1 1 1 1 1 0 9 constant :2 8 8 8 8 8 8 8 8 9
Similarly, 9 A B A B = constant: 1 1 1 1 1 1 1 1 1 0 9 repetitive number y 8 8 8 8 8 8 8 9 0 1 1 1 1 1 1 1 0 9 constant: 2 8 8 8 8 8 8 8 8 9
We can observe that the both the constants i.e. 1 1 1 1 1 1 1 1 0 9 and 8 8 8 8 8 8 8 8 9 are always at the ends no matter how many A B ’s we add.
And the number of y ’s = no. of AB’s − 1 .
∴ 9 x = sum of digits of constant: 1 + sum of digits of constant: 2 + sum of digits of y ×149 = 1 7 + 7 3 + ( 8 1 × 1 4 9 ) = 9 0 + 1 2 0 6 9 = 1 2 1 5 9