myth_kill
- 19
- 0
Do there exist 10 distinct integers such that the sum of any 9 of them is a perfect
square.
square.
The discussion centers on the mathematical problem of determining whether there exist 10 distinct integers such that the sum of any 9 of them results in a perfect square. The equations provided utilize a formula involving the squares of the integers, specifically structured as a = 1/9 (p^2 + q^2 + r^2 + s^2 + t^2 + u^2 + v^2 + w^2 + x^2 - 8y^2), and similar forms for the other variables. The use of Mathematica is highlighted as a tool for computation, emphasizing the need for distinct integers that are also divisible by 9.
PREREQUISITESMathematicians, students studying number theory, and anyone interested in solving complex algebraic problems involving perfect squares and integer properties.
You merely have to make each variable distinct and divisible by 9coolul007 said:a = 1/9 (p^2 + q^2 + r^2 + s^2 + t^2 + u^2 + v^2 + w^2 + x^2 - 8 y^2),
b =1/9 (p^2 + q^2 + r^2 + s^2 + t^2 + u^2 + v^2 + w^2 - 8 x^2 + y^2),
c= 1/9 (p^2 + q^2 + r^2 + s^2 + t^2 + u^2 + v^2 - 8 w^2 + x^2 + y^2),
d=1/9 (p^2 + q^2 + r^2 + s^2 + t^2 + u^2 - 8 v^2 + w^2 + x^2 + y^2),
e = 1/9 (p^2 + q^2 + r^2 + s^2 + t^2 - 8 u^2 + v^2 + w^2 + x^2 + y^2),
f = 1/9 (p^2 + q^2 + r^2 + s^2 - 8 t^2 + u^2 + v^2 + w^2 + x^2 + y^2),
g = 1/9 (p^2 + q^2 + r^2 - 8 s^2 + t^2 + u^2 + v^2 + w^2 + x^2 + y^2),
h = 1/9 (p^2 + q^2 - 8 r^2 + s^2 + t^2 + u^2 + v^2 + w^2 + x^2 + y^2),
i = 1/9 (p^2 - 8 q^2 + r^2 + s^2 + t^2 + u^2 + v^2 + w^2 + x^2 + y^2),
j = 1/9 (-8 p^2 + q^2 + r^2 + s^2 + t^2 + u^2 + v^2 + w^2 + x^2 + y^2)
Mathematica did all the donkey work, so now you have to play with perfect squares to resolve each integer.