{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Discrete_Mathematics_Assignment__5

# Discrete_Mathematics_Assignment__5 - Gunjan Patel...

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

Gunjan Patel | --------------------------------------------------------------------------------------------------- ------------------ Discrete Mathematics – Assignment # 5 --------------------------------------------------------------------------------------------------- ------------------ . ( ): |7 1 Recurrence Relations page 457 Exercise 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 = = . . . = - ( +( - ) + ( - ) + ... + ( -( - ))) + n n 1 n 2 n n 1 = ( ) d = = . . . =

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

View Full Document
Gunjan Patel | = --------------------------------------------------------------------------------------------------- ------------------ ( ) e ... = ( + )!* = ( + )! n 1 a0 2 n 1 ( ) f = ( ( - )) 2n 2 n 1 . . . = = * 3 2 n ! --------------------------------------------------------------------------------- --------------------------------------
Gunjan Patel | . - ( ): 7 5 Inclusion Exclusion page 505 Exercise 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?

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

View Full Document
Gunjan Patel | Using the Inclusion-Exclusion Principle: |A| + |A | + |A| + |B = (10000 + 10000 + 10000 + 10000 + 10000) – (1000 -1000 -1000 -1000 -1000 -1000 -1000 -1000 -1000 -1000) + (100 + 100 + 100 + 100 + 100 + 100 + 100 + 100 + 100 + 100) – (10 – 10 – 10 – 10 – 10) + 1 = ( * ) – ( * ) + ( * ) – ( * ) + r 10000 5 1000 10 100 10 10 5 1 = + + = 50000 10000 1000 50 1 40951 --------------------------------------------------------------------------------------------------- ------------------ . ( ): |8 5 Equivalence Relations page 565 Exercise 48| List the ordered pairs in the equivalence relations produced by these partitions of { , , a b , e , , d e , f }. g ( ) a { , }, { , }, { , a b c d e , f } g {( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , a a a b b a b b c c c d d c
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern