Cute numbers!

Define a cute number as a 16 digit number whose difference in pair of each consecutive digits is 1 1 and each digit belongs to the set { 1 , 2 , 3 } \{ 1,2,3 \} .

If the the sum of all cute numbers can be expressed as 2 a × b 2^{a} \times b where b b is not divisible by 2 2 , and both a a and b b are positive integers.Evaluate a + b a+b .

This problem is from Indian International Mathematical Olympiad Training Camp 2015.


The answer is 1111111111111121.

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.

1 solution

Note that for a cute number to be formed, there needs to be a 2 2 at every alternate place, starting from either the first or second digit. So there would be 8 8 places to fill either 1 1 or 3 3 . Meaning, that there are 2 8 × 2 2^8 \times 2 possible cute numbers ( 2 8 2^8 starting with 2 2 and 2 8 2^8 not starting with 2 2 ).

Of each of these, note that for each cute number there would exist another cute number where each 1 1 is replaced by 3 3 and each 3 3 is replaced by 1 1 . Adding both of these, you would get 4444444444444444 4444444444444444 ( 16 16 -digit 4 4 's). Since there are 2 9 2^9 cute numbers, there would be 2 9 2 \frac{2^9}{2} pairs of opposite numbers.

Meaning the sum would be 4444444444444444 × 2 8 4444444444444444 \times 2^8 . We can factor out 4 4 from the first term leaving us with 2 10 × 1111111111111111 2^{10} \times 1111111111111111 , which is in the desired form.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...