Hello,
sage: A = matrix([[1, 0.106, 1.212], [3.8759765625, 0.04801171875,
: 3.972], [3.0625, 0.09325, 3.249]])
sage: A.rank()
3
sage: A.det()
0.000
Though sage computes the rank to be 3, the determinant is negligible.
Mathematica says the rank of this matrix is 2, and that its
det
> Thus (0,0,0) is the unique solution of your system.
Uh... not quite 'Thus'. The system in fact has an infinite number of
unique solutions, as the original poster pointed out. Though I don't
know why sage converges on [0,0,0]. Also just because a second sage
method gives the same result as the fi
