Rouché–Capelli theorem

The theorem syas:

"A system of linear equations with n variables has a solution if and only if the rank of its coefficient matrix A is equal to the rank of its augmented matrix [A|b].^[1] If there are solutions, they form an affine subspace of R n {\displaystyle \mathbb {R} ^{n}}

of dimension n − rank(A). In particular:

• if n = rank(A), the solution is unique,
• otherwise there are infinitely many solutions."

In your both your cases the rank of the matrix and the augmented matrix are the same. But in case1 that rank is 4, unequal to the number of equations, so there are infinitely many solutions.

In the second case you picked one solution,  so the rank equals the number of equations.

The discrepancy is probably caused by the larger difference in X and Y values for the second case 2. I guess in case 1 you loose precision due to the large numbers all close together.

The numeric rank function is limited by numeric precision. I get this from the symbolic processor:

What does the symbolic processor in Prime say about the rank?

Success!
Luc