assignment5

# Problem 4 prove by mathematical induction if you

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: P(S) = 2n. Here is a more formal version of the same statement: For any finite set S with cardinal number n, then the cardinal number of P(S) = 2n. Problem 4. Prove by mathematical induction (if you happen to know a formula for the left sign of the inequality, do not assume the formula. Just use basic properties of inequalities and arithmetic and induction. For all positive real numbers x, (1+x)n ≥ 1 + nx. Problem 6. Problem 5 of Section 5.1 of Gemignano asks for a set diagram for 4 sets that can be used to show set relations. But the answer in the back of the book is a...
View Full Document

## This note was uploaded on 01/29/2014 for the course MATH 300A taught by Professor Jamesking during the Winter '11 term at University of Washington.

Ask a homework question - tutors are online