h4 - A . Prove by induction that cardinality oF P ( A ) is...

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

View Full Document Right Arrow Icon
[50] Homework 4. Proof Techniques Each problem is worth 10 points [10] Show that 5 5 is irrational. [10] The harmonic number H n is defned as For n 1 H n = n s k =1 1 k . Prove by induction that H 2 n 1 + n 2 whenever n is a nonnegative natural number. [10] Let A be a set oF cardinality n . Let P ( A ) be the power set, that is, the set oF all subsets oF
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: A . Prove by induction that cardinality oF P ( A ) is 2 n , that is, | P ( A ) | = 2 n . [10] Prove using induction that For any natural n n s i =1 1 i 2 2-1 n [10] Derive an explicit Formula For the Following recurrence For n 1 a n = n 2 a n-1 with a = 1. 1...
View Full Document

This homework help was uploaded on 04/19/2008 for the course CS 182 taught by Professor W.szpankowski during the Fall '08 term at Purdue University-West Lafayette.

Ask a homework question - tutors are online