× A D B C C B D 9 A
Let A , B , C and D be non-negative single digit integers satisfying the cryptogram above with A , D = 0 . Find 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.
Ha, that's tricky!
Amazing! I loved this method. I went through finding values of each. I guess this is how the problem was to be solved.
A B C D × 9 ⇒ A B C D × ( 1 0 − 1 ) A B C D 0 − A B C D = D C B A = D C B A = D C B A
− A B A D C B C D C B 0 D A
From the above, for A B − A = D or A B − A − 1 = D ⇒ A must be 1 . And for 1 0 − D = A = 1 ⇒ D = 9 .
− 1 B 1 9 C B C 9 C B 0 9 1
For ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 1 B − 1 = 9 1 B − 1 − 1 = 9 ⇒ B = 0 ⇒ C − B = C ⇒ B = 1 ⇒ C − B = C ⇒ 8 − C = 0 ⇒ 8 − 0 = 0 ⇒ 8 − C = 1 ⇒ 7 − 1 = 6 ⇒ C = 8 ⇒ Acceptable ⇒ C = 7 ⇒ B = 1 and 6
Therefore, A B C D = 1 0 8 9 and 1 0 8 9 × 9 = 9 8 0 1 ⇒ A × B × C × D = 0
Great job reasoning out what the answer must be.
From multiplying A × 9 (and adding the carry from the previous multiplications) we get a single digit D . This means that A ∈ { 0 , 1 } (otherwise we would have a 2 digit number).
Since we are told that A = 0 then A = 1 , so A × 9 = 9 and there is no carry from the multiplication of B C D × 9 . This implies that D = 9 .
Now, B C D × 9 = 9 × D + B C 0 × 9 = 8 1 + B C × 9 0 But the only way for this to be a 3 digit number (namely have no carry) is by making either B , C = 0
Finally A × B × C × D = 0
Problem Loading...
Note Loading...
Set Loading...
Note that,
A B C D ∣ D C B A So,
A B C D < = D C B A
And
A B C D < 1 1 1 1 [Because otherwise A B C D × 9 will be a 5 digit number]
So,
B, C or D will be 0 .
So,
A × B × C × D = 0 .