Maybe it's just to early in the morning but I'm not sure I'm reading the problem correctly, is this what it's asking?
For example, let n = 2. The binary representation of 2 is 10. The smallest number that contains the digits "10" in its base 10 representation, that is not divisible by 2, is 101.
Is that right? And then the idea is to find a general solution for all n?

Posted by tomarken
on 20140403 08:55:07 