Problems
Consider the 7 different tetrominoes. Is it possible to cover a \(4\times7\) rectangle with exactly one copy of each of the tetrominoes? If it is possible, provide an example layout. If it is not possible, prove that it’s impossible.
We allow rotation of the tetrominoes, but not reflection. This means that we consider \(S\) and \(Z\) as different, as well as \(L\) and \(J\).
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.)
I have three positive integers. When you add them together, you get \(15\). When you multiply the three numbers together, you get \(120\).
What are the three numbers?
Is there a divisibility rule for \(2^n\), where \(n = 1\), \(2\), \(3\), . . .? If so, then explain why the rule works.
Can you find a formula relating \(1^3+2^3+\dots+n^3\) to \(1+2+\dots+n\)?
Prove the reverse triangle inequality: for every pair of real numbers \(x\), \(y\), we have \(\left| \left| x \right| - \left| y \right| \right| \leq \left| x - y \right|\).
Can you come up with a divisibility rule for \(5^n\), where \(n=1\), \(2\), \(3\), . . .? Prove that the rule works.
Show that for each \(n=1\), \(2\), \(3\), . . ., we have \(n<2^n\).
You and I are going to play a game. We have one million grains of sand in a bag. We take it in turns to remove \(2\), \(3\) or \(5\) grains of sand from the bag. The first person that cannot make a move loses.
Would you go first?