Does a Perfect Square Lie Within these 10 Integers?

  • Thread starter Thread starter myth_kill
  • Start date Start date
  • Tags Tags
    Integers Square
myth_kill
Messages
19
Reaction score
0
Do there exist 10 distinct integers such that the sum of any 9 of them is a perfect
square.
 
Physics news on Phys.org
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.
 
coolul007 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.
You merely have to make each variable distinct and divisible by 9
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top