(Neil B. beat me to this but is too shy...) In Mathematica 8 and 7 and probably back to 5, In[63]:= Reduce[-c y + b z == f && c x - a z == g && -b x + a y == h, {x, y, z}] Out[63]= (f != 0 && a == (-b g - c h)/f && a != 0 && y == (h + b x)/a && z == (-g + c x)/a) || (f == 0 && g != 0 && b == -((c h)/g) && a != 0 && y == (h + b x)/a && z == (-g + c x)/a) || (h == 0 && g == 0 && f == 0 && c == 0 && b == 0 && a == 0) || (h == 0 && g == 0 && f == 0 && a != 0 && y == (b x)/a && z == (c x)/a) || (f == 0 && g != 0 && b == -((c h)/g) && a == 0 && b != 0 && x == -(h/b) && z == (c y)/b) || (g == 0 && c == 0 && a == 0 && b != 0 && x == -(h/b) && z == f/b && f h != 0) || (g == 0 && f == 0 && h != 0 && c == 0 && a != 0 && y == (h + b x)/a && z == 0) || (h == 0 && b == 0 && a == 0 && c != 0 && x == g/c && y == -(f/c) && f g != 0) || (h == 0 && g == 0 && a == 0 && x == 0 && b != 0 && z == (f + c y)/b && f != 0) || (h == 0 && g == 0 && f == 0 && a == 0 && b != 0 && x == 0 && z == (c y)/b) || (g != 0 && b == -((c h)/g) && a == 0 && b != 0 && x == -(h/b) && z == (f + c y)/b && f != 0) || (g == 0 && f == 0 && c == 0 && a == 0 && b != 0 && x == -(h/b) && z == 0 && h != 0) || (h == 0 && f == 0 && b == 0 && a == 0 && c != 0 && x == g/c && y == 0 && g != 0) || (h == 0 && g == 0 && b == 0 && a == 0 && x == 0 && c != 0 && y == -(f/c) && f != 0) || (h == 0 && g == 0 && f == 0 && b == 0 && a == 0 && c != 0 && x == 0 && y == 0) The first "Orand" contains your a f + b g + c h =0 constraint. The future is now? --rwg From: Fred lunnon <fred.lunnon@gmail.com <http://gosper.org/webmail/src/compose.php?send_to=fred.lunnon%40gmail.com>> To: math-fun <math-fun@mailman.xmission.com <http://gosper.org/webmail/src/compose.php?send_to=math-fun%40mailman.xmission.com>> Sent: Sat, February 19, 2011 6:53:26 PM Subject: [math-fun] (yawn!) Simultaneous Linear Equations with Literal Coefficients Everybody can solve these, can't they --- just like quadratic equations ... Here's a simple example: solve for x,y,z, b z - c y = f , c x - a z = g , a y - b x = h . Oops --- the determinant vanishes: | c 0 -a | | -b a 0 | = 0 . | 0 -c b | No solution, says our CAS equation solver, firmly. Except of course, if the RHS also vanishes there is obviously a 1-dimensional homogeneous solution; but simply substituting f,g,h -> 0 should encourage our CAS to disgorge some version of that too. End of story? Not quite: you see, adding a equn1 + b equn2 + c equn3 eliminates all variables, leaving a f + b g + c h = 0 ; and in my particular application, this constraint happens to be satisfied by the coefficients. Now some head-scratching unearths a 3-dimensional (in general) solution spanned by the symmetric linear basis [ x -> -h/b, y -> 0, z -> +f/b ] , [ x -> +g/c, y -> -f/c, z -> 0 ] , [ x -> 0, y -> +h/a, z -> -g/a ] . In particular, summing eventually delivers the symmetric solution x -> (g/c - h/b)/3 , y -> (h/a - f/c)/3 , z -> (f/b - g/a)/3 , which I knew ought to exist by the symmetry of the equations. I have encountered this type of problem --- solving SLE's on a manifold --- on a number of occasions, without ever finding an effective solution algorithm. Surely it must have been considered before --- any pointers, anyone? Is it reasonable to expect that the next generation of CAS solvers might inform us about constraints on our coefficients under which such equations might possess extra solutions? Fred Lunnon