mdm12Section4_T_OddSolutionsFinal

# mdm12Section4_T_OddSolutionsFinal - Q1-5 Q7 CHAPTER 4...

This preview shows pages 1–2. 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: Q1-5 Q7 CHAPTER 4 Chapter Test, p. 261 Solutions to Odd Number Problems 1. a) n = 24 = 16 b) c) For each coin toss, there are two possible outcomes: heads or tails, as indicated on each branch of the tree diagram. 3. a) i) n = 33 = 27 ii) n = 3 + 32 + 33 = 39 b) In part i), the multiplicative counting principle applies. Multiply the number of pulses possible for each position. In part ii), the additive counting principle applies. Add the number of possible codes for each of the possible lengths, since these are mutually exclusive cases. 5. Ways of rolling a sum of 6: {(1,5), (5,1), (2,4), (4,2), (3,3)}. Ways of rolling a sum of 12: {(6,6)} Therefore, there are six ways of rolling a sum of 6 or 12. Top 7. a) n = the number of sticks n 2 3 4 5 6 7 t = the maximum number of intersections t 1 3 6 10 15 21 Pascal 's Triangle 1 1 1 1 1 2 3 1 3 1 14641 1 5 10 10 5 1 1 6 15 20 15 6 1 tn,n−2 = nCn−2 b) If n = 6, the maximum number of intersections is 6C4 = 15. Top ...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

mdm12Section4_T_OddSolutionsFinal - Q1-5 Q7 CHAPTER 4...

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

View Full Document
Ask a homework question - tutors are online