06-240/Final Exam Preparation Forum

06-240/Navigation Panel   # Week of... Notes and Links 1 Sep 11 About, Tue, HW1, Putnam, Thu 2 Sep 18 Tue, HW2, Thu 3 Sep 25 Tue, HW3, Photo, Thu 4 Oct 2 Tue, HW4, Thu 5 Oct 9 Tue, HW5, Thu 6 Oct 16 Why?, Iso, Tue, Thu 7 Oct 23 Term Test, Thu (double) 8 Oct 30 Tue, HW6, Thu 9 Nov 6 Tue, HW7, Thu 10 Nov 13 Tue, HW8, Thu 11 Nov 20 Tue, HW9, Thu 12 Nov 27 Tue, HW10, Thu 13 Dec 4 On the final, Tue, Thu F Dec 11 Final: Dec 13 2-5PM at BN3, Exam Forum Register of Good Deeds Add your name / see who's in! edit the panel

If you have questions, ask them here and hopefully someone else will know the answer. (Answering questions will probably help you understand it more).

Since many of us (including I) don't really know how to use Wiki's, I suggest that we keep the formatting simple: I will post a template at the top of this page, and if you want to add something just click on the "edit", copy the template, and insert your question. Order the questions according to section (solved/unsolved, as judge by whoever created the question), with the newest at the top, except for the template question. In general, I wouldn't retype the question if it's from the book because that's tedious and we all have the book.

(By the way, I think you leave a space between lines in the code to make a new line; that is, simply pressing enter once will not make a new line. Also, you can press a button at the top of the editing textbox that lets you put in simple equations.)

Unsolved Questions

Question Template

Q: Can someone help me prove: "If an integer $n$ is greater than 2, then $a^{n}+b^{n}=c^{n}$ has no solutions in non-zero integers $a$, $b$, and $c$."? I had the answer in my head at one point, but the margins of the piece of paper I was working with was too small to fit it.

Exam April/May 2006 #4

Q: Suppose that A, B Є M_mxn(F), and rank(A) = rank (B). Prove that there exist invertible matrices P Є M_mxm(F) and Q Є M_nxn(F) such that B = PAQ.

A(partial): Here is a sketch. If you rref A and B by applying a series of elementary row operation matricies, they will both look similar. That is, they will have a section of 1's and 0's (each 1 is the only number in its column) and then a section of "remaining stuff", and these sections will be the same "size" because their ranks are the same. Then, using the elementary column matrix operations, you can essentially modify the "remaining stuff" as much as you like, by adding multiples of the "nice" columns (with single-1's). These row and column operations can then be grouped nicely and set to be equal to P and Q, which are invertible because products of elementary matricies are invertible.

I know this is very rough, but even if I did have a full answer I wouldn't now how to typeset it.

Complex Numbers

Q: If 'C' is used in the context of a vector space (as in "define T:C->C"), then should we consider C to be the vector space of C over the field C, or instead C over the field R?

Sec. 1.6, Ex. 29 a.

Q: Does anyone know an efficient way of doing this?

Sec. 1.3 Thm 1.3 Proof

Q: In the first paragraph of the proof, it says "But also x + 0 = x , and thus 0'=0." How do we know 0 (that is 0 of V) even exists in W? I understand that we know some zero exists (0'), but not why the zero (0) exists.

A: x is in W as well in V. Thus, x + 0 = x (VS 3).

Solved Questions

Question Template

Q: How many ways are there to get to the nth stair, if at each step you can move either one or two squares up?

A: This question can be easily modeled by the Fibonacci numbers, with the nth number being the ways to get to the nth stair. This is because, to get to the nth stair, you can come only from the n-1th or the n-2th. This is exactly how the Fibonacci numbers are defined; the proof is simple by induction.