− D A C C B A B C D A D B
In the image above we have a subtraction. All alphabets represents a different digit and A < B < C < D .
What is the value of 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.
This process of sorting the digits by size and then subtracting the ascending order from the descending order has been studied. There is exactly one four digit number that whose difference is itself, which is the Kaprekar constant 6174.
The sum of the digits of a number is congruent to its remainder modulo 9. That is,
A + B + C + D ≡ A B C D ≡ D C B A ≡ C A D B m o d 9
Since A B C D ≡ D C B A m o d 9 , A B C D − D C B A ≡ 0 m o d 9 . Thus C A D B ≡ 0 m o d 9 and, indeed, all our numbers are divisible by 9. This means that the sum A + B + C + D must be divisible by 9.
The only digit that could be zero is A , but that would give us a leading zero in A B C D . Thus, the smallest possible value of A + B + C + D is 1 + 2 + 3 + 4 = 1 0 > 9 . Similarly, the greatest possible value is 6 + 7 + 8 + 9 = 3 0 < 3 6 . Thus, the only possible sums are 1 8 and 2 7 .
A + B + C + D = 2 7 is only possible if D = 9 and A ≥ 3 . But then the leftmost digit in the subtraction would imply that C ≤ 6 . Since 4 + 5 + 6 + 9 = 2 4 , this is impossible.
Thus the only possibility is A + B + C + D = 1 8 .
The difference can be represented by
1 0 0 0 D + 1 0 0 C + 1 0 B + A − 1 0 0 0 A − 1 0 0 B − 1 0 C − D ⟹ 1 0 9 9 A + 9 1 B + 9 1 0 C 7 ( 1 5 7 A + 1 3 B + 1 3 0 C ) ⟹ D = 1 0 0 0 C + 1 0 0 A + 1 0 D + B = 9 8 9 D = 2 3 × 4 3 × D = 7
Since the LHS is a multiple of 7, the RHS must also be a multiple of 7, therefore, D = 7 . Since A < B < C < D , we note 1 ≤ A ≤ 4 , 2 ≤ B ≤ 5 , and 3 ≤ C ≤ 6 . From the above, we have:
1 5 7 A + 1 3 B + 1 3 0 C ⟹ 7 A + 3 B = 9 8 9 ≡ 9 (mod 10) Consider the last digit
⟹ ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ A = 1 A = 2 A = 3 A = 4 ⟹ B = 4 ⟹ B = 5 ⟹ B = 6 ⟹ B = 7 Acceptable Acceptable Unacceptable Unacceptable
From C = 1 3 0 9 8 9 − 1 5 7 A − 1 3 B ⟹ { A = 1 , A = 2 , B = 4 B = 5 ⟹ C = 6 ⟹ C = 4 1 3 9 No integer solution
Therefore, A + B + C + D = 1 + 4 + 6 + 7 = 1 8 .
Problem Loading...
Note Loading...
Set Loading...
Rewrite the equation:
C A D B + A B C D = D C B A
For the unit digits, since A < B < D , it must follow that B + D = A + 1 0 .
For the tens digits, since B < C < D , it must follow that D + C + 1 = B + 1 0 .
For the hundreds digits, since A < B < C , it must follow that A + B + 1 = C .
For the thousands digits, we have C + A = D .
Adding all the four equations yields 2 ( A + B + C + D ) + 2 = ( A + B + C + D ) + 2 0 .
Therefore, A + B + C + D = 2 0 − 2 = 1 8 .
Note: the solution to the system of equations is ( A , B , C , D ) = ( 1 , 4 , 6 , 7 ) .