× A D B C C B D 9 A
If A , B , C and D are distinct digits that satisfy the cryptogram above, find A + B + C + D .
Note : The leading digits cannot be zero.
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.
Here's a step by step solution:
[ b ] r D C B A [ b ] r A B C D × 9
Now, we know that A = 0 . If A > 1 , the product will be a 5 digit number, and that does not satisfy the cryptogram. From here, we can confirm that A = 1
From here, we know that D × 9 gives us a number that ends with 1 . Looking at the multiplication table, only 9 × 9 = 8 1 satisfies the requirement. Therefore,
D = 9
Substitute these two numbers into the cryptogram, and we get:
[ b ] r 9 C B 1 [ b ] r 1 B C 9 × 9
Now, we convert it into an equation as below:
( 1 0 0 9 + 1 0 0 B + 1 0 C ) ( 9 ) = 9 0 0 1 + 1 0 0 C + 1 0 B
Simplifying this equation gives:
8 9 B + 8 = C
Now, remember that the values of B and C are integers for a digit, which gives:
0 ≤ B ≤ 9 0 ≤ C ≤ 9
If B > 0 , C will definitely be larger than 9 , and that does not satisfy the cryptogram.
Therefore, the only solution is B = 0 , and C = 8 9 ( 0 ) + 8 = 8 .
The solved cryptogram is
[ b ] r 9 8 0 1 [ b ] r 1 0 8 9 × 9
Calculate the final answer: A + B + C + D = 1 + 0 + 8 + 9 = 1 8
Well explained :).
If ABCD is greater than 1111, then the solution will be a 5 digit number, and thus be null.
Therefore, A must equal 1, and B 0. Therefore, 1000<ABCD<1111. Any of these values multiplied by 9 give 9 as the leading coefficient.
From here, C is easy to solve for, by doing multiplication we can see that the 8 will carry over from D*9, giving 8+9C = 10C+0, C = 8.
(Sorry, that last bit was poorly worded)
The four digit number when multiplied by 9 gives a 4 digit number which means that A must be 1 and since the result of A * 9=D , D must be 9. Since the thousand digit of the result is the result of A * 9 plus the result of the decimal digit of B * 9 B must be 0 and since D * 9 = 9 * 9=81 it means that the decimal digit of the result that is B which is 0 is the result of 8 to which we add the unit digit of the product C*9 this being 2 therefore being that C is 8 which means that A = 1 , B = 0 , C = 8 , D = 9 which added gives 18.
The numbers are: A = 1 , B = 0 , C = 8 , D = 9 .
The cryptarithm was 1 0 8 9 × 9 = 9 8 0 1 .
/ Here is the c program which gives you the answer.TRY it on online compiler. http://www.compileonline.com/compile_c_online.php Code is..................................................................................................................... /
int reverse(int a) {int rev=0,m; m=a; while(m>0) { rev=10*rev+m%10; m=m/10; } return rev; }
void main() {int i; for(i=1;i<=9999;i++) if(reverse(i)==9*i) printf("The answer is %d.",i);
}
Problem Loading...
Note Loading...
Set Loading...
First, we all know A = 1 , D = 9 .
1 B C 9 = 1 0 0 9 + B C × 1 0 .
1 B C 9 × 9 = 9 0 8 1 + B × 9 0 0 + C × 9 0 .
9 C B 1 = 9 0 0 1 + B × 1 0 + C × 1 0 0 .
Now we have this equation:
9 0 8 1 + B × 9 0 0 + C × 9 0 = 9 0 0 1 + B × 1 0 + C × 1 0 0 .
B × 8 9 0 + 8 0 = C × 1 0 .
B × 8 9 + 8 = C .
If C = 8 , there's no solution for B .
If C = 8 then B = 0 .
A + B + C + D = 1 + 0 + 8 + 9 = 1 8 .