In the Padurea forest there are 100 rest stops. There are 1000 trails, each connecting a pair of rest stops. Each trail has some particular level of difficulty with no two trails having the same difficulty. An intrepid hiker, Sendeirismo has decided to spend a vacation by taking a hike consisting of 20 trails of ever increasing difficulty.
Can he be sure that it can be done?

He is free to choose the starting rest stop and the 20 trails from a sequence where the start of one trail is the end of a previous one.

Place one hiker in each of the rest stops. Now, go through the trails in the forest one by one, in increasing difficulty, and every time you pick a trail, let the two hikers in its ends change places. This way the 100 hikers would traverse 2000 trails in total, and therefore one of them would traverse at least 20 trails.

## Piece of Cake

In how many equal pieces can you cut a round cake using only 3 slices?

Eight pieces. Cut the cake into four identical pieces with two vertical slices and then make a third horizontal slice through the center.

## Battleship

A battleship starts moving at 12 PM from an integer point on the real line with constant speed, landing on every hour again on an integer point. Every day at midnight you can shoot at an arbitrary point on the real plane, trying to destroy the battleship. Can you find a strategy with which you will eventually succeed to do this?

If we know the starting point of the battleship and its speed, then we can determine its position at any time after 12 PM.

There are countably many combinations (X, Y) of starting point and speed. We can order them in the following way:

(0, 0) – starting point 0, speed 0;
(0, 1) – starting point 0, speed +1;
(1, 0) – starting point 1, speed 0;
(0, -1) – starting point 0, speed -1;
(1, 1) – starting point 1, speed +1;
(-1, 0) – starting point -1, speed 0;
(0, 2) – starting point 0, speed +2;
(1, -1) – starting point 1, speed -1;
(-1, 1) – starting point -1, speed 1;
(2, 0)- starting point 2, speed 0,
and so on. Of course, we can choose the ordering in many different ways.

Now we can start exhausting all possibilities one after another. First we assume the combination is (0, 0), calculate where the battleship would be at midnight during the first day and shoot there. Then we assume the combination is (0, 1), calculate where the battleship would be at midnight during the second day and shoot there. If we continue like this, eventually we will hit the battleship.

## Left or Right

In which direction is this bus moving – towards the left or towards the right?

Since we can not see the passenger doors, they should be on the other side of the bus, and therefore the bus should be on the other side of the street. Here we assume the bus is from a right-hand traffic country.

## Soccer Ball

Almost everyone knows how a soccer ball looks like – there are several black regular pentagons on it and around each of them – five white regular hexagons. Around each hexagon there are three pentagons and three more hexagons. However, can you figure out how many pentagons and hexagons are there in total on the surface of the ball?

Let the number of pentagons is equal to P and the number of hexagons is equal to H. Then the number of edges is equal to (5P + 6H)/2 – that’s because every pentagon has five edges, every hexagon has 6 edges and every edge belongs to 2 sides. Also, the number of vertices is equal to (5P + 6H)/3 – that’s because every pentagon has five vertices, every hexagon has 6 vertices and every vertex belongs to 3 sides. Now using Euler’s Theorem we get P + H + (5P + 6H)/3 – (5P + 6H)/2 = 2, or equivalently P/6=2 and therefore P = 12. Since around every pentagon there are exactly 5 hexagons and around every hexagon there are exactly 3 pentagons, we get H = 5P/3 = 20. Therefore there are 12 pentagons and 20 hexagons on a soccer ball.

## Puzzle Sum 2

What two cities do these sums spell?

CHIN – N + CAGE – E + O = CHICAGO
ROPE + N – PEN + CHEST + ENGINEER – ENGINE = ROCHESTER

## Ants Maze

Find a non-intersecting closed path, passing through all four ants, which traverses this double-sided maze. You can not switch between the top and the bottom side of the path at no times.

The solution is shown below.