20.6: Activities

Last updated
Save as PDF

Page ID: 95409

\( \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}}\)

Activity \(\PageIndex{1}\)

A standard Alberta license plate has three letters followed by three or four digits.

How many different vehicles can the province license with this scheme?
Do you think the province was right to expand license plates by adding another digit, or do you think it should have added another letter instead? (Or, as a third possibility, is it irrelevant in practical terms?)

Hint.: The figure \(26^3 = 17576\) may help you decide.

Activity \(\PageIndex{2}\)

You roll a six-sided die ten times. How many different sequences of rolls are possible?
Describe how Task a relates to the problem of determining \(\vert \Sigma^{\ast}_{10} \vert\) for a suitable alphabet \(\Sigma\text{.}\)

Activity \(\PageIndex{3}\)

Let \(\Sigma = \{a, b, c, \ldots, y, z\}\text{.}\) How many words in \(\Sigma^{\ast}_5\) end in the letter \(z\text{?}\) How many do not?

Activity \(\PageIndex{4}\)

You and your five housemates pick names out of a hat each week to determine who is going to clean the toilet. Over a three-week period, how many different sequences of toilet bowl cleaners could be determined in this fashion

if names are placed back in the hat after each draw?
if names are not placed back in the hat after each draw?

Activity \(\PageIndex{5}\)

How many natural numbers between \(1\) and \(1,000,000\) (inclusive) contain the digit \(5\text{?}\)

Hint.: You might instead count how many numbers don't contain the digit \(5\text{.}\)

Activity \(\PageIndex{6}\)

How many natural numbers between \(100\) and \(999\) (inclusive) have no repeated digits? Of these, how many are odd?

Hint.: There's no rule that when you “construct” an arbitrary object of this type that you have to choose the first digit first.

Activity \(\PageIndex{7}\)

Use the Pigeonhole Principle to prove that in every set of three integers there exists a pair whose difference is even.

Hint.: What kinds of numbers add up to an even sum?

Activity \(\PageIndex{8}\)

You have a list of the names of twenty students. Ten of the students are domestic students and the other ten are out-of-province students. How many students must you select from the list to be certain to form a group that contains at least one domestic student and at least one out-of-province student?

Activity \(\PageIndex{9}\)

Let \(n\) be a fixed natural number. Determine the smallest number \(M\) for which the following statement is true: every subset of

\begin{equation*} \mathbb{N}_{<2n+1} = \{0,1,2,3,\ldots ,2n\} \end{equation*}
of size \(M\) contains at least one odd number.

Activity \(\PageIndex{10}\)

You're cleaning up your little nephew's toy room. There are \(T\) toys on the floor and \(n\) empty toy storage boxes. You randomly throw toys into boxes, and when you're done the box with the most toys contains \(N\) toys.

What is the smallest that \(N\) could be when \(T = 2 n + 1\text{?}\)
What is the smallest that \(N\) could be when \(T = k n + 1\text{?}\)
Now suppose that the number of toys \(T\) satisfies

\begin{equation*} T \lt \dfrac{n (n - 1)}{2} \text{.} \end{equation*}
Prove that when you are done cleaning up, there will be (at least) one pair of boxes that contain the same number of toys.

Hint.: Argue the contrapositive by assuming that every box ends up a different number of toys. What is the fewest number of toys you could have started with?