− + P A C E G P B D F H P
Each of the letters A , B , C , D , E , F , G , H , P represents a distinct digit from 1 to 9.
What is A + B + C + D ?
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.
Ok... I was going for a system of equations with a little bit of trial and error method. The idea was to find out all numbers. But this is a lot more economically convenient. Seriously, well done my friend.
Log in to reply
Solving the entire equation (which I actually did for all 3 solutions) would be ideal, but I also saw this shortcut, so I decided to share it. In the end, my goal is to learn mathematics better, so solving the entire equation would be better in that sense. Others posted solutions solving the entire equation, so I decided that posting a solution along the same lines wouldn't really help the conversation, but those solutions are probably preferable because they help us to learn more about solving these types of equations. On the other hand, because there is no unique solution to the equation (3 solutions), my method does keep it general and saves me from having to find all 3 solutions and proving that those are the only solutions (which at least so far, none of the other solutions have done; other than the fact that brilliant is asking for one answer, none of the other solutions have shown that their answer is the only possible answer.)
Log in to reply
I came up with the same solution, after using the same equations to start the complete solution and realising I need go no further. Of course, technically you have only shown that, if such numbers exist then they must have this property. However the statement of the question implies they do. Now had the choices been 19, 21, 23, "It's insoluble" then that would be more interesting.
Log in to reply
@Richard Farrer – Yes, I had realized that I was assuming that a solution existed in my short proof, but I had worked all three solutions by hand, so I was comfortable with that. On a side note, almost all of the other solutions posted here assumed that one solution existed. Most of the other solutions stopped after finding only one possible answer, hypothetically leaving the door open for more than one answer. (other than, of course, the fact that we are asked for only one answer)
I solved it this way as well. The idea isn't to find all the numbers, it clearly states to find the sum of A, B, C, D.
It further hints the sum must be one of only four choices (at least they are all odd since it can easily be shown that three of the four have the same parity.)
Thank for your solution! It was elegant!!!!
Deductive simplicity. Love it.
− + 8 6 5 4 3 2 7 9 1 1 1
Since two digit number can be denoted as 1 0 x + y where x and y are its digits. Similary for above case where a , b , c , d , e , f , g and h are distinct we have as ( 1 0 a + b ) − ( 1 0 c + d ) = 1 0 e + f 1 0 ( a − c ) + ( b − d ) = 1 0 e + f Note that obtained difference is one digit number and it's digits can be equated as follow : a − c = e b − d = f Also 1 0 ( e + g ) + ( f + h ) = 1 1 1 p Note that the maximum sum of two two digits can never exceed 200 so which leads us the conclusion that p = 1 . Since for p > 1 the sum is not possible. Hence, 1 0 ( a − c + g ) + ( b − d + h ) = 1 1 1 1 0 ( a − c + g ) + ( b − d + h ) = 1 0 × 1 1 + 1 c c c isn’t true since c c a − c + g + 1 = 1 1 b − d + h = 1 1 ∴ 1 0 ( a − c + g ) + ( b − d + h ) = 1 0 × 1 0 + 1 1
Equating the respective digits we have { a − c + g = 1 0 ⟹ e + g = 1 0 b − d + h = 1 1 ⟹ f + h = 1 1 since p = 1 so neither a , c or b , d cannot be consecutive integers so there difference should lie between 1 to 9(inclusive). Note: ( a − c ) / e is read as ( a − c ) or e ( a − c ) / e = ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 2 ⟹ g = 8 3 ⟹ g = 7 4 ⟹ g = 6 5 ⟹ g = 5 ( b − d ) / f = ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 2 ⟹ h = 9 3 ⟹ h = 8 4 ⟹ h = 7 5 ⟹ h = 6
Note that when ( b − d ) / f = 2 , h = 9 is uniquely defined since there occurs no 9 for g (also reverse works ) and it's clear that ( a − c ) / e = 2 , g = 8 . since g = 8 So highest possible value for g = 7 (among ,6,5,) and it only works that prevents the reappears of same number.
−
+
A
B
C
D
E
2
7
9
1
1
1
Then we can conclude that
e
=
4
and only left digits are
4
,
5
,
6
and
8
since
e
=
3
which is possibly yield by
a
−
c
=
8
−
5
and
b
−
d
=
6
−
4
=
2
.
So, a = 8 , b = 6 , c = 5 , d = 4 , e = 3 , f = 2 , g = 7 and h = 9 . Therefore, a + b + c + d = 2 3 .
I didn't go through your solution, but a=9, b=5, c=2, d=7, e=6, f=8, g=4, h=3, p=1 is also a possible set..
Log in to reply
I did a=9 b=8 c=3 d=1 e=6 f=7 g=5 h=4.... p=2
1 2 3 4 5 6 7 8 9 |
|
there are 3 possible results and the sum of ABCD is 23.[854639721] [865432791][952768431]
lol brute force, good on ya!
There are three possible solutions:
− + 1 9 2 6 4 1 5 7 8 3 1 − + 1 8 5 3 7 1 6 4 2 9 1 − + 1 8 4 3 7 1 5 6 9 2 1
in all of them A + B + C + D = 2 3 , found via code:
1 2 3 4 5 6 7 |
|
1 2 3 4 5 |
|
using M a t h e m a t i c a :
P must be 1
Select[Permutations@Range[2,9],#[[2]]-#[[4]]==#[[6]]&&#[[1]]-#[[3]]==#[[5]]&&#[[6]]+#[[8]]==11&&#[[5]]+#[[7]]==10&]
returns
{8, 6, 5, 4, 3, 2, 7, 9}
which is the correct {a,b,c,d,e,f,g,h} tuple
Seeing John Ross’s elegant solution makes me feel I made this hard for myself, but here’s my approach:
Observations:
Since digits cannot be duplicated possible combinations for EG&FH and remaining digits for ABCD (not in order) are:
(E,G) and (F,H) | A,B,C,D |
(4,6) with (3,8) | 2,5,7,9 |
(4,6) with (2,9) | 3,5,7,8 |
(3,7) with (5,6) | 2,4,8,9 |
(3,7) with (2,9) | 4,5,6,8 |
(2,8) with (5,6) | 3,4,7,9 |
(2,8) with (4,7) | 3,5,6,9 |
Seek combinations of ABCD that give a remainder that can be formed from EG&FH...
Within the first set we find one solution: 95 - 27 = 68, leaving GH to be 43.
Sum of digits ABCD is 23
I t i s c l e a r t h a t P = 1 s i n c e i t c a r r i e s f r o m E + G . T h e r e f o r e F + H = 1 1 a n d E + G = 1 0 . T a k i n g F = 2 , H = 9 , E = 3 , G = 7 w e g e t A + B + C + D = 8 + 6 + 5 + 4 = 2 3 .
首先,9个数字的和是45。
PPP首位的P是由E+G进位得来的,所以一定是1,即PPP是111。F+H=11,才能得到末位的1,十位的1则是由个位进上来的,所以E+G=10。
最后A+B+C+D=45-11-10-1=23。
至于算式,则是:
86-54=32,32+79=111
如果想得到这个式子,不妨从下面四个数入手,1不能使用,因为P已经是1了,9和8的位置得到限制,接着将数字和为10和11的成对考虑,就可以得到这个式子了。
What he said.
The solution.
Step 1: As the three digit in PPP are the same. PPP can be 111, 222, 333...
The largest possibility of EF+GH is 187. Therefore, PPP can only be 111.
Step 2: After knowing that P=1, we need to list all the possibility of EF+GH=111
e.g. 24+87, 25+86, 26+85, 27+84...
Step 3: We need to know four things:
(1) F+H=11 「2+9」、「3+8」、「4+7」、「5+6」、「6+5」、「7+4」、「8+3」、「9+2」
(2) E+G=10 「2+8」、「3+7」、「4+6」、「6+4」、「7+3」、「8+2」
(3) The biggest number for EF is 78. If AB=90 and CD=20, then EF=78, which is the greatest number
(4) A-C must be positive. As this problem don't have negative number, A-C should be a positive number
Step 4: Keep trying.
Step 5: The answer is 86-54=32, 32+79=111
A=8, B=6, C=5, D=4, E=3, F=2, G=7, H=9, P=1
Step 6: A+B+C+D
=8+6+5+4
=23
ANSWER: 23
Problem Loading...
Note Loading...
Set Loading...
Notice that P = 1 because it carries from E + G . F + H must equal 11 because two distinct numbers cannot sum to 1. E + G must then equal 10. The sum of the numbers from 1 to 9 is 45. Therefore A + B + C + D = 4 5 − 1 0 − 1 1 − 1 = 2 3