Analyzing the Setup
The given system of equations is:
(1) x−2y+5z=0
(2) −2x+4y+z=0
(3) −7x+14y+9z=0
Since the constant term on the right side of every equation is zero, this is a homogeneous system. Such systems always possess the trivial solution (0,0,0), but we are tasked with finding non-trivial integer solutions satisfying the constraint 15<x2+y2+z2<150.
Unmasking the Line
Observe that the coefficients of x and y in equation (2) are exactly −2 times the coefficients in equation (1). This indicates that the equations are linearly dependent.
To simplify, multiply equation (1) by
2:
2x−4y+10z=0
Now, add this to equation (2):
(2x−4y+10z)+(−2x+4y+z)=0
11z=0⟹z=0
With z=0, the system reduces to x−2y=0, or x=2y. Thus, any solution must take the parametric form (2k,k,0) for some integer k.
The Geometric Constraint
We apply the magnitude constraint 15<x2+y2+z2<150. Substituting our parametric form (2k,k,0) into this inequality:
15<(2k)2+k2+02<150
15<4k2+k2<150
15<5k2<150
Dividing the entire inequality by
5, we obtain:
3<k2<30
The Integer Hunt
We must identify all integers k such that k2 is a perfect square between 3 and 30. The possible values for k2 are 4,9,16, and 25.
This yields the following possibilities for k:
k2=4⟹k=±2
k2=9⟹k=±3
k2=16⟹k=±4
k2=25⟹k=±5
Each value of k corresponds to a unique integer triplet (x,y,z). Since there are 4 positive values and 4 negative values for k, there are a total of 8 distinct integer solutions.