Is it possible to place distinct digits (0 to 9) in the boxes so that the 4 equations hold true?
Note: Since there are only 8 boxes, two digits will be left over.
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.
Even though this solution appears lengthy, it's a very natural logical argument to make. Each step follows directly from the previous, and there is (surprisingly) no trial and error (in the sense of testing cases).
If you were unable to solve this problem "properly" and skimmed through the solution, I would encourage you to read it through and follow the steps.
@Brian Charlesworth - Awesome solution, and as for the 2 nd case since you dropped 6 , ( 6 , 7 ) will not be a valid solution and can be eliminated directly ;)
Very nice!
Not disputing your solution, but you might find it interesting to try the way I did it: I start the same as you, but once I established that the "missing" digits are 0 and another multiple of 3, I note that means that both 1 and 2 must appear, and they must be addends.
If 1 and 2 are adjacent, it can be shown that the boxes cannot all be distinct digits. (The other addends would have to be 4 and 5, but that would mean that two boxes are either 6 or 5.) So then try putting 1 and 2 in non-adjacent boxes. The other six digits will be two sets of three adjacent numbers, which is a much easier problem to work out.
Log in to reply
Oh, that's a nice approach. Can you write it up?
Log in to reply
Thank you. Anyone is welcome to try solving the problem by that method, it should pose no difficulties.
i clicked Upvote three times
Is this just trial and error?
Log in to reply
There is some method to my madness. :)
I've added some explanatory notes to my solution.
Log in to reply
Great! Though your solution is lengthy, at each point in time there is a "natural" move to make to put all of this together. There is very little trial and error in the sense of "let's hope this works", and instead it's just "when we consider this part, there is only 1 logical step to take".
Love it!
Log in to reply
@Calvin Lin – Thank you! And thanks also for prompting me to expand on my reasoning. :)
Why, taking into consideration the sum of the right vertical row and the bottom horizontal row are the same, it is right to say that it is divisible by 3? That's the only part I didn't get from the answer.
Log in to reply
I think Brian's implying that the sum of ALL numbers is divisible by three, not the sum of those rows.
Log in to reply
You can get the divisibility easily if you call the first four numbers (column 1 and 2, row 1 and 2) a , b , c , d . To that you add the sums: a + b , c + d , a + c , b + d , so you get altogether (all 8 numbers added)
a + b + c + d + ( a + b ) + ( c + d ) + ( a + c ) + ( b + d ) = 3 × ( a + b + c + d ) , which is clearly divisible by 3.
Right.
Because "the sum of the numbers in the lower row" = "the sum of the numbers in the rightmost column" = "the sum of all the numbers in the remaining 4 boxes", hence "sum of all 8 numbers used must be divisible by 3".
I feel like this solution is highly unintuitive and the simple implications Brian is applying might not be obvious to a reader. I suggest adding some context as to why whatever is, is.
Why is it and how is it that when using a sum such as 36 or 39, we decide what numbers to choose and what to "drop"?
Log in to reply
What is the sum of all the digits from 1 to 9? (Remember that 0 cannot be used)
Hence, if the sum is 36, what digit is missing?
Log in to reply
Ahhh, I see now. Well explained, indeed.
@Aditya Shukla – The explanation would be more solid if, after establishing the S/3 principle among the entirety of the diagram, it also pointed out that to maintain that S/3 proportion, any number dropped from the line must also be an S/3 number, reciprocally subtractable from the sum of 45 made by the entire line. As only 3, 6, & 9 are thus divisible, reciprocal subtraction makes our diagram possibilities sum 42, 39, & 36 from that initial sum of 45. Such a methodology would rule out any false third factor for the sum of 39. This is perhaps a more logical method that summing the maximum of 8 numbers at 44, because it allows the machinations whereby S/3 governs all to be revealed.
Eliminate one S/3 number, 3: 1+2+...[3+]...+8+9 = 45 [-3] =42
Eliminate one S/3 number, 6: 1+2+...[+6]...+8+9 = 45 [-6] =39
Eliminate one S/3 number, 9: 1+2+...+8...[+9] = 45 [-9] =36
I like your way of thinking. The sum of the numbers in the lower row equals the sum of the numbers in the rightmost column, equals to 12 or 13 or 14. You basically found these 3 classes of solutions in which are divided all 24 possible arrangements of the digits. I used the "Brute force" method (I wrote a program in Just Basic to generate all of them). Here is the program: 'a+b=c '+ + 'd+e=f '= = 'g h for a=1 to 9 for b=1 to 9:if b=a then [nb] for c=1 to 9:if c=a or c=b then [nc] for d=1 to 9:if d=a or d=b or d=c then [nd] for e=1 to 9:if e=a or e=b or e=c or e=d then [ne] for f=1 to 9:if f=a or f=b or f=c or f=d or f=e then [nf] for g=1 to 9:if g=a or g=b or g=c or g=d or g=e or g=f then [ng] for h=1 to 9:if h=a or h=b or h=c or h=d or h=e or h=f or h=g then [nh] ab=a+b: ad=a+d: be=b+e: de=d+e if ab=c and ad=g and be=h and de=f then br=br+1:gosub [p] [nh] next h [ng] next g [nf] next f [ne] next e [nd] next d [nc] next c [nb] next b next a end [p] print br;")";tab(6);a;"+";b;"=";c print tab(6);"+ +" print tab(6);d;"+";e;"=";f print tab(6);"= =" print tab(6);g;" ";h print return
And these are all the 24 possible arrangements: 1) sum 12 1+3=4 + + 6+2=8 = = 7 5
2) sum 13 1+3=4 + + 7+2=9 = = 8 5
3) sum 14. And down the road the sum repeats seven more times in the same order: 12, 13, 14. 1+4=5 + + 7+2=9 = = 8 6
4) 1+6=7 + + 3+2=5 = = 4 8
5) 1+7=8 + + 3+2=5 = = 4 9
6) 1+7=8 + + 4+2=6 = = 5 9
7) 2+3=5 + + 6+1=7 = = 8 4
8) 2+3=5 + + 7+1=8 = = 9 4
9) 2+4=6 + + 7+1=8 = = 9 5
10) 2+6=8 + + 3+1=4 = = 5 7
11) 2+7=9 + + 3+1=4 = = 5 8
12) 2+7=9 + + 4+1=5 = = 6 8
13) 3+1=4 + + 2+6=8 = = 5 7
14) 3+1=4 + + 2+7=9 = = 5 8
15) 3+2=5 + + 1+6=7 = = 4 8
16) 3+2=5 + + 1+7=8 = = 4 9
17) 4+1=5 + + 2+7=9 = = 6 8
18) 4+2=6 + + 1+7=8 = = 5 9
19) 6+1=7 + + 2+3=5 = = 8 4
20) 6+2=8 + + 1+3=4 = = 7 5
21) 7+1=8 + + 2+3=5 = = 9 4
22) 7+1=8 + + 2+4=6 = = 9 5
23) 7+2=9 + + 1+3=4 = = 8 5
24) 7+2=9 + + 1+4=5 = = 8 6
7 + 2 = 9 + + 1+ 3 = 4 = = 8 5
Problem Loading...
Note Loading...
Set Loading...
0 cannot be used as this would require one of the equations to be 0 + n = n , and duplication is not allowed. So we are only working with eight of 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 in any potential solution.
Now the sum S of the numbers in the lower row must equal the sum of the numbers in the rightmost column, since each represents the sum of all the numbers in the remaining 4 boxes. This in turn implies that the sum of all 8 numbers is 3 S , i.e., divisible by 3 . The range of sums in general is 1 + 2 + . . . + 7 + 8 = 3 6 to 2 + 3 + . . . . + 8 + 9 = 4 4 , so the valid sums we can work with are 3 6 , 3 9 and 4 2 .
With a sum of 3 6 we are using the integer 1 through 8 . The sums of the numbers in the outer row and column must each be 3 6 / 3 = 1 2 , which can only be accomplished with the pairs ( 4 , 8 ) and ( 5 , 7 ) . For one of the equations we must then have 1 + 3 = 4 ; let this be one of the rows. Then to get a vertical sum of 7 , since 4 has already been used, we must have in a column the equation 1 + 6 = 7 . This forces 2 into the last remaining box, giving us the solution
1 + 3 = 4
+ +
6 + 2 = 8
= =
7 5
With a sum of 3 9 we now must include 9 and drop 6 . The sum of the numbers in the outer row and column must now be 3 9 / 3 = 1 3 , which can be accomplished with the pairs ( 4 , 9 ) , ( 5 , 8 ) and ( 6 , 7 ) . But since we dropped 6, the pairs we must use are ( 4 , 9 ) and ( 5 , 8 ) . Again, one equation must be 1 + 3 = 4 , which we can let be one of the rows. Since 4 is then already used, one of the vertical equations must be 3 + 2 = 5 , forcing 7 into the remaining box, giving us the solution
2 + 7 = 9
+ +
3 + 1 = 4
= =
5 8
Finally, for a sum of 4 2 we must add back 6 and drop 3 . The outer row and column sums must now be 4 2 / 3 = 1 4 , which can only be accomplished with the pairs ( 5 , 9 ) and ( 6 , 8 ) . This forces the placement of 7 in the inner boxes, which in turn forces the placement of 1 , 2 and then 4 , giving us the third and final solution
4 + 1 = 5
+ +
2 + 7 = 9
= =
6 8