Problems
In the following grid, how many different ways are there of getting from the bottom left triangle to the bottom right triangle? You must only go from between triangles that share an edge and you can visit each triangle at most once. (You don’t have to visit all of the triangles.)
Prove for any natural number \(n\) that \((n + 1)(n + 2). . .(2n)\) is divisible by \(2^n\).
How many subsets are there of \(\{1,2,...,n\}\) (the integers from \(1\) to \(n\) inclusive) containing no consecutive
digits? That is, we do count \(\{1,3,6,8\}\) but do not count \(\{1,3,6,7\}\).
For example, when \(n=3\), we have
\(8\) subsets overall but only \(5\) contain no consecutive integers. The
\(8\) subsets are \(\varnothing\) (the empty set), \(\{1\}\), \(\{2\}\), \(\{3\}\), \(\{1,3\}\), \(\{1,2\}\), \(\{2,3\}\) and \(\{1,2,3\}\), but we exclude the final three
of these.
A round-robin tournament is one where each team plays every other
team exactly once. Five teams take part in such a tournament getting:
\(3\) points for a win, \(1\) point for a draw and \(0\) points for a loss. At the end of the
tournament the teams are ranked from first to last according to the
number of points.
Is it possible that at the end of the tournament, each team has a
different number of points, and each team except for the team ranked
last has exactly two more points than the next-ranked team?
How many ways can the numbers \(1,1,1,1,1,2,3,\dots,9\) be listed in such a way that none of the \(1\)’s are adjacent? The number 1 appears five times and each of \(2\) to \(9\) appear exactly once.
John’s local grocery store sells 7 kinds of vegetable, 7 kinds of meat, 7 kinds of grains and 7 kinds of cheese. John would like to plan the entire week’s dinners so that exactly one ingredient of each type is used per meal and no ingredients repeat during the week. How many ways can John plan the dinners?
Suppose there is an \(7 \times 7\) grid. We would like to travel from the bottom left corner to the top right corner in exactly 14 steps. A step is from one point on the grid to another point via a segment of length 1. How many paths are there? The picture below shows one possible path on the grid.
In an office, at various times during the day, the boss gives the secretary a letter to type, each time putting the letter on top of the pile of the secretary’s in-box. When there is time, the secretary takes the top letter off the pile and types it. There are nine letters to be typed during the day, and the boss delivers them in the order \(1,2,3,4,5,6,7,8,9\). While leaving for lunch, the secretary tells a colleague that letter 8 has already been typed, but says nothing else about the morning’s typing. The colleague wonders which of the nine letters remain to be typed after lunch and in what order they will be typed. Base upon the above information, how many such after-lunch orders are possible? (That there are no letters left to be typed is one of the possibilities.)
A library keeps track of its books by a code with two (not necessarily different) letters taken from A to Z, followed by a three digit number from 000 to 999. What is the maximum number of books one can keep in the library and still tell them apart by looking at their codes?
There is a secret gathering of a group of \(n\) aliens in a very dark room. You cannot see anyone in the room, but you hear the following questions.
“Is at least one of us a Goop?"
“Is the number of Goops amongst us an even number?"
“Is the number of Goops amongst us a multiple of 3?"
\(\dots\)
“Is the number of Goops amongst us a multiple of \(n\)?"
What are all the possible values of \(n\) such that this gathering can happen? Note that each of the \(n\) aliens have asked exactly one question.