QuantumQuest
Science Advisor
- 927
- 484
ADVANCED CHALLENGES: Problem 9
We will utilize letters a, b, c, d, e, f, g, h, i, j for digits. We'll begin with divisibility (i.e b) part) and take into account a) part along the way.
According to part b) constraint, the whole number denoted ##abcdefghij##, must be divisible by 10, so ##j = 0##. Now, we'll proceed to the first five digits. The reason for this, is that we can quickly conclude that ##e## is ##0## or ##5##. Now, taking into account part a) constraint (no digit repetitions) and because ##0## is already taken, we conclude that ##e = 5##.
At this point, it would be wise to divide remaining candidate digits into odd and even. So, numbers ending in ##b##, ##d##, ##f## and ##h## must be divisible by 2, 4, 6, 8 respectively, so the previous letters are even "spots". This also means that in accordance to part a), ##a##, ##c##, ##g##, ##i## are odd "spots" (with the same previous meaning). Proceeding to the first four digits ##abcd##, because 4 divides them, it also divides ##cd##. But because ##c## is odd, ##d## must be 2 or 6##^{*}##. In a similar fashion, ##abcdefgh## is divisible by 8, so ##gh## is divisible by 4. Because ##g## is odd, this leaves us with ##h## to be 2 or 6. Taking into account all the above, we conclude that ##b## and ##f## can be 4 or 8.
Now, going to ##abcdef##, this must be divisible by 6. But from the odd parts of the number, ##abc## must be divisible by 3, so ##def## must also be divisible by 3. We already know from the above that ##d## is 2 or 6, ##e = 5## and ##f## is 4 or 8. So, from the four numbers that are formed (##def## must be divisible by 3), only 258 and 654 survive. Also, according to the above analysis, whatever values ##d## and ##f## take, the values of ##h## and ##b## are fixed accordingly.
Proceeding to ##abcdefgh##, this must be divisible by 8, so from divisibility rules, ##fgh## must be divisible by 8. But as we stated earlier, ##f## is even, so it has to be that ##gh## is divisible by 8. Now, ##g## is odd (excluding of course the value 5) and ##h## can be 2 or 6 as we stated earlier, so from all the forming numbers for ##gh## only 4 numbers (16,32,72,96) survive.
From this point on, it would be a good idea to create some sketches for each situation.
So far:
##_4_25816_0## or ##_4_25896_0## and ##_8_65432_0## or ##_8_65472_0## are the four candidate patterns.
Starting from the first two, we examine the first three digits. Now, we know that ##a## and ##c## can take all the odd values from 1 to 10 except the value 5. Also, ##b = 4## and ##abc## divisible by 3. Taking also into account the constraint a), we have twelve candidate numbers for ##abc##, but only 147 and 741 survive the divisibility by 3. So:
##14725816-0##, ##14725896-0##, Now, we turn our attention to the divisibility by 7 for ##abcdefg## and we see that it fails for both. So, we can safely exclude the first two candidate patterns.
Now, we examine the last two patterns. In the same fashion as before we examine the first three digits pattern: ##abc##. Now, ##a## and ##c##, can take the same values as in the previous case of the first two patterns, but ##b = 8## here. Also, taking into account divisibility by 3, constraint a) and the fact that ##g## can be only 3 or 7 (according to the form of the examined patterns), from the twelve possible values, only six survive: 183, 189, 381, 789, 981, 987.
Now, we examine each one of the formed patterns:
##18365432-0## fails due to repetition of 3
##18965432-0## fails to the divisibility of ##1896543## by 7
##38165432-0## fails due to repetition of 3
##78965432-0## fails to the divisibility of ##7896543## by 7
##98165432-0## fails to the divisibility of ##9816543## by 7
##98765432-0## fails to the divisibility of ##9876543## by 7
##18365472-0##, ##18965472-0##, ##78965472-0##, ##98165472-0##, ##98765472-0## fail to the divisibility of the first seven digits by 7.
The only surviving pattern is ##38165472-0##. We can now simply complete it with the missing digit 9, so the number is ##3816547290##.
##^{*}##
This is trivial but for completeness, the candidate numbers for ##cd## (given the constraints) are 12, 14, 16, 18, 32, 34, 36, 38, 72, 74, 76, 78, 92, 94, 96, 98. From these, only 12, 32, 72, 92, 16, 36, 76, 96 survive the divisibility by 4, so ##d## can be 2 or 6. In the next, for brevity, I will omit showing similar cases.
We will utilize letters a, b, c, d, e, f, g, h, i, j for digits. We'll begin with divisibility (i.e b) part) and take into account a) part along the way.
According to part b) constraint, the whole number denoted ##abcdefghij##, must be divisible by 10, so ##j = 0##. Now, we'll proceed to the first five digits. The reason for this, is that we can quickly conclude that ##e## is ##0## or ##5##. Now, taking into account part a) constraint (no digit repetitions) and because ##0## is already taken, we conclude that ##e = 5##.
At this point, it would be wise to divide remaining candidate digits into odd and even. So, numbers ending in ##b##, ##d##, ##f## and ##h## must be divisible by 2, 4, 6, 8 respectively, so the previous letters are even "spots". This also means that in accordance to part a), ##a##, ##c##, ##g##, ##i## are odd "spots" (with the same previous meaning). Proceeding to the first four digits ##abcd##, because 4 divides them, it also divides ##cd##. But because ##c## is odd, ##d## must be 2 or 6##^{*}##. In a similar fashion, ##abcdefgh## is divisible by 8, so ##gh## is divisible by 4. Because ##g## is odd, this leaves us with ##h## to be 2 or 6. Taking into account all the above, we conclude that ##b## and ##f## can be 4 or 8.
Now, going to ##abcdef##, this must be divisible by 6. But from the odd parts of the number, ##abc## must be divisible by 3, so ##def## must also be divisible by 3. We already know from the above that ##d## is 2 or 6, ##e = 5## and ##f## is 4 or 8. So, from the four numbers that are formed (##def## must be divisible by 3), only 258 and 654 survive. Also, according to the above analysis, whatever values ##d## and ##f## take, the values of ##h## and ##b## are fixed accordingly.
Proceeding to ##abcdefgh##, this must be divisible by 8, so from divisibility rules, ##fgh## must be divisible by 8. But as we stated earlier, ##f## is even, so it has to be that ##gh## is divisible by 8. Now, ##g## is odd (excluding of course the value 5) and ##h## can be 2 or 6 as we stated earlier, so from all the forming numbers for ##gh## only 4 numbers (16,32,72,96) survive.
From this point on, it would be a good idea to create some sketches for each situation.
So far:
##_4_25816_0## or ##_4_25896_0## and ##_8_65432_0## or ##_8_65472_0## are the four candidate patterns.
Starting from the first two, we examine the first three digits. Now, we know that ##a## and ##c## can take all the odd values from 1 to 10 except the value 5. Also, ##b = 4## and ##abc## divisible by 3. Taking also into account the constraint a), we have twelve candidate numbers for ##abc##, but only 147 and 741 survive the divisibility by 3. So:
##14725816-0##, ##14725896-0##, Now, we turn our attention to the divisibility by 7 for ##abcdefg## and we see that it fails for both. So, we can safely exclude the first two candidate patterns.
Now, we examine the last two patterns. In the same fashion as before we examine the first three digits pattern: ##abc##. Now, ##a## and ##c##, can take the same values as in the previous case of the first two patterns, but ##b = 8## here. Also, taking into account divisibility by 3, constraint a) and the fact that ##g## can be only 3 or 7 (according to the form of the examined patterns), from the twelve possible values, only six survive: 183, 189, 381, 789, 981, 987.
Now, we examine each one of the formed patterns:
##18365432-0## fails due to repetition of 3
##18965432-0## fails to the divisibility of ##1896543## by 7
##38165432-0## fails due to repetition of 3
##78965432-0## fails to the divisibility of ##7896543## by 7
##98165432-0## fails to the divisibility of ##9816543## by 7
##98765432-0## fails to the divisibility of ##9876543## by 7
##18365472-0##, ##18965472-0##, ##78965472-0##, ##98165472-0##, ##98765472-0## fail to the divisibility of the first seven digits by 7.
The only surviving pattern is ##38165472-0##. We can now simply complete it with the missing digit 9, so the number is ##3816547290##.
##^{*}##
This is trivial but for completeness, the candidate numbers for ##cd## (given the constraints) are 12, 14, 16, 18, 32, 34, 36, 38, 72, 74, 76, 78, 92, 94, 96, 98. From these, only 12, 32, 72, 92, 16, 36, 76, 96 survive the divisibility by 4, so ##d## can be 2 or 6. In the next, for brevity, I will omit showing similar cases.
Last edited:
