22.5: Activities
- Page ID
- 95600
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
From a pool of eleven students (five first-year, six senior), how many ways are there to form:
- A committee of three students?
- A committee consisting of three first-year students and four senior students?
- A committee of six students if two of the senior students refuse to be together on the committee?
- A committee consisting of four first-year students and three senior students if two of the first-year students refuse to be together on the team?
From the alphabet \(\Sigma = \{0,1\}\text{:}\)
- How many words of length \(10\) contain exactly six \(0\)s?
- How many contain at least three \(1\)s?
From the alphabet \(\Sigma = \{0,1,2\}\text{:}\)
- How many words of length \(10\) contain exactly four \(2\)s?
- How many contain at most seven \(0\)s?
Figure \(\PageIndex{1}\) contains a diagram in a pyramid shape. The unfilled circles represent “positions” in the pyramid, and the smaller dots represent “dividers” between positions. Consider “paths” through this pyramid that begin at the peak position and end on the lowest level. The filled circles joined by line segments represent one such path.
- How many such paths are there?
- How many paths are there that change direction exactly once? Exactly twice? At every step?
(For each case described in this task, you should be able to arrive at an answer without explicitly determining all such paths.)
You get to the final exam of one your courses and are faced with twelve questions. In how many ways can you fulfill the requirements exam if the instructions ask you to:
- Answer any ten of the questions?
- Answer any seven of the first eight questions and any three of the last four questions?
- Answer ten of the questions, at least five of which must be from the first eight questions and at least three of which must be from the last four questions?
A course instructor for a class of twenty is feeling particularly lazy and doesn't bother to mark the final exams. Instead, she decides that for each of the letter grades A, B, C, she will randomly assign that grade to exactly six students, and the last two unlucky students will be assigned a grade of D. How many different course outcomes are there?
How many ways are there to split \(m n \) people into \(m\) groups of equal size?
Suppose you have \(2 n\) teddy bears that are identical except for a number stitched into the paw of the right foot. Of these bears, \(n\) have the number \(0\) on their foot, and the remaining \(n\) bears have a unique number from \(1, 2, 3, \ldots, n\text{.}\) How many ways can you choose \(n\) of the bears, with the understanding that any of the bears labelled \(0\) are interchangeable?
- Hint.
-
Break into cases based on how many bears labelled \(0\) will be in your collection.
Consider the set \(\{ 1, 2, 3, \ldots, 2n \}\text{.}\) How many subsets of size \(2\) are there such that the two elements therein have an even sum?
Consider the set \(\{ 1, 2, 3, \ldots, n \}\text{.}\) How many subsets of size \(3\) are there such that no two of the three elements therein are consecutive?
- Hint.
-
It might be easier to count the subsets of size \(3\) that do contain (at least) two consecutive numbers.