Problems

Today we will be finding the areas of some geometric figures. Here is a brief reminder of how to calculate the area of common shapes.

In the picture below, the area of the rectangle is \(|AB|\times |AD|\).

The area of a triangle is given by \(\frac{1}{2}bh\), where \(b\) is the length of a chosen base and \(h\) is the height. In this case, the segment \(AB\) is the base and \(CD\) is the altitude corresponding to the base \(AB\).

The area of a circle with radius \(r\) is \(\pi r^2\). The number \(\pi\) is approximately 3.14159 to five decimal points.

A simple polygon is a polygon that does not intersect itself and has no holes. Suppose we have a simple polygon \(S\) whose vertices consists of only integer coordinates.

The area turns out to be remarkably easy to calculate. Count up the number of points with integer coordinate inside the polygon and on the boundary; call them \(i\) and \(b\) respectively. The area is then \[A(S) = i+\frac{b}{2}-1.\]

In the picture above, \(i=3\) and \(b=11\), so \(A(S) = \frac{15}{2}\).

Let \(\phi(n)\) be the Euler’s function, namely the amount of numbers from \(1\) to \(n\), coprime with \(n\). For two natural numbers \(m,n\) such that \(\mathbb{GCD}(m,n)=1\) prove that \(\phi(mn) = \phi(m)\phi(n)\).

All of the rectangles in the figure below, which is drawn to scale, are similar to the big rectangle (that is, their sides are in the same ratio). Each number represents the area of the rectangle. What is the length \(AB\)?

Each square in a \(3\times3\) grid of squares is coloured red, white, blue, or green so that every \(2\times2\) square contains one square of each color. One such colouring is shown on the right below. How many different colourings are possible?

For any positive integer \(k\), the factorial \(k!\) is defined as a product of all integersbetween 1 and \(k\) inclusive: \(k! = k \times (k − 1) \times ... \times 1\). What’s the remainder when \(2025!+2024!+2023!+...+3!+2!+1!\) is divided by \(8\)?

There are two imposters and seven crewmates on the rocket ‘Plus’. How many ways are there for the nine people to split into three groups of three, such that each group has at least two crewmates? The two imposters and seven crewmates are all distinguishable from each other, but we’re not concerned with the order of the three groups.

For example: \(\{I1,C1,C2\}\), \(\{I2,C3,C4\}\) and \(\{C5,C6,C7\}\) is the same as
\(\{C3,C4,I2\}\), \(\{C5,C6,C7\}\) and \(\{I1,C2,C1\}\) but different from
\(\{I2,C1,C2\}\), \(\{I1,C3,C4\}\) and \(\{C5,C6,C7\}\).

Let \(n\) be a natural number, and let \(d(n)\) be the number of factors of \(n\). For example, the factors of \(6\) are \(1,2,3,6\), so \(d(6)=4\). Find all \(n\) such that \(d(n)+d(n+1)=5\).

King Hattius has three prisoners and gives them the following puzzle. He will put a randomly coloured hat on each of their heads: red, blue or green. He’ll then give them \(10\) seconds for them to each guess their own hat’s colour at the same time.

However! Each prisoner can only see the other two prisoners’ hats, not their own. There are no mirrors in the prison, and they are not allowed to take off their hat, nor talk, mouth, use sign-language, or otherwise communicate with the other two prisoners during those ten seconds.

Hattius tells them that he’ll release them all if at least one correctly guesses their hat’s colour. He gives them an hour to come up with a strategy - what should their strategy be?

Two aliens want to abduct two humans, but aren’t paying attention, so instead run after pigs. On the first move, the aliens move one square horizontally or vertically. Then on the second move, the pigs move horizontally or vertically. The third move is for the aliens, the fourth move is for the pigs, and so on. If an alien lands on a square with a pig on it, then they’ve succeeded. Show that no matter what the pigs do, they’re doomed.