Define a cute number as a 16 digit number whose difference in pair of each consecutive digits is and each digit belongs to the set .
If the the sum of all cute numbers can be expressed as where is not divisible by , and both and are positive integers.Evaluate .
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.
Note that for a cute number to be formed, there needs to be a 2 at every alternate place, starting from either the first or second digit. So there would be 8 places to fill either 1 or 3 . Meaning, that there are 2 8 × 2 possible cute numbers ( 2 8 starting with 2 and 2 8 not starting with 2 ).
Of each of these, note that for each cute number there would exist another cute number where each 1 is replaced by 3 and each 3 is replaced by 1 . Adding both of these, you would get 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 ( 1 6 -digit 4 's). Since there are 2 9 cute numbers, there would be 2 2 9 pairs of opposite numbers.
Meaning the sum would be 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 × 2 8 . We can factor out 4 from the first term leaving us with 2 1 0 × 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 , which is in the desired form.