× D E F 9 A 1 9 B 3 9 C 2
In this cryptogram, A , B , C , D , E and F are (not necessarily distinct) single digits. What is the value of A + B + C + D + E + F ?
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.
Good work! Bonus question: What would the answer be if I change the number 9 9 9 to 9 9 8 ?
Applying the same principle, we have:
9 9 8 × A B C = A B C ( 1 0 0 0 − 2 ) = A B C 0 0 0 − 2 × A B C
⇒ 2 × A B C = ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 1 0 0 0 − 1 3 2 = 8 6 8 2 0 0 0 − 1 3 2 = 1 8 6 8 ⇒ A B C = 4 3 4 ⇒ 9 9 8 × 4 3 4 = 4 3 3 1 3 2 ⇒ A B C = 9 3 4 ⇒ 9 9 8 × 9 3 4 = 9 3 2 1 3 2
Log in to reply
for 2XABC WHY DID U CONSIDER 2000-132? PLEASE CAN U EXPLAIN?
Log in to reply
Because A B C × 2 can be larger than 1 0 0 0 but A B C is definitely less than 1 0 0 0 .
Without having to change DEF132; would you be able to use this principle for 997 × ABC = DEF132?
Thanks in advance
Log in to reply
From 9 9 9 × A B C = A B C 0 0 0 − A B C = D E F 1 3 2 or
\(\begin{array} {} & A & B & C & 0 & 0 & 0 \\ - & & & & A & B & C \\ \hline & D & E & F & 1 & 3 & 2 \end{array} \)
Can you get A B C from the above? If you do, what you would have done was probably 1 0 0 0 − A B C = 1 3 2 . That is how we normally do in arithmetic. We borrow 1 in front, because 0 0 0 cannot minus A B C .
Awesome solution dude!, greetings from México
Even i had got ABC as 868 but then i saw DEF should have been different then ABC but A & D and B & E are equal i.e A=D & B=E. It was not specifically mentioned in the question whether ABC can have values same to values of DEF.
999 x ABC = (1000-1) x ABC = ABC000 - ABC = DEF132 .: ABC000 = DEF132 + ABC .: ABC = 868 DEF132 + 868 = 868000 .: DEF132 = 868000 - 868 .: DEF132 = 867132 .: DEF = 867 So, 8+6+8+8+6+7=43
You guys help me with something. If ABC is 868, why where A and C represented with different letters
This method is so short and sweet... My method is so big and complicated... U P V O T E D + 1
999x=1000y+132
1000x=x+1000y+132
1000(x-y)=x+132
x+132=1000 and x-y=1
x=868 and y=867
summing the digits of x and y gives the answer=43
This is correct too!
why do you assume x-y=1 ??
Log in to reply
x = ABC => x<1000 => x+132<1132 => 1000(x-y)<1132 => (x-y)<1.132
Since x and y are distinct whole numbers x-y=1
The number is divisible by nine obviously. The Divisibility rules says that if a number is a factor of 9 , all the digits add up to 9. 1 + 3+ 2 = 6. Then it's just a matter. of finding three numbers that add up 21, and when added to the 6, make 27, and 2 + 7 = 9
As the last digit is 2 , C must be equal to 8 . As second last digit is 3 , 9 C + 7 + 9 B ( m o d 1 0 ) must be equal to 3 . 7 2 + 7 + 9 B = 7 9 + 9 B = 9 + 9 B = 9 ( B + 1 ) ( m o d 1 0 ) . Hence, B + 1 = 7 or B = 6 . Now, solving for A, 9 9 9 ( A ) ( 1 0 0 ) + ( 9 9 9 ) ( 6 8 ) ≡ 1 3 2 ( m o d 1 0 0 0 ) ( − 1 ) ( A ) ( 1 0 0 ) + ( − 1 ) ( 6 8 ) ≡ 1 3 2 ( m o d 1 0 0 0 ) 2 0 0 + 1 0 0 A ≡ 0 ( m o d 1 0 0 0 ) so, A = 8 giving us the 3 digit number A B C as 8 6 8 .Hence, 9 9 9 ∗ 8 6 8 = 8 6 7 1 3 2
There's a simpler solution for this. Hint: 9 9 9 + 1 = 1 0 0 0 .
But this is a solution! And not a bad one at all; being iterative, it’s easy to solve mentally.
Seeing multiple ways to solve a problem is a beautiful thing. That’s why I love reading all the diverse problem solving methods for each question on Brilliant.
999 = -1 (mod 1000) DEF132 = 132 (mod 1000) => -abc = 132 (mod 1000) <=> abc = 868
Problem Loading...
Note Loading...
Set Loading...
9 9 9 × A B C = A B C ( 1 0 0 0 − 1 ) = A B C 0 0 0 − A B C = D E F 1 3 2 ⇒ 1 0 0 0 − A B C = 1 3 2 ⇒ A B C = 8 6 8 ⇒ 9 9 9 × 8 6 8 = 8 6 7 1 3 2 ⇒ A + B + C + D + E + F = 8 + 6 + 8 + 8 + 6 + 7 = 4 3