We solve problems

Problems Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

A regular hexagon with sides of length \(5\) is divided by straight lines, that are parallel to its sides, to form regular triangles with sides of length 1. We call the vertices of all such triangles nodes. It is known that more than half of the nodes are marked. Prove that there are five marked nodes lying on one circle.

Problem #PRU-109937

Problems Methods Invariants and semi-invariants Invariants Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Algebraic methods Processes and operations Proof by exhaustion

14–16 4.0

We are given a table of size \(n \times n\). \(n-1\) of the cells in the table contain the number \(1\). The remainder contain the number \(0\). We are allowed to carry out the following operation on the table:

1. Pick a cell.

2. Subtract 1 from the number in that cell.

3. Add 1 to every other cell in the same row or column as the chosen cell.

Is it possible, using only this operation, to create a table in which all the cells contain the same number?

Problem #PRU-110072

Problems Discrete Mathematics Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Geometry on grid paper Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

12–14 4.0

A target consists of a triangle divided by three families of parallel lines into 100 equilateral unit triangles. A sniper shoots at the target. He aims at a particular equilateral triangle and either hits it or hits one of the adjacent triangles that share a side with the one he was aiming for. He can see the results of his shots and can choose when to stop shooting. What is the largest number of triangles that the sniper can guarantee he can hit exactly 5 times?

Problem #PRU-110083

Problems Discrete Mathematics Combinatorics Painting problems Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Fun Problems Word Problems Tables and tournaments Tables and tournaments (other)

12–14 3.0

Can the cells of a \(5 \times 5\) board be painted in 4 colours so that the cells located at the intersection of any two rows and any two columns are painted in at least three colours?

Problem #PRU-111000

Problems Discrete Mathematics Combinatorics Integer lattices Integer lattices (other) Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

12–14 3.0

Inside a square with side 1 there are several circles, the sum of the radii of which is 0.51. Prove that there is a line that is parallel to one side of the square and that intersects at least 2 circles.

Problem #PRU-111682

Problems Fun Problems Word Problems Tables and tournaments Chessboards and chess pieces Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Proof by contradiction

12–14 3.0

100 queens, that cannot capture each other, are placed on a \(100 \times 100\) chessboard. Prove that at least one queen is in each \(50 \times 50\) corner square.

Problem #PRU-115384

Problems Discrete Mathematics Combinatorics Geometry on grid paper Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

12–14 4.0

A game of ’Battleships’ has a fleet consisting of one \(1\times 4\) square, two \(1\times 3\) squares, three \(1\times 2\) squares, and four \(1\times 1\) squares. It is easy to distribute the fleet of ships on a \(10\times 10\) board, see the example below. What is the smallest square board on which this fleet can be placed? Note that by the rules of the game, no two ships can be placed on horizontally, vertically, or diagonally adjacent squares.

Problem #PRU-115449

Problems Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Discrete Mathematics Combinatorics Dissections, partitions, covers and tilings Tilings with ordinary and domino tiles

13–16 4.0

What is the smallest number of ‘L’ shaped ‘corners’ out of 3 squares that can be marked on an \(8\times 8\) square grid, so that no more ’corners’ would fit?

Problem #PRU-115467

Problems Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

12–15 4.0

10 children, including Billy, attended Billy’s birthday party. It turns out that any two children picked from those at the party share a grandfather. Prove that 7 of the children share a grandfather.

Problem #PRU-116301

Problems Geometry Plane geometry Geometrical inequalities Area inequalities Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Area

13–14 4.0

101 random points are chosen inside a unit square, including on the edges of the square, so that no three points lie on the same straight line. Prove that there exist some triangles with vertices on these points, whose area does not exceed 0.01.