What is the minimum value of the positive integer such that both and are perfect squares?
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.
The square of any number can have unit's digits as 0 , 1 , 4 , 5 , 6 , 9 In case of 4 n + 1 , n can not take the values 3, 8, 13,... because at these values, the unit's place of 4 n + 1 will be 3 which is not permissible in case of squres. Similarly n can not be 4 , 9 , 1 4 , 1 9 . . . . In case of 6 n + 1 the values of n which are not permissible include 1 , 6 , 1 1 , 1 6 , . . & 2 , 7 , 1 2 , 1 7 . . . . So we are left with n = 5 k where k is positive integer. Putting n = 5 , 1 0 , 1 5 , 2 0 . . We find the minimum value to be n = 2 0 .