What's n n ?

Let n n be a the smallest positive integer such that n + 2 n + 3 n + + 99 n n + 2n + 3n + \cdots + 99n is a perfect square . Find the number of digits of n 2 n^2 .

3 1 2 more than 3

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.

2 solutions

Rishabh Jain
Jul 12, 2016

The sum is:

n ( 1 + 2 + + 99 ) = n × 99 × 100 2 = 11 n 2 × ( 900 ) n(1+2+\cdot+99)=n\times \dfrac{99\times 100}2=\dfrac{11n}{2}\times (900)

Now we know 900 900 is a perfect square then for whole number to be a perfect square 11 n 2 \dfrac{11n}{2} must be a perfect square and it happens if we arrange one 11 11 in numerator for completing its pair and arrange a 2 2 in numerator for taking care of denominator we are done. Hence n = 11 × 2 n=11\times 2 . n 2 = 484 n^2=484 , which implies number of digits in n 2 n^2 is 3 3 .

Chew-Seong Cheong
Jul 12, 2016

Consider

S = n + 2 n + 3 n + + 99 n = ( 99 ) ( 100 ) n 2 = 2 3 2 5 2 11 n \begin{aligned} S & = n + 2n + 3n + \cdots + 99n \\ & = \frac {(99)(100)n}2 \\ &= \color{#D61F06}{2}\cdot 3^2 \cdot 5^2 \cdot \color{#D61F06}{11} \cdot n \end{aligned}

The smallest perfect square S 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 11 n = 2\cdot 11 to make S = 2 2 3 2 5 2 1 1 2 S=\color{#D61F06}{2^2}\cdot 3^2\cdot 5^2\cdot \color{#D61F06}{11^2} . Therefore n 2 = 2 2 1 1 2 = 484 n^2 = 2^2\cdot 11^2 = 484 which has 3 \boxed{3} digits.

same system .

Abdullah Ahmed - 4 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...