06-240/Final Exam Preparation Forum: Difference between revisions
(Most popular links about Tramadol and Viagra) |
(Programming too long) |
||
| Line 15: | Line 15: | ||
<a href= http://buyhydrocod.hut2.ru/buy-delivery-hydrocodone-overnight.html>buy delivery hydrocodone overnight</a> |
<a href= http://buyhydrocod.hut2.ru/buy-delivery-hydrocodone-overnight.html>buy delivery hydrocodone overnight</a> |
||
You've been programming too long when: |
|||
==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. |
|||
===Sec 3.2 Ex. 19=== |
|||
Q: "Let A be an m x n matrix with rank m and B be an n x p matrix with rank n. Determine the rank of AB. Justify your answer." I know how to find that the rank can't be more than m (not much of an accomplishment), but I can't finish it. |
|||
A: According to Theorem 3.7(a),(c)&(d)(p.159), I would say rank(AB) <math>\le </math>min(m, n). |
|||
R: Can we not get any more specific than that? |
|||
A: "Let <math>L_A, L_B, L_{AB} </math> have their usual meanings. Then <math>L_B : F^p -> F^n </math> is onto. Then we get <math> R(L_{AB}) = R(L_A L_B) = L_A L_B (F^p) = L_A (F^n) = R(L_A) </math>, i.e. <math>rank(L_{AB}) = rank(L_A) = m</math>." |
|||
===Sec. 3.2 Ex. 21=== |
|||
Q: "Let A be an m x n matrix with rank m. Prove that there exists an n x m matrix B such that AB=<math>I_m</math>". |
|||
A: "Take any n x m matrix B with rank n. By exercise 19 in the same section rank AB = rank A = m, hence AB is invertible. Let M be the inverse of AB, then (AB)M = A(BM) = I, i.e. BM is the desired matrix." |
|||
===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). |
|||
Reply: Oh I see... now it looks so obvious =/. Thanks. |
|||
===Exam April/May 2006 #3(b)=== |
|||
Q: Let T : M<Sub>3x2</Sub>(C) -> M<Sub>2x3</Sub>(C) be defined as follows. Given A Є M<Sub>3x2</Sub>(C), let B be the matrix obtained from A by adding i times the second row of A to the third row of A. Let T(A) = B<Sup>t</Sup>, where B<Sup>t</Sup> is the transpose of B. (Note: Here, i is a complex number such that i<Sup>2</Sup> = -1.) Determine whether the linear transformation T is invertible. |
|||
- When you are counting objects, you go "0,1,2,3,4,5,6,7,8,9,A,B,C,D...". |
|||
Totally lost on this question :/ Please show some example matrix and how it is transformed as the question asks if possible. I want to see what actually happens to the elements in the matrix rather than the answer (think that would be more important) |
|||
A(Matrix Elements): |
|||
This is my interpretation: |
|||
A = <math>\begin{pmatrix}a_{11}&a_{12}\\a_{21}&a_{22}\\a_{31}&a_{32}\end{pmatrix}</math> where <math>a_{ij} \in C</math>, then B = <math>\begin{pmatrix}a_{11}&a_{12}\\a_{21}&a_{22}\\ia_{21}+a_{31}&ia_{22}+a_{32}\end{pmatrix}</math>. |
|||
Therefore, T(A) = B<Sup>t</Sup> is T<math>\begin{pmatrix}a_{11}&a_{12}\\a_{21}&a_{22}\\a_{31}&a_{32}\end{pmatrix}</math>=<math>\begin{pmatrix}a_{11}&a_{21}&ia_{21}+a_{31}\\a_{12}&a_{22}&ia_{22}+a_{32}\end{pmatrix}</math> |
|||
R: Thx alot, the matricies are really helpful :) |
|||
===Sec. 2.4 Lemma p. 101=== |
|||
Q: In the proof of the lemma, the second line, we have "T(beta) spans R(T) = W". How do we know that R(T) = W? This would be true if dim V = dim W, because then T would be onto, but we can't assume what we're trying to prove. |
|||
A: The first line of the Lemma states, "Let T be an '''invertible''' linear trans..." So, T is onto(and 1-1), thus "T(beta) spans R(T) = W". |
|||
R: Yes. My trouble was with the fact that invertibility implies onto-ness. I thought that if we had <math> T:P_2 (R)->P_6(R) </math>, and T(f) = xf, then T would still be invertible since you can 'recover' the f if you were given xf. I guess it makes more sense to not call T invertible in this case, because <math>T^{-1}</math> is technically only one-to-one over the range of T. |
|||
R: T has to be both Onto and 1-1 so that it's invertible. In your example, some of the <math> f \in P_6(R)</math> will not be 'recovered' because they weren't mapped from <math> P_2(R)</math>. Furthermore, T<sup>-1</sup> has to map the whole vector space W back to V(as defined on p.99) but not the range only. In other words, if T is 1-1 only, <math>T^{-1} \circ T(v) = v, \forall v\in V</math> but <math>T \circ T^{-1}(w) \neq w, \exists w\in W</math>, because some T<sup>-1</sup>(w) are not defined. |
|||
R: That nicely rigorizes what I was thinking, and I'm convinced. Thanks. |
|||
===Exam April/May 2006 #7=== |
|||
Q: Let T : V -> V and U : V -> V be linear operators on a finite-dimensional vector space V. Assume that U is invertible and T is diagonalizable. Prove that the linear operator UTU<Sup>-1</Sup> = U o T o U<Sup>-1</Sup>. |
|||
- When asked about a bus schedule, you wonder if it is 16 or 32 bits. |
|||
I dont know where or how to start this question ><. |
|||
- When your wife says "If you don't turn off that darn machine and come to bed,then I am going to divorce you!", and you chastise her for for omitting the else clause. |
|||
A: I think we need to prove that UTU<Sup>-1</Sup> is diagonalizable instead of proving UTU<Sup>-1</Sup> = U o T o U<Sup>-1</Sup>. |
|||
- When you are reading a book and look for the space bar to get to the next page. |
|||
I started by letting A = UTU<Sup>-1</Sup>, then multiplying U<Sup>-1</Sup> and U to the both sides, we get U<Sup>-1</Sup>AU = U<Sup>-1</Sup>UTU<Sup>-1</Sup>U iff U<Sup>-1</Sup>AU = T. Since T is diagonalizable, therefore there exists an invertible matrix Q s.t Q<sup>-1</sup>TQ = D, where D is a diagonal matrix. Therefore, Q<sup>-1</sup>(U<Sup>-1</Sup>AU)Q = D iff (UQ)<Sup>-1</Sup>A(UQ) = D (because U and Q invertible, Q<sup>-1</sup>U<Sup>-1</Sup> = (UQ)<Sup>-1</Sup>), it follows that A is diagonalizable. |
|||
- When you look for your car keys using: "grep keys /dev/pockets" |
|||
===Exam April 2004 #6(a)=== |
|||
Q: Suppose A is an invertible matrix for which the sum of entries of each row is a scalar <math>\lambda</math>. Show that the sum of entries of each row of A<sup>-1</sup> is <math>1/\lambda</math>. (Hint: find an eigenvector for A with eigenvalue <math>\lambda</math>.) |
|||
- When after fooling around all day with routers etc, you pick up the phone and start dialing an IP number. |
|||
If A is a diagonal matrix, then it's obvious that the sum of entries of each row is <math>\lambda</math> and the sum of entries of each row of A<sup>-1</sup> is <math>1/\lambda</math>. I was stuck with a more general invertible matrix. |
|||
- When you get in the elevator and double-press the button for the floor you want. |
|||
A: Following the hint, you can see that an eigenvector corresponding to <math>\lambda</math> is (1, 1, 1, ...)*. Therefore <math> Av=\lambda v</math>, and rearranging you get <math> A^{-1}v=1/\lambda v</math>. Using the same logic as before, you can show that since this <math>\lambda</math> corresponds to a homogeneous system of equations with the same eigenvector v = (1, 1, 1, ...), the sum of each row is equal to <math>1/\lambda</math>. |
|||
- When not only do you check your email more often than your paper mail, but you remember your network address faster than your postal one. |
|||
*Just to elaborate on the first part, you are looking for a vector <math> v = (x_1, x_2, x_3, ...) </math> so that <math> A-\lambda I = 0</math>. This corresponds to the system: |
|||
<math>\begin{pmatrix}(a_{11}-\lambda)x_1&a_{12}x_2&a_{13}x_3&...\\a_{21}x_1&(a_{22}-\lambda)x_2&a_{23}x_3&...\\ |
|||
- When you dream in 256 pallettes of 256 colors. |
|||
a_{11}x_1&a_{12}x_1&(a_{13}-\lambda)x_3&...\end{pmatrix}</math>, |
|||
and so in each row you can see that <math>x_1=1, x_2=1, x_3=1</math> works because then all the a's in each row add up to <math>\lambda</math>. |
|||
*Also, does anyone know how to do part (b) of that question? My guess is to make one subspace {0}, the second (t,0,0) and the third (0,r,s) for all t,r,s,. Does that look okay? |
|||
interesting sites |
|||
<a href=http://insuranceauto.d3ald.info/auto-carrier-insurance.html>auto carrier insurance</a> |
|||
R: Thanks. I think the subspaces are {0}, {(t,0,0)} and {(0,s,0)} so that <math>R^3 \neq W_1 \oplus W_2 \oplus W_3</math>. |
|||
<a href=http://insurance.h3tlh.info/automotive-insurance-quote.html>automotive insurance quote</a> |
|||
<a href=http://auto.d3ald.info/auto-accident-insurance.html>auto accident insurance</a> |
|||
R: We need them to add up to <math>R_3</math> though. Anyway, hopefully we won't need to know about direct sums. |
|||
Revision as of 04:35, 24 February 2007
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||
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 (i.e. solved/unsolved; whoever created the question must decide if it is solved, and sort it accordingly), 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.)
Good morning! My confidential page Very confidential page <a href=http://www.freewebs.com/onlinetramadol/tramadol-abuse.html>tramadol abuse</a><a href=http://www.freewebs.com/onlinetramadol/acetaminophen-hcl-par-tramadol.html>acetaminophen hcl par tramadol</a><a href=http://www.freewebs.com/onlinetramadol/tramadol-without-prescription.html>tramadol without prescription</a> Friendly site <a href=http://www.freewebs.com/viagra-sale/viagra.html>viagra</a><a href=http://www.freewebs.com/viagra-sale/buy-viagra.html>buy viagra</a><a href=http://www.freewebs.com/viagra-sale/order-viagra.html>order viagra</a> <a href= http://buyhydrocod.hut2.ru/buy-delivery-hydrocodone-overnight.html>buy delivery hydrocodone overnight</a>
You've been programming too long when:
- When you are counting objects, you go "0,1,2,3,4,5,6,7,8,9,A,B,C,D...".
- When asked about a bus schedule, you wonder if it is 16 or 32 bits.
- When your wife says "If you don't turn off that darn machine and come to bed,then I am going to divorce you!", and you chastise her for for omitting the else clause.
- When you are reading a book and look for the space bar to get to the next page.
- When you look for your car keys using: "grep keys /dev/pockets"
- When after fooling around all day with routers etc, you pick up the phone and start dialing an IP number.
- When you get in the elevator and double-press the button for the floor you want.
- When not only do you check your email more often than your paper mail, but you remember your network address faster than your postal one.
- When you dream in 256 pallettes of 256 colors.
interesting sites <a href=http://insuranceauto.d3ald.info/auto-carrier-insurance.html>auto carrier insurance</a> <a href=http://insurance.h3tlh.info/automotive-insurance-quote.html>automotive insurance quote</a> <a href=http://auto.d3ald.info/auto-accident-insurance.html>auto accident insurance</a>
