Linear System Solver

• Enter Augmented matrix with 1–6 rows and 1–6 coefficients per row. Separate coefficients with ASCII spaces or tabs, then enter one | and one right-hand-side token.
• Use signed integers or fractions such as -2/3. Every row must have the same coefficient count. Outer blank lines are allowed; internal blank rows reject.
• Select Solve exactly, then Download result to save linear-system-report.json. Read zero-based pivot/free indices and exact n/d fraction strings. Edit input or Reset clears the result; Cancel discards unfinished work.

1 2 | 5 followed by 3 4 | 11 produces the unique exact solution x1=1/1 and x2=2/1, together with the full augmented RREF.

• At most 1–6 equations and 1–6 unknowns, 8,192 UTF-16 input units and 12 ASCII digits in each signed numerator or denominator. Denominators must be nonzero.
• Exact arithmetic is admitted within a conservative 4,096-digit intermediate budget, at most 252 cell updates, 64 KiB JSON and 30 seconds. Rectangular systems are allowed.
• Decimals, exponent notation, symbolic coefficients, variable-name inference and expression evaluation are unsupported. Leading zeros count toward the input digit limit.
• The full augmented RREF uses deterministic leftmost pivots and first available pivot rows. Report indices are zero-based. Fractions are reduced n/d strings with positive denominators, including 0/1.
• For inconsistent systems, particular is null and nullspace is empty. This tool does not return a least-squares approximation, numerical condition estimate or floating-point tolerance result.