A positive integer with digits is a interesting number if it only has the digits and . (For example, the is an interesting number.
Find the maximum value of , such that there exist interesting numbers where every pair of them differ in at least 3 places.
For example we cannot write both and , but we can write down and .
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.
From the written numbers we can get new numbers. From each number we can get 2 0 new numbers following the next instruction:
In each number we change one digit, from 1 to 2 , or from 2 to 1 .
From that we couldn't get a number which was written or a number which was got by an other number. (Since each pair of written numbers are different in minimum three place.) If there was m numbers in the beginning, then we could get maximum m ( 2 0 + 1 ) = 2 1 m numbers together. 2 1 m ≤ 2 2 0 , because there are 2 2 0 interesting numbers. So m ≤ 2 1 2 2 0 = 4 9 9 3 2 , 1 9 0 … . The answer is 4 9 9 3 2 .