mdm12Section5_R_OddSolutionsFinal

mdm12Section5_R_OddSolutionsFinal - Q1-5 Q15-21 Q7-13 Q23...

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

Q1-5 Q7-13 Q15-21 Q23 CHAPTER 5 Review of Key Concepts, pp. 296–297 Solutions to Odd Number Problems 1. a) R2, R3, R5, R6, R7, R8 b) R7, R8 c) R5, R8 d) all regions 3. T = colour TV, C = computer, D = dishwasher. Let the population be 100%. a) T only, C only, D only, T and C but not D, T and D but not C, C and D but not T, none of the three b) TV and computer but no dishwasher 33% TV and dishwasher but no computer 19% dishwasher and computer but no TV 1% TV but no computer and no dishwasher 14% dishwasher but no computer and no TV 1% computer but no TV and no dishwasher 1% no TV, no computer, and no dishwasher 1% 5. 12 C 3 × 10 C 2 = (220)(45) = 9900 Top

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

View Full Document
7. Combination locks should be called permutation locks because the order of selecting the numbers matters. They will not open if the numbers are turned in the wrong order. 9. The resident can choose to mark one to five candidates. 5 C 1 + 5 C 2 + 5 C 3 + 5 C 4 + 5 C 5 = 5 + 10 + 10 + 5 + 1 = 31 11. Each of the eight friends may or may not come.
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/23/2012 for the course MATHS MDM-01 taught by Professor Mr.m during the Spring '10 term at Seneca.

Page1 / 4

mdm12Section5_R_OddSolutionsFinal - Q1-5 Q15-21 Q7-13 Q23...

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

View Full Document
Ask a homework question - tutors are online