... one can go to more than one talk in the morning or more than one talk in the evening. However. attendees can decide to not attend a talk in the morning or not attend a talk in the evening.
How many different schedules are there? (A schedule is a list of talks that someone could attend, and two schedules are different if they do not have the exact same talks in them.)
Explain why there is a bijective correspondence between the schedules and the set Mx E where: M= {Combinatorics, Algorithms, Abstract Algebra, No Talk}
E = {Geometry, Cybersecurity, Investing. Numerical Analysis, Game Theory. No Talk}
2. Suppose that a state makes license plates consisting of three uppercase letters followed by a three digit number (from 000 to 999.) So for example ABC999, CAT139 and FOX765 are all valid license plates.
How many different license plates can be made in this state?
3. How many numbers from 1 to 120 are multiples of 2, 3 or 5?