SUNY Geneseo Department of Mathematics

Problem Set 8—Proof by Induction

Math 239 01
Spring 2017
Prof. Doug Baldwin

Complete by Thursday, March 2
Grade by Tuesday, March 7

Purpose

This problem set develops your understanding of inductive sets and your ability to write proofs that use the first (weak) form of induction. This exercise also reinforces habits of formal proof writing.

Background

This problem set is based on material in section 4.1 of our textbook. We discussed or will discuss this material in class on February 27 and March 1.

Activity

Do the following exercises. All proofs should be word-processed (i.e., not hand-written) and should follow the guidelines in Sundstrom’s text, particularly the new guideline of clearly identifying proofs by induction and their basis and induction steps.

Exercise 1

Is the set { 4n-1 | n∈ℕ } inductive? Why or why not?

Exercise 2

Exercise 3c in section 4.1 of Sundstrom’s text (use induction to prove that for each natural number n, 13 + 23 + … + n3 = (n(n+1)/2)2).

Exercise 3

Exercise 15 in section 4.1 of Sundstrom’s text (essentially, formulate and prove a conjecture about what the nth derivative of eax is in terms of a, n, and eax, where a is a real constant).

Exercise 4

Exercise 18a in section 4.1 of Sundstrom’s text (an “evaluating proofs” exercise that asks you to evaluate a proof that 1 + 4 + 7 + … + (3n-2) = n(3n-1)/2).

Follow-Up

I will grade this exercise in a face-to-face meeting with you. During this meeting I will look at your solution, ask you any questions I have about it, answer questions you have, etc. Please bring a written solution to the exercise to your meeting, as that will speed the process along.

Sign up for a meeting via Google calendar. Please make the meeting 15 minutes long, and schedule it to finish before the end of the “Grade By” date above.