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.
Is there a better way? How else can we reduce the number of possibilities to check?
Log in to reply
It's not by much, but you could try the checking from FGHI instead of ABCD (just for E = 3?) to cut on some of the trials & errors.
Log in to reply
I think that removes three options from the E = 3 case (the way I was listing them, anyway) because we can't have F = 3 . I wonder if there's a fundamentally different idea, though; perhaps looking at a different divisor for the mod ?
I just used code to solve this; see my explanation.
1 2 3 4 5 |
|
1 2 3 |
|
We can also see from this that we have two solutions to this problem.
Problem Loading...
Note Loading...
Set Loading...
Obviously coding is the simplest way to go here, but it's just about possible manually.
Some initial observations:
1) A B C D is at least 1 2 3 4
2) F G H I is at most 9 8 7 6
3) E can't be 1 (because then A B C D would equal F G H I ) and E can't be 9 (because 9 × 1 2 3 4 is too big)
4) D can't be 5 , because that would force I to be 0 or 5 , neither of which is allowed
Now consider the problem modulo 9 . If A + B + C + D ≡ k , then F + G + H + I ≡ k E . But the total of all the digits in the sum is 4 5 ; ie A + B + C + D + E + F + G + H + I ≡ 0 ( m o d 9 ) so k + E + k E ( k + 1 ) ( E + 1 ) ≡ 0 ( m o d 9 ) ≡ 1 ( m o d 9 )
Remembering 1 < E < 9 , this has solutions
Case E = 7 : A + B + C + D ≡ 7 ( m o d 9 ) . Since A , B , C , D are distinct, the total can't be 7 . Since E = 7 , A B C D is at most 1 4 2 8 ; so A = 1 and B ≤ 4 . Hence the total A + B + C + D is less than 2 5 ; so A + B + C + D = 1 6 .
Remembering D = 5 , the only possible A B C D values this leaves are { 1 2 4 9 , 1 2 5 8 , 1 2 9 4 , 1 3 4 8 , 1 3 8 4 and it's easy to check that none of these work.
Case E = 6 : In this case, D cannot be even, as if it were then we would have I = D . A + B + C + D ≡ 3 ( m o d 9 ) , and by its size, A B C D ≤ 1 6 5 9 . But B can't be 6 , so again we have A = 1 and this time B ≤ 5 .
The possible totals of A + B + C + D are then 1 2 and 2 1 . The possible values of A B C D this time are 1 3 8 9 , 1 4 7 9 , 1 4 9 7 , 1 5 8 7 ; again it's easy enough to check that these don't work.
Case E = 3 : Now by its size, A B C D ≤ 3 2 9 8 , but of course we can't have A = 3 . However, even with these restrictions, there are 1 6 possibilities to check, which is a bit onerous. It turns out none of them work but it would be better to reduce these more - any ideas?
Case E = 4 : Finally, applying the same ideas, we find two solutions: namely 1 7 3 8 × 4 = 6 9 5 2 and 1 9 6 3 × 4 = 7 8 5 2
so E = 4 .