{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

This preview shows pages 1–2. Sign up to view the full content.

Answers to your questions 03/01/10: Administrative questions 1. On the final, are we going to have to find the rank/inverse for some huge matrix? For inverse, the largest one will be 3x3. For rank, the largest one will be 3xn. For determinant, the largest will be 4x4. 2. A lot of the math classes I took had a “second grading system”, where if we get an A on the final, we get an A in the class, regardless of previous quizzes/hw/midterms. So you support this policy as well? That depends on the average grade of the class. If it is too low, I will follow this policy. 3. On the lecture notes of section 3.3&3.4, I like how to typed out the definitions and theorems. It looks neat. Thanks for the comment. I actually found them on some website, then cut and paste. 4. Is the class curved? No. Only the extra credits on questions will be curved. Questions for today’s lecture 5. g4668g1876 g2869 +g1876 g2870 =1 , m<n is a consistent system. g4668g1876 g2869 +g1876 g2870 +g1876 g2871 =1 , m<n is a consistent system. g3420 g1876 g2869 +g1876 g2870 +g1876 g2871 =1 g1876 g2869 +g1876 g2870 +g1876 g2871 =2 , m<n is an inconsistent system since it doesn’t have a solution. 6. Is rank basically the same as number of “pivot elements”? Yes. You can think of it as the number of nonzero pivot elements. 7. If a row has all 0’s, that means it is linearly dependent; if matrix is linearly dependent, there is no inverse?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}