Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

algebra senior

Problem

Find the number of ordered 17-tuples of integers, such that the square of any number in the 17-tuple is equal to the sum of the other 16 numbers.
Solution
Let Then from the given condition, for all In other words, each is a root of This quadratic has at most two roots, which means that there are at most two different values among the for any particular 17-tuple.

Suppose that all the are equal, say Then so from the equation Then so or

Otherwise, there are exactly two different values among the say and Suppose that of the are equal to so the remaining values are equal to where Then Since and are the roots of by Vieta's formulas, and Hence, From Substituting, we get This simplifies to Since is an integer, the discriminant of this polynomial must be a perfect square. Thus, is a perfect square, which means is a perfect square.

Checking all values in we find that is a perfect square only for and

For equation becomes so or The respective values of are and

So one possibility is that five of the are equal to and the remaining 12 are equal to 1. There are 17-tuples of this form. Another possibility is that five of the are equal to and the remaining 12 are equal to 5. There are 17-tuples of this form.

The case leads to the same possibilities. Therefore, the total number of 17-tuples is
Final answer
12378