× A A A C B B D
Find the number of solutions satisfying the cryptogram above.
Note: Different letters represent differet digits.
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.
I'd say your solution is the best out of the 4 , @Chew-Seong Cheong
For A B > 1 4 , there is no two digit number whose square is a three digit number with the hundred's place digit A .
So, we have to check only five numbers : 1 0 , 1 1 , 1 2 , 1 3 , 1 4
We see that only 1 3 and 1 4 are the numbers satisfying the given cryptogram.
( 1 0 A + B ) × ( 1 0 A + B ) 1 0 0 A 2 + 2 0 A B + B 2 1 0 A 2 + 2 A B + B 2 = 1 0 0 A + 1 0 C + D = 1 0 0 A + 1 0 C + D = 1 0 A + C + 1 0 D
I can't complete it algebraically so by Trial and Error -
1 3 2 = 1 6 9 1 4 2 = 1 9 6 an we have our 2 solutions :)
I just write the answer directly
13² = 169
14² = 196
Problem Loading...
Note Loading...
Set Loading...
Obviously A can only be 1 . Because if A = 2 or 3 , the hundreds digit of the product would be 4 or 9 respectively and if A ≥ 4 , there would be a thousands unit. This means that A B ≤ ⌊ 1 9 9 ⌋ = 1 4 . Since 1 0 2 = 1 0 0 , 1 1 2 = 1 2 1 , 1 2 2 = 1 4 4 , 1 3 2 = 1 6 9 , and 1 4 2 = 1 9 6 . Only 2 solutions A B = 1 3 and 1 4 satisfy the cryptogram.