We solve problems

Problems Combinatorics Dissections, partitions, covers and tilings Various dissection problems

Cut a square into three pieces, from which you can construct a triangle with three acute angles and three different sides.

Problem #PRU-103815

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Algebra and arithmetic Word problems Tables and tournaments Tables and tournaments (other)

11–11 2.0

Cut the board shown in the figure into four congruent parts so that each of them contains three shaded cells. Where the shaded cells are placed in each part need not be the same.

Problem #PRU-103843

Problems Combinatorics Dissections, partitions, covers and tilings

12–12 2.0

Cut the figure (on the boundaries of cells) into three equal parts (the same in shape and size).

Problem #PRU-103884

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Methods Examples and counterexamples. Constructive proofs Algebra and arithmetic Fractions Simple fractions

11–12 2.0

A rectangle is cut into several smaller rectangles, the perimeter of each of which is an integer number of meters. Is it true that the perimeter of the original rectangle is also an integer number of meters?

Problem #PRU-103885

Problems Combinatorics Dissections, partitions, covers and tilings Tilings with ordinary and domino tiles

11–12 2.0

At the disposal of a tile layer there are 10 identical tiles, each of which consists of 4 squares and has the shape of the letter L (all tiles are oriented the same way). Can he make a rectangle with a size of \(5 \times 8\)? (The tiles can be rotated, but you cannot turn them over). For example, the figure shows the wrong solution: the shaded tile is incorrectly oriented.

Problem #PRU-104001

Problems Combinatorics Dissections, partitions, covers and tilings Various dissection problems

12–13 2.0

Kai has a piece of ice in the shape of a “corner” (see the figure). The Snow Queen demanded that Kai cut it into four equal parts. How can he do this?

Problem #PRU-107702

Problems Geometry Solid geometry Parallelepipeds Special cases of parallelepipeds Cube Combinatorics Dissections, partitions, covers and tilings Features of dissection pieces Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

13–16 3.0

The surface of a \(3\times 3\times 3\) Rubik’s Cube contains 54 squares. What is the maximum number of squares we can mark, so that no marked squares share a vertex or are directly adjacent to another marked square?

Problem #PRU-109018

Problems Combinatorics Dissections, partitions, covers and tilings Covers Methods Pigeonhole principle Pigeonhole principle (angles and lengths)

12–14 3.0

A circle is covered with several arcs. These arcs can overlap one another, but none of them cover the entire circumference. Prove that it is always possible to select several of these arcs so that together they cover the entire circumference and add up to no more than \(720^{\circ}\).

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-115449

Problems Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) 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?