[Math] the smallest integer $n$ greater than $1$ such that the root mean square of the first $n$ integers is an integer

elementary-number-theory

What is the smallest integer $n$ greater than $1$ such that the root mean square of the first $n$ integers is an integer?

The root mean square is defined as:

$$\sqrt{\left(\frac{a_1^2 + a_2^2 + a_3^2+\dots+a_n^2}{n}\right)}$$

I started off by the relation:

$$\sum^n_{i = 1}i^2 = \frac{n(n+1)(2n+1)}{6}$$

We need an $n$ such that:

$$\sqrt{\frac{n(n+1)(2n+1)}{6n}} = k$$

$$\implies (n+1)(2n+1) = 6k^2$$

$$\implies 2n^2 + 3n + (1-6k^2) = 0$$

$$\implies n = \frac{-3 \pm \sqrt{9 – 8(1-6k^2)}}{4} = \frac{-3 \pm \sqrt{1 + 48k^2}}{4}$$

For the equation to have rational solutions $1 + 48k^2$ must be a perfect square. So, the problem boils down to solving the smallest $k$ such that $1 + 48k^2$ is a perfect square.

I have no idea how to proceed.

Best Answer

It involves solving the equation $x^2-48y^2=1$ in integers $x,y$ since it has a smallest solution $(7,1)$ we get infinitely many solutions $(x_n,y_n)$ from the relations $(x_n+y_n\sqrt{48})=(7+\sqrt{8})^n$.And if you don't know how I reached this relation then visit the following link: http://en.wikipedia.org/wiki/Pell%27s_equation

Related Question