Discrete Mathematics 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. What is the number of plannings possible if there is at least one person each day taking the exam? Answer: N=?

Oh no! Our experts couldn't answer your question.

Don't worry! We won't leave you hanging. Plus, we're giving you back one question for the inconvenience.

Submit your question and receive a step-by-step explanation from our experts in as fast as 30 minutes.
You have no more questions left.
Message from our expert:
Our experts are unable to provide you with a solution at this time. Try rewording your question, and make sure to submit one question at a time. We've credited a question to your account.
Your Question:

Discrete Mathematics

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.

What is the number of plannings possible if there is at least one person each day taking the exam? Answer: N=?

Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning