Let n be a the smallest positive integer such that n + 2 n + 3 n + ⋯ + 9 9 n is a perfect square . Find the number of digits of n 2 .
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.
Consider
S = n + 2 n + 3 n + ⋯ + 9 9 n = 2 ( 9 9 ) ( 1 0 0 ) n = 2 ⋅ 3 2 ⋅ 5 2 ⋅ 1 1 ⋅ n
The smallest perfect square S is one with the least number of squared prime factors . The remaining two prime factors not squared are 2 and 11, therefore n = 2 ⋅ 1 1 to make S = 2 2 ⋅ 3 2 ⋅ 5 2 ⋅ 1 1 2 . Therefore n 2 = 2 2 ⋅ 1 1 2 = 4 8 4 which has 3 digits.
same system .
Problem Loading...
Note Loading...
Set Loading...
The sum is:
n ( 1 + 2 + ⋅ + 9 9 ) = n × 2 9 9 × 1 0 0 = 2 1 1 n × ( 9 0 0 )
Now we know 9 0 0 is a perfect square then for whole number to be a perfect square 2 1 1 n must be a perfect square and it happens if we arrange one 1 1 in numerator for completing its pair and arrange a 2 in numerator for taking care of denominator we are done. Hence n = 1 1 × 2 . n 2 = 4 8 4 , which implies number of digits in n 2 is 3 .