hw1solns

# hw1solns - Discrete Mathematics, Spring 2004 Homework 1...

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

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

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

Unformatted text preview: Discrete Mathematics, Spring 2004 Homework 1 Sample Solutions Problem #1. Using induction, verify that 1(1!) + 2(2!) + ... + n ( n !) = ( n + 1)!- 1 for all positive integers n . Solution : let P ( n ) be the statement 1(1!) + 2(2!) + ... + n ( n !) = ( n + 1)!- 1. We prove that P ( n ) is true for all n 1 by induction on n . Base case: 1(1!) = 1, (1 + 1)!- 1 = 2- 1 = 1. Thus P (1) is true. Inductive step: Assume that P ( n ) is true. Then 1(1!) + 2(2!) + ... + ( n + 1)[( n + 1)!] = [1(1!) + 2(2!) + ... + n ( n !)] + ( n + 1)[( n + 1)!] = ( n + 1)!- 1 + ( n + 1)[( n + 1)!] by assumption = ( n + 1)![1 + ( n + 1)]- 1 = ( n + 2)!- 1 . Therefore P ( n + 1) is true, and by induction the claim is proved. Problem #2. By experimenting with small values of n , guess a formula for the sum 1 1 2 + 1 2 3 + + 1 n ( n + 1) . Then use induction to verify your formula. Solution : Easy calculations show that the above sum equals 1 / 2, 2 / 3, 3 / 4 for n = 1 , 2 , 3 respectively. Therefore we guess that in general the sum equals n/ ( n +1). Here is the formal proof. Let P ( n ) be the statement 1 / (1 2) + 1 / (2 3) + + 1 / [ n ( n + 1)] = n/ ( n + 1). Clearly 1 P (1) is true, since 1 / (1 2) = 1 / 2. Now assume P ( n ) is true; then 1...
View Full Document

## This note was uploaded on 06/12/2011 for the course MATH 103 taught by Professor Wouters during the Spring '08 term at Wisc Oshkosh.

### Page1 / 4

hw1solns - Discrete Mathematics, Spring 2004 Homework 1...

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

View Full Document
Ask a homework question - tutors are online