Five-digit number 2 a 9 b 1 is a perfect square.
Find the value of a b + b a .
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.
minimum and maximum of 2 a 9 b 1 = y 2 are 2 0 9 0 1 and 2 9 9 9 1 , respectively. Using a calculator, the square roots of the number are approximately 1 4 4 and 1 7 3 . So y is either the form 1 x 1 or 1 x 9 , because the last digit go the square number is 1 . Therefore, we need to search 2 × 3 (because the second digit of 1 x 1 or 1 x 9 is bounded by 4 and 7 ) numbers to see which has the form 2 a 9 b 1 , when taken to the power of two. turns out the number is 2 5 9 2 1 = 1 6 1 . Finally calculate a b + b a = 5 2 + 2 5 = 5 7
Is there any other way than checking all 6 numbers? I also did same
Log in to reply
Oh, u did the same? :) Well, this is an easy approach, with a bit of reasoning to narrow down the possibilities. But I suppose there should be better approaches.
But he wrote 144 < root < 174, then it must be just six checking to be done, right?
Log in to reply
oh, did I tell you, you are smart? thanks for pointing out, cause I kinda ignored the fact. I have edited the solution
Ya you are right
Problem Loading...
Note Loading...
Set Loading...
Let positive integer N = 2 a 9 b 1 . Then the range of N is given by: ⌈ 2 0 9 0 1 ⌉ ≤ N ≤ ⌊ 2 9 9 9 1 ⌋ or 1 4 5 ≤ N ≤ 1 7 3 . Then N is a 3-digit integer of the form N = 1 m n . Since the perfect square 2 a 9 b 1 ends with 1, n can only be 1 or 9 and m = 4 , 5 , 6 , 7 .
For n = 1 , then ( 1 0 1 + 1 0 m ) 2 = 1 0 2 0 1 + 2 0 2 0 m + 1 0 0 m 2 = 2 a 9 b 1 . Equating the hundredth digit on both sides, we have:
⌊ 1 0 0 2 0 m ⌋ + ⌊ 1 0 0 1 0 0 m 2 ⌋ m o d 1 0 + 2 ⌊ 5 m ⌋ + m 2 m o d 1 0 ⟹ m = 9 = 7 = 6
Then N = 1 6 1 and N 2 = 1 6 1 2 = 2 5 9 2 1 , acceptable.
For n = 9 , then ( 1 0 9 + 1 0 m ) 2 = 1 1 8 8 1 + 2 1 8 0 m + 1 0 0 m 2 = 2 a 9 b 1 . Equating the hundredth digit on both sides,
( ⌊ 1 0 1 8 m + 8 8 ⌋ + m 2 ) m o d 1 0 ( ⌊ 5 9 m + 4 4 ⌋ + m 2 ) m o d 1 0 = 9 = 9
where m = 4 , 5 , 6 . For m = 4 , 5 , 6 , the LHS = 2 , 2 , 5 (mod 10) respectively. So there is no solution.
Therefore, N 2 = 2 5 9 2 1 , ⟹ a b + b a = 5 2 + 2 5 = 2 5 + 3 2 = 5 7 .