{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CS208 Week 2 Homework

# CS208 Week 2 Homework - with the top it would look the same...

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

CS208 - Week 2 Homework October 25, 2010 Discrete Math CS 208 Online Use Mathematical Induction proof to prove expression: ..... + = , n 1 n=1 = n=2 = So, change the equation to include a k. ; + or = Then to do the other side of the problem. .... + = = = = Proved by induction Construct a truth table to show that expression is a tautologies

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

View Full Document
q p T T T F F T T F F T T T F T T F F T F F T T F T Construct a truth table to show that expression and are logically equivalent p q r T T T T T T F F T F T T T F F T F T T T F T F F F F T T F F F F p r q T T T T T T F T T F T F T F F T F T T T F T F T F F T F F F F F right now it does not look like they are equivalent, but if you re-arrange the rows to correspond
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: with the top it would look the same. For instance, if you look at the first table [ ], 2nd row you see that the p=t, q=t, r=f and the last column=f. If we find the same row in the table above where p=t, q=t, r=f, the last column for that row also =f; by rearranging the rows it would look like this: p q r T T T T T T F F T F T T T F F T F T T T F T F F F F T T F F F F...
View Full Document

{[ snackBarMessage ]}

### Page1 / 3

CS208 Week 2 Homework - with the top it would look the same...

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

View Full Document
Ask a homework question - tutors are online