Let the square number y ^ 2 be the sum of the squares of 11 consecutive integers, and find the minimum value of Y It's the sum of squares! It's not the sum of squares

Let the square number y ^ 2 be the sum of the squares of 11 consecutive integers, and find the minimum value of Y It's the sum of squares! It's not the sum of squares

Y ^ 2 = (X-5) ^ 2 + (x-4) ^ 2 + (x-3) ^ 2 + (X-2) ^ 2 + (x-1) ^ 2 + x ^ 2 + (x + 1) ^ 2 + (x + 2) ^ 2 + (x + 3) ^ 2 + (x + 4) ^ 2 + (x + 5) ^ 2 = 11x ^ 2 + 2 * (1 + 4 + 9 + 16 + 25) = 11x ^ 2 + 110 = 11 (x ^ 2 + 10) y ^ 2 is a complete square number, 11 is a prime number, so x ^ 2 + 10 = 11n when n = 1, the minimum value of Y ^ 2 is 121y, which should be no

Let the square of the square number y be the sum of the squares of 11 consecutive integers, then the minimum value of Y
fast

Doesn't that seem to be true?
If y is not required to be a square number, then the sum of squares of 11 consecutive integers from 18 to 28 is 5929, which is the square of 77
If y is a square, there is no answer within 100 million
If even y is not required to be positive, then the smallest y is 11 and its square is the sum of the squares of - 6 to 4

A is a non-zero natural number. The largest number in the following formula is ()
A is a non-zero natural number. The largest number in the following formula is () a ax4 3 / 4 B ax1 C a △ 1 d a △ 4 3 / 4

D