Discrete Mathematics (Counting theory)  We want to spread a face-to-face exam among 24 students over three days: Wednesday, Thursday and Friday. An exam schedule is the score with the 3 subsets of students for each day. (Or, equivalently, a function e: {1,2,...,24}→{M, J,V}.) We want to count the possible schedules (=N) under different rules. 3. What is the number of schedules possible where all the choices in advance are made for the same day (Friday/Thursday)? Answer: N= Hint: Everyone takes the exam either Wednesday or Friday or everyone takes the exam either Wednesday or Thursday.

A First Course in Probability (10th Edition)
10th Edition
ISBN:9780134753119
Author:Sheldon Ross
Publisher:Sheldon Ross
Chapter1: Combinatorial Analysis
Section: Chapter Questions
Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...
icon
Related questions
Question

Discrete Mathematics (Counting theory) 

We want to spread a face-to-face exam among 24 students over three days: Wednesday, Thursday and Friday. An exam schedule is the score with the 3 subsets of students for each day. (Or, equivalently, a function e: {1,2,...,24}→{M, J,V}.) We want to count the possible schedules (=N) under different rules.

3. What is the number of schedules possible where all the choices in advance are made for the same day (Friday/Thursday)? Answer: N=

Hint: Everyone takes the exam either Wednesday or Friday or everyone takes the exam either Wednesday or Thursday.

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Answer is not two. Counting theory needs to be used and the answer is a much larger number. Use the hint I provided for guidance.

Solution
Bartleby Expert
SEE SOLUTION