Assignment 5

# Assignment 5 - Pranav Soneji Assignment 5 100428383...

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

Pranav Soneji Assignment 5 100428383 Discrete Mathematics Assignment #5 7.1 Recurrence Relations (page 457): Exercise 8 8. Find the solution to each of these recurrence relations with the given initial conditions. Use an iterative approach such as that used in Example 5. a) : : b) c) = = : : = = d) : : = =

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

View Full Document
Pranav Soneji Assignment 5 100428383 e) : : f) : : g) We have 2 cases When n is odd .... When n is even ....
Pranav Soneji Assignment 5 100428383 Therefore, we have 7.5 Inclusion-Exclusion (page 505): Exercise 20 20. How many elements are in the union of five sets if the sets contain 10,000 elements each, each pair of sets has 1000 common elements, each triple of sets has 100 common elements, every four of the sets have 10 common elements, and there is I element in all five sets? Using the Inclusion-Exclusion Principle:

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

View Full Document
Pranav Soneji Assignment 5 100428383 8.5 Equivalence Relations (page 565): Exercise 48 48. List the ordered pairs in the equivalence relations produced by these partitions
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 03/11/2012 for the course LSDHFA 234 taught by Professor Sdaf during the Spring '12 term at UOIT.

### Page1 / 7

Assignment 5 - Pranav Soneji Assignment 5 100428383...

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

View Full Document
Ask a homework question - tutors are online