Find a number with all digits from 1-9 (both included) such that is divisible by 1, is divisible by 2, is divisible by 3 and so on.
This problem is flagged because there are multiple solutions.
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.
My approach was not very graceful, I'll admit, but I wanted to test all reasonable possibilites, because the problem was flagged as having multiple solutions. I found that there are not multiple solutions. I think the flag should come off.
First, using the divisibility rules for 5, and since 0 is not available, the 5th digit must be 5.
Now to fill the other 8 positions. Using the multiplication facts and pattern recognition, if a number is divisible by 2, 4, 6, or 8, then its last number must be a 2, 4, 6, or 8. Therefore the 2nd, 4th, 6th, and 8th digits must be 2, 4, 6, or 8. This narrows down the possibilities, leaving the 1st, 3rd, 7th, and 9th position to be 1, 3, 7, or 9.
Using some Combinatorics: To choose 4 things from a list of 4 choices, without replacement, there are 4x3x2x1 = 24 ways. So there are 24 ways to choose the 4 even numbers and 24 ways to choose the four odd numbers. These are independent events, so 24x24=576 ways to fill the other 8 positions.
So when I realized that 576 possibilities are a lot fewer than the 9! = 362880 ways of filling 9 spaces from 9 choices, I thought analyzing 576 items can be done in a spreadsheet. I listed all of the 576 possible combinations and checked each combination for divisibility in each of the 9 strings a, ab, abc, abcd, abcde, abcdef, abcdefg, abcdefgh, and abcdefghi. If a string had a remainder when divided, it was tagged.
Amazingly, there was only ONE combination that had no tags and popped out as solving the problem: 381654729
Sue