If A and B are three-digit positive integers, let A # B denote the six-digit integer formed by placing A and B side by side. Find the SUM of all the possible values of A and B such that:
A , B , B − A , A # B , B A # B
are all integer squares.
Note that A , B ≥ 1 0 0 .
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.
If A = B , then B A # B = A A # A = A 1 0 0 1 A = 1 0 0 1 will not be a square. Therefore B > A . Let B = b 2 and A = a 2 , where 1 0 ≤ a < b ≤ 3 1 .
Note that if B A # B is a square, then B B A # B = A # B will be a square too. So we just need to check one of them. Hence problem reduces to finding pairs of ( a , b ) , where both of b 2 − a 2 and b 2 a 2 # b 2 are squares. Let a = m d and b = n d , where g cd ( a , b ) = d . We get b 2 a 2 # b 2 = 1 0 0 0 n 2 m 2 + 1 = k 2 It follows that n 2 ∣ 1 0 0 0 because g cd ( m , n ) = 1 . So only possible values for n will be 2 , 5 , 1 0 . Since m < n and g cd ( m , n ) = 1 we have a few cases to check. Only pair of ( m , n ) that makes 1 0 0 0 n 2 m 2 + 1 square is ( 3 , 5 ) .
Now 4 ≤ d ≤ 6 and there are three pairs of ( a = m d , b = n d ) to check. all three of them makes both of b 2 − a 2 and b 2 a 2 # b 2 squares and they are ( a , b ) = ( 1 2 , 2 0 ) , ( 1 5 , 2 5 ) , ( 1 8 , 3 0 ) The answer will be 1 2 2 + 2 0 2 + 1 5 2 + 2 5 2 + 1 8 2 + 3 0 2 = 2 6 1 8
Problem Loading...
Note Loading...
Set Loading...
Since A , B − A and B are all integer squares, their square roots form a Pythagorean triple. Thus, the easiest place to look for numbers meeting the stated conditions is in the multiples of the ( 3 ; 4 ; 5 ) triple. So, letting A = 9 t 2 and B = 2 5 t 2 for an integer t , we see that B − A = 1 6 t 2 ,
A # B = 1 0 0 0 A + B = 9 0 0 0 t 2 + 2 5 t 2 = 9 0 2 5 t 2 = ( 9 5 t ) 2 , and
B A # B = ( 5 t ) 2 ( 9 5 t ) 2 = 1 9 2 .
Any choice of t would yield A and B satisfying all the other conditions, but in order to make A and B three-digit numbers, t would have to be 4 , 5 or 6 , yielding values of ( for ( A , B ) ):
( 1 4 4 , 4 0 0 ) ; ( 2 2 5 , 6 2 5 ) , ( 3 2 4 , 9 0 0 )
These are in fact the only possibilities. Suppose A = x 2 , B − A = y 2 and B = z 2 satisfy the given conditions. Let q = g c d ( x ; y ; z ) , x ′ = q x , y ′ = q y and z ′ = q z .
Then x ′ 2 + y ′ 2 = z ′ 2 and z ′ 2 divides (A \text{ \# } B - B)/q^2 = 1000x'^2 . Since x ′ and z ′ are relatively prime, this means that z ′ 2 must divide 1 0 0 0 , so z ′ must be 1 , 2 , 5 or 1 0 . By inspection, none of the others are possible values, so z ′ must be 5 . We can also rule out the remaining case of x ′ = 4 , y ′ = 3 and z ′ = 5 [that is, A = 1 6 t 2 and B = 2 5 t 2 ] since ( A # B ) / t 2 = 1 6 0 2 5 is not a perfect square.
So, adding the values of all possible values of A , B , we get: 1 4 4 + 2 2 5 + 3 2 4 + 4 0 0 + 6 2 5 + 9 0 0 = 2 6 1 8 .