Thursday, September 25, 2014

JMO


Suppose n is an integer such that the sum of digits on n is 2, and 1010<n<1011. The number of different values of n is:


Answer:
n = 10000000001
The one in the units place can be shifted to 9 other different places.
And there is also the number 20000000000 which satisfies the condition.
so, total number of numbers = 9 + 1 + 1 = 11

No comments:

Post a Comment