Practice Problems on Constructing Proofs - Homework 3 | CS 1050, Assignments of Computer Science

Material Type: Assignment; Professor: Boldyreva; Class: Constructing Proofs; Subject: Computer Science; University: Georgia Institute of Technology-Main Campus; Term: Spring 2009;

Typology: Assignments

Pre 2010

Uploaded on 08/04/2009

koofers-user-l7o
koofers-user-l7o 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 1050 B: Constructing Proofs January 29, 2009
Homework 3
Lecturer: Sasha Boldyreva Due: February 3, 2009
Problem 3.1, 10 points. Let a1= 2, a2= 9, and an= 2an1+ 3an2for n3. Use
strong induction (the Second Principle of Mathematical Induction) to show that an3n
for all positive integers n.
Problem 3.2, 7 points. Problem 14 from Section 4.2 of Rosen’s textbook.
Problem 3.3, 7 points. Problem 32 from Section 4.2 of Rosen’s textbook.
Problem 3.4, 10 points. Problem 38 from Section 4.4 of Rosen’s textbook.
Problem 3.5, 20 points. Problem 18a from Section 7.3 of Rosen’s textbook.

Partial preview of the text

Download Practice Problems on Constructing Proofs - Homework 3 | CS 1050 and more Assignments Computer Science in PDF only on Docsity!

CS 1050 B: Constructing Proofs January 29, 2009

Homework 3

Lecturer: Sasha Boldyreva Due: February 3, 2009

Problem 3.1, 10 points. Let a 1 = 2, a 2 = 9, and an = 2an− 1 + 3an− 2 for n ≥ 3. Use strong induction (the Second Principle of Mathematical Induction) to show that an ≤ 3 n for all positive integers n.

Problem 3.2, 7 points. Problem 14 from Section 4.2 of Rosen’s textbook.

Problem 3.3, 7 points. Problem 32 from Section 4.2 of Rosen’s textbook.

Problem 3.4, 10 points. Problem 38 from Section 4.4 of Rosen’s textbook.

Problem 3.5, 20 points. Problem 18a from Section 7.3 of Rosen’s textbook.