168M2 · Linear algebra · extension

Three-Variable Linear Equations

Three-Variable Linear Equations

Linear algebra extension. Three-Variable Linear Equations. Use CMPLX/Deg, but enter real numbers only: each equation as ax+by+cz=d, then its four coefficients, row by row. There are twelve entries, without a mode code or imaginary i. Normal output is x,y,z. A single −1 means no solution; −2 means no unique solution; −3 is numerical refusal, not proof of inconsistency. The program uses 485 of 680 shared bytes, leaving 195 if installed alone.

  • 485 bytes
  • CMPLX mode
01

Worked examples

Example 1

Original exercise. Linear algebra extension. Data: x,y,z∈ℝ; x+y+z=6; 2x−y+3z=9; 3x+2y−z=4. Find: S={(x,y,z)∈ℝ³: Au=b}. Calculate all requested quantities in the stated order.

Answer
(x,y,z)=(1,2,3)
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data.
  2. x+y+z=6; 2x−y+3z=9; 3x+2y−z=4
  3. (2)−2(1): −3y+z=−3; (3)−3(1): −y−4z=−14
  4. z=3y−3⇒−y−4(3y−3)=−14⇒y=2
  5. z=3; x=6−2−3=1; det(A)=13≠0
  6. 1+2+3=6; 2−2+9=9; 3+4−3=4
  7. Combine the preceding results to obtain the answer.
Do it on the calculator

Example 2

Original exercise. Linear algebra extension. Data: x,y,z∈ℝ; 2y−z=4; 3x+z=−3; x+y+2z=1. Find: x,y,z; x+2y+3z. Calculate all requested quantities in the stated order.

Answer
(x,y,z)=(−1,2,0); x+2y+3z=3
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data.
  2. 2y−z=4; 3x+z=−3; x+y+2z=1
  3. z=−3−3x; y=(4+z)/2
  4. 2x+5z=−2⇒2x+5(−3−3x)=−2⇒x=−1
  5. z=0; y=2; det(A)=−13≠0
  6. 2×2−0=4; 3(−1)+0=−3; −1+2+0=1
  7. x+2y+3z=−1+4+0=3
  8. Combine the preceding results to obtain the answer.
Do it on the calculator

Example 3

Original exercise. Linear algebra extension. Data: x,y,z∈ℝ; x+2y+z=5; 2x+4y+2z=10; y−z=1. Find: S={(x,y,z)∈ℝ³: Au=b}. Calculate all requested quantities in the stated order.

Answer
(x,y,z)=(3−3t,1+t,t), t∈ℝ
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data.
  2. (1): x+2y+z=5; (2)=2(1); (3): y−z=1
  3. r(A)=r([A∣b])=2<3
  4. z=t⇒y=1+t⇒x=5−2(1+t)−t=3−3t
  5. (3−3t)+2(1+t)+t=5; 2×5=10; (1+t)−t=1
  6. t∈ℝ; (x,y,z)=(3−3t,1+t,t)
  7. The third equation must be checked separately: early −2 alone does not certify infinitely many solutions.
  8. Combine the preceding results to obtain the answer.
Do it on the calculator
02

When to use it

Linear algebra extension. Three-Variable Linear Equations. Use CMPLX/Deg, but enter real numbers only: each equation as ax+by+cz=d, then its four coefficients, row by row. There are twelve entries, without a mode code or imaginary i. Normal output is x,y,z. A single −1 means no solution; −2 means no unique solution; −3 is numerical refusal, not proof of inconsistency. The program uses 485 of 680 shared bytes, leaving 195 if installed alone.

Input order

  • a₁,b₁,c₁,d₁; a₁x+b₁y+c₁z=d₁
  • a₂,b₂,c₂,d₂; a₂x+b₂y+c₂z=d₂
  • a₃,b₃,c₃,d₃; a₃x+b₃y+c₃z=d₃
  • Enter every required value again, including 0. Blank EXE retains memory; it is not zero. Used registers and Ans are overwritten.

Output order

  • x
  • y
  • z
  • Record the value and press EXE.
  • The program has ended. Press AC to leave; EXE runs it again.

Conditions and limitations

  • aᵢ,bᵢ,cᵢ,dᵢ∈ℝ; i=1,2,3
  • 485+195=680 bytes
  • Use CMPLX/Deg, but enter real numbers only: each equation as ax+by+cz=d, then its four coefficients, row by row. There are twelve entries, without a mode code or imaginary i. Normal output is x,y,z. A single −1 means no solution; −2 means no unique solution; −3 is numerical refusal, not proof of inconsistency. The program uses 485 of 680 shared bytes, leaving 195 if installed alone.
  • If the first two equations are dependent, the program stops after eight entries. Early −2 establishes only that a unique solution is impossible; the third equation has not been read, so consistency of the full system must be checked in writing. Early −1 is already a contradiction. After twelve entries, −2 still gives no parameter family. A negative coordinate in a three-screen run is not an error. Large scale differences, cancellation or near-singularity can lose accuracy; use exact elimination near degeneracy.
  • Enter every required value again, including 0. Blank EXE retains memory; it is not zero. Used registers and Ans are overwritten.
  • Finite precision can lose small differences between large numbers or probabilities extremely near 0 or 1. An error marker is never a valid answer.

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.

Checking access…

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.