1H The point of intersection sts the eysim of two Tnear equations: ay t2e 124 Any [i a 1 Replace R2 by R2+ RI and obtain: i a 4 124 Sete ty big Replace R1 by RI + (-2)R2: ‘The point of intersection is (r1.%2)= 2, 1). fl Ordinal, the next step would feo interchange R3 ard Ro puta Lin he thd ow ad hed Column But in this as, he hid row of the augmented mats coresponde tthe guaion Ox +0 2+ sye I orsinply,O= 1A system conning hs ction hes no soluion Tarthertow cperatios ae unneresiary once an equation suchas O= lis evident The soliton slis empl. I The system has already been reduced to triangular form. Begin by replacing R3 by R3 + (3)R4: 1-10 0S] fl 4 00 -s o 12 07 lo 1 204 oo 1-3 27/0 0 10 oo 0 1 4 fo o on 4 ‘Next replace R2 by R2+ (2)R3. Finally, replace RI by RI + R2: 1100s) fl 0006 o 100 4) |0 100% “lo 0 10 wl lo o 10 a jo oot slp 001 4 ‘The solution set contains one solution: (16,21, 14,4). a Fi sp RI an 2 Then ean HS by 3 +R imps Sry RS +2, 015 4) [1 43 2) rasadors allot sale 3 2712) 1271 2 doo a ‘The system is inconsistent, because the last row would require that 0 =—2if there were a solution. The solution setis empty. 1B Firs, replace R3 by R3 + (1)R1. then replace Rd by R4 + (1)R2, and finally replace R4 by Ré + (— DRS. 16 005) [1 6 005] 71 6 00 Ss] [1 + 00 S o 14 1o0;fo 1410) 0 1410/0 141 0 ae rs ajo o rs aro o 1s sfjo o is o+ 540 -1 540) 0 0 15 0/10 0 00-8 Thesjum simi, anette tat = Sif there were a solution.a [ S aH: 7 | Write c forh=12. Then the second equation cry =0 has a solution 3h -6{ "lo n-12 0 for every value ofc. So the systom is consistent for all h BB a. Tree. See the remarks following the box titled Elementary Row Operations. by, Fake. A 5% 6 matrix has Five rows, «. Fake. The description applies toa single solatin. The solution set consis f ll possible solutions. Only in special cases does the solution set consist of exactly one solution. Mark a statement True only ifthe statement is always true. 4. True. See the box before Example 2. BH) a. False. The definition of row equivalent requires that there exista sequence of row operations that transforms one matrix into the other. 'b. Truc. See the hox preceding the subsvction titled Existence and Uniqueness Questions. «. False, The definition of equivalent systems is in the second paragraph after equation (2) 4. True. By definition, a consistent system has af least one soluticn. 14 7a) ft 47 e]fi 47 e Blois a-lo 3-5 @ [lo 3-5 bt 2s 0 t{ lo 3 5 kag] lo 0 0 ko29+h Let 6 denote the mamber &+2g + h. Then the third equation represented by the augmented mati. above is 0 =b. This equation is possible if and only it is zero. So the original system has a sok fend only if k+ 2p +h =0. Bil Replace R3 by R3 + (-4)RI; replace R3 by RB + (IRI.