We solve problems

Problems Geometry Plane geometry Plane transformations Parallel translation

Two circles of radius \(R\) touch at point \(E\). On one of them, point \(B\) is chosen and on the other point \(D\) is chosen. These points have a property of \(\angle BED = 90^{\circ}\). Prove that \(BD = 2R\).

Problem #PRU-58082

Problems Geometry Plane geometry Geometrical inequalities Inequalities in a triangle A segment inside the triangle is smaller than the largest side ,Problems Triangles Types of triangles Right-angled triangles Pythagorean theorem and its converse

12–14 4.0

A \(3\times 4\) rectangle contains 6 points. Prove that amongst them there will be two points, such that the distance between them is no greater than \(\sqrt5\).

Problem #PRU-58084

Problems Geometry Plane geometry Circles Circle, sector, segment, etc Methods Pigeonhole principle Pigeonhole principle (angles and lengths) Pigeonhole principle (finite number of poits, lines etc.)

12–13 4.0

There are 25 points on a plane, and among any three of them there can be found two points with a distance between them of less than 1. Prove that there is a circle of radius 1 containing at least 13 of these points.

Problem #PRU-58085

Problems Combinatorics Dissections, partitions, covers and tilings Covers Geometry Plane geometry Polygons Inscribed and circumscribed polygons Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

13–15 4.0

A unit square contains 51 points. Prove that it is always possible to cover three of them with a circle of radius \(\frac{1}{7}\).

Problem #PRU-58089

Problems Geometry Plane geometry Convex and non-convex figures Convex polygons Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

12–15 4.0

What is the minimum number of points necessary to mark inside a convex \(n\)-sided polygon, so that at least one marked point always lies inside any triangle whose vertices are shared with those of the polygon?

Problem #PRU-58094

Problems Geometry Plane geometry Circles Central angle. Arc length and circumference Connection between the arc length, the angle, and the chord Methods Pigeonhole principle Pigeonhole principle (angles and lengths)

13–15 4.0

Several chords are drawn through a unit circle. Prove that if each diameter intersects with no more than \(k\) chords, then the total length of all the chords is less than \(\pi k\).

Problem #PRU-58101

Problems Geometry Plane geometry Area Area of a circle, sector, segment Quadrilateral Parallelogram Special cases Rectangles and squares. Criteria and properties

14–15 4.0

A square of side 15 contains 20 non-overlapping unit squares. Prove that it is possible to place a circle of radius 1 inside the large square, so that it does not overlap with any of the unit squares.

Problem #PRU-60299

Problems Algebra and arithmetic Number theory. Divisibility Divisibility of a number. General properties Methods Algebraic methods Partitions into pairs and groups; bijections Pigeonhole principle Pigeonhole principle (other)

13–15 4.0

From the set of numbers 1 to \(2n\), \(n + 1\) numbers are chosen. Prove that among the chosen numbers there are two, one of which is divisible by another.

Problem #PRU-60354

Problems Methods Pigeonhole principle Pigeonhole principle (other)

13–15 4.0

There are \(2k+1\) cards numbered with the numbers \(1\) to \(2k+1\). What is the largest number of cards that can be chosen so that no number on a chosen card is equal to the sum of two numbers from two other chosen cards?

Problem #PRU-60359

Problems Algebra and arithmetic Number systems Decimal number system Methods Algebraic methods Partitions into pairs and groups; bijections Pigeonhole principle Pigeonhole principle (other)

14–16 4.0

We are given 51 two-digit numbers – we will count one-digit numbers as two-digit numbers with a leading 0. Prove that it is possible to choose 6 of these so that no two of them have the same digit in the same column.