Dick said:
Equate the two sides component by component. That's three equations in three unknowns. The first one is C1*(-2)+C2*(-3)+C3*1=0.
Thanks! Here's what I tried:
1: C1(-2) + C2(-3) + C3(1) = 0
2: C1(9) + C2(2) + C3(7) = 5
3: C1(6) + C2(1) + C3(5) = 4
I've eliminated C2 and ended up with 2 new equations:
C1(-7) + C3(-3) = -3
C1(16) + C3(16) = 12
I guess from here I could solve for either C1 or C3, then go back to the original equations, plugging it in, and solving again (3 equations, with 2 unknown this time), is that right? Also, at what point will I reach
the end (ie. when will it be clear that there's no solution)
Another thing, seeing how this is for a linear class, I was tempted to use matrices and start with the following:
[-3 4 6 | 2]
[ 1 0 -1 | 0]
[ 2 -8 -4 | 4]
Would that work? If so, should I try to solve for [1 0 0], [0 1 0], [0 0 1] system, and whenever I get to the point where I can do anything, I "proved" that this problem has no solution?
Thanks!