We solve problems

Problem #PRU-110072

Problems 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-115384

Problems 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-32075

Problems Combinatorics Geometry on grid paper Methods Pigeonhole principle Pigeonhole principle (area and volume) Dissections, partitions, covers and tilings Various dissection problems

12–14 4.0

One corner square was cut from a chessboard. What is the smallest number of equal triangles that can be cut into this shape?

Problem #PRU-86120

Problems Combinatorics Geometry on grid paper Methods Pigeonhole principle Pigeonhole principle (other)

13–15 4.0

A board of size \(2005\times2005\) is divided into square cells with a side length of 1 unit. Some board cells are numbered in some order by numbers 1, 2, ... so that from any non-numbered cell there is a numbered cell within a distance of less than 10. Prove that there can be found two cells with a distance between them of less than 150, which are numbered by numbers that differ by more than 23. (The distance between the cells is the distance between their centres.)