HW2-W07-full

# HW2-W07-full - Homework Two CS 191 Discrete Structures I...

This preview shows pages 1–3. Sign up to view the full content.

Homework Two CS 191 : Discrete Structures I Jan. 30 , Winter 2007 Due Date: Feb. 13, Tuesday, before the class meeting. Section 1.7, p60 In Exercises 1-11, using induction, verify that each equation is true for every positive integer n. Exercise (6) 1 3 + 2 3 + 3 3 + … + n 3 = + 2 ) 1 ( 2 n n _________________________________________________________ In Exercise 21-24, use induction to prove the statement. Exercise (22) 11 n – 6 is divisible by 5, for all n 1. _________________________________________________________ Section 1.8, p69 Exercise (1) Show that postage of 6 cents or more can be achieved by using only 2-cent and 7-cent stamps. _________________________________________________________ In Exercises 12-17, find the quotient q and remainder r as in Theorem 1.8.5 when n is divided by d. Exercise (14) n = 7, d = 9. ________________________________________________ 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Section 2.1, p85 In Exercises 1-16, let the universe be set U = {1, 2, 3, …, 10}. Let A= {1, 4, 7, 10}, B= {1, 2, 3, 4, 5}, and C = {2,, 4, 6, 8}. List the elements of each set. Exercise
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

HW2-W07-full - Homework Two CS 191 Discrete Structures I...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online