Hi StackOverflow, Although it is not very programming related but I think SO could be of some assistance:
A zeroless pandigital number of base 10 is a number with all the distinct digits 1,2,3,4,5,6,7,8,9. For example, the first zeroless pandigital number of base 10 is 123456789. Find a zeroless pandigital number of base 10 such that the numbers up to the nth digit is divisible by n i.e. the number formed by 1st, 2nd and 3rd digit is divisible by 3, the number formed by 1 to 6 digits is divisible by 6 and so on.
I started with thinking as assuming the no. to be "abcdefghi" and stating that a can be any number between "1-9" b can be only the even ones, e is surely 5 and so on.
But I am not able to find how to go from here.
Any help/or better method will be appreciated