Mathematics 1228A/B Final: Section 1.3 Sep 18, 2019

• School: Western University
• Department: Mathematics
• Course: Mathematics 1228A/B
• Professor: Vicki Olds

Document Summary

No matter which choice is selected at some earlier decision, then the number of di erent ways of making all k decisions is m1 x m2 x mk. If there are k decision to be made, with mi choices available for the ith decision, for i =1k. The # of ways to decide is 3x4x2x3=72 ways. How many 3 digit codes can be formed from the digits 0-9: if repetition of digits within the code is allowed, if repetition is not allowed. How many 3 digits codes can be formed if repetition is not allowed and the code must either start with an odd digit or else must contain only even digits. 1010 1000 possible no rep 10 9 8 e 720 at least i repeat tooo 220 280. Example 1. 8: how many subset of {a,b} are there, how many subset of {a,b,c} are there. 0 a i b c ab ac bc i abc.