This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: PRACTICE PROBLEMS FOR FINAL The comprehensive final will be given on Wednesday, March 17, 810 am , in our usual classroom (MST 124). It will be a closedbook test . No textbooks, notes, or electronic devices will be allowed. Scratch paper will be provided to those needing it. You only need to bring your pens, papers, and erasers. In preparing for the test, you can practice solving the problems from the list below. In addition, take a look at the homework problems (at least one problems on the midterm will come more or less directly from the homework), and at the examples given in the textbook. The list below contains problems of different levels of difficulty. Extra hard (in my opinion) problems are marked by (!). 1. (!) Prove that, for any positive integer n , 2 n summationdisplay k =1 ( 1) k +1 k = 2 n summationdisplay j = n +1 1 j . 2. (!) Suppose p is a polynomial of degree n , and x R . Prove that there exist a , a 1 , . . . , a n R s.t. p ( x ) = n k =0 a k ( x x )...
View
Full
Document
This note was uploaded on 05/08/2010 for the course MATH 140a taught by Professor Staff during the Winter '08 term at UC Irvine.
 Winter '08
 staff

Click to edit the document details