mat25-hw2 - nx. 3. Prove by induction that for every n N...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Math 25: Advanced Calculus UC Davis, Spring 2011 Math 25 — Homework Assignment #2 Homework due: Tuesday 4/12/11 at beginning of discussion section Homework guidelines. 1 As you may have discovered in last week’s assignment, writing a good proof is not easy. For this week’s assignment I suggest the following steps: 1. Spend a few minutes contemplating how to present your argument. 2. Write a draft of the proof on a separate sheet of paper. 3. Go and do something else for 5 minutes. 4. Read over your proof and consider if you would be satisfied if your instructor were to write such a proof on the blackboard. If not, go back to step 1. If yes, copy your proof into the pages you are planning to submit and proceed to the next problem. Reading material. Read sections A.8 and 2.3 in the textbook. Problems 1. Prove by induction that for every n = 1 , 2 , 3 ,... 1 2 + 2 2 + 3 2 + ... + n 2 = n ( n + 1)(2 n + 1) 6 (for a hint, see note 392 at the end of Appendix A in the textbook). 2. Let x be a positive real number. Prove by induction that for every n N , (1 + x ) n 1 +
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: nx. 3. Prove by induction that for every n N the number 7 n-4 n is divisible by 3. 4. Find and explain the aw in the proof by induction that was presented in class of the claim that all giraes are the same height (see also problem A.8.9 in the textbook). 5. Answer problems A.9.1 and A.9.2 in the textbook. 6. Prove that the set N N = { all pairs ( m,n ) where m,n N } is countable. That is, show that one can write down a list of pairs ( m 1 ,n 1 ) , ( m 2 ,n 2 ) , ( m 3 ,n 3 ) ,... covering all the elements of N N (the list may contain repetitions but any pair ( m,n ) of natural numbers must appear at least once). 2 1 Last weeks HW guidelines also still apply refresh your memory by rereading them. 2 You do not need to write a precise formula for the general term ( m k ,n k ) of this list, as long as you provide sucient detail about how to construct the list that convinces the reader that you understand what you are talking about....
View Full Document

This note was uploaded on 10/16/2011 for the course MATH 34 taught by Professor Wiley during the Winter '11 term at UC Merced.

Ask a homework question - tutors are online