We solve problems

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties

Cutting into four parts. Cut each of the figures below into four equal parts (you can cut along the sides and diagonals of cells).

Problem #PRU-103815

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Algebra 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-103884

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Methods Examples and counterexamples. Constructive proofs Algebra 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-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-65718

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Methods Examples and counterexamples. Constructive proofs Pigeonhole principle Pigeonhole principle (other)

12–14 3.0

In a \(10 \times 10\) square, all of the cells of the upper left \(5 \times 5\) square are painted black and the rest of the cells are painted white. What is the largest number of polygons that can be cut from this square (on the boundaries of the cells) so that in every polygon there would be three times as many white cells than black cells? (Polygons do not have to be equal in shape or size.)

Problem #PRU-87939

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties Set theory and logic Set theory Unusual constructions

10–14 2.0

Is it possible to cut out such a hole in a sheet of paper through which a person could climb through?

Problem #PRU-88084

Problems Combinatorics Dissections, partitions, covers and tilings Dissections with certain properties

10–12 2.0

Is it possible to cut a square into four parts so that each part touches each of the other three (ie has common parts of a border)?