We solve problems

Problem #PRU-109476

Problems Fun Problems Word Problems Solving problems by inequalities. Going through the cases. Discrete Mathematics Set theory and logic Mathematical logic Mathematical logic (other)

11–14 2.0

Sarah believes that two watermelons are heavier than three melons, Anna believes that three watermelons are heavier than four melons. It is known that one of the girls is right, and the other is mistaken. Is it true that 12 watermelons are heavier than 18 melons? (It is believed that all watermelons weigh the same and all melons weigh the same.)

Problem #PRU-109482

Problems Discrete Mathematics Algorithm Theory Balance puzzles

10–13 3.0

A row of 4 coins lies on the table. Some of the coins are real and some of them are fake (the ones which weigh less than the real ones). It is known that any real coin lies to the left of any false coin. How can you determine whether each of the coins on the table is real or fake, by weighing once using a balance scale?

Problem #PRU-109527

Problems Methods Pigeonhole principle Pigeonhole principle (other) Proof by contradiction Fun Problems Word Problems Tables and tournaments Tables and tournaments (other)

11–13 3.0

What is the largest number of counters that can be put on the cells of a chessboard so that on each horizontal, vertical and diagonal (not only on the main ones) there is an even number of counters?

Problem #PRU-109534

Problems Calculus Real numbers Integer and fractional parts. Archimedean property Methods Pigeonhole principle Pigeonhole principle (angles and lengths)

13–15 3.0

Seven triangular pyramids stand on the table. For any three of them, there is a horizontal plane that intersects them along triangles of equal area. Prove that there is a plane intersecting all seven pyramids along triangles of equal area.

Problem #PRU-109573

Problems Calculus Real numbers Integer and fractional parts. Archimedean property Methods Pigeonhole principle Pigeonhole principle (angles and lengths)

13–15 3.0

Prove that for all \(x\), \(0 < x < \pi /3\), we have the inequality \(\sin 2x + \cos x > 1\).

Problem #PRU-109574

Problems Methods Mathematical induction Mathematical induction (other) Pigeonhole principle Pigeonhole principle (other)

13–16 4.0

On a particular day it turned out that every person living in a particular city made no more than one phone call. Prove that it is possible to divide the population of this city into no more than three groups, so that within each group no person spoke to any other by telephone.

Problem #PRU-109704

Problems Algebra Algebraic inequalities and systems of inequalities Algebraic inequalities (other) Methods Algebraic methods Counting in two ways Calculus Real numbers Integer and fractional parts. Archimedean property

13–15 4.0

Prove that for any positive integer \(n\) the inequality

is true.

Problem #PRU-109715

Problems Algebra Sequences Progressions Geometric progression Calculus Real numbers Integer and fractional parts. Archimedean property Sums of number sequences and difference series

13–15 4.0

Find the sum \(1/3 + 2/3 + 2^2/3 + 2^3/3 + \dots + 2^{1000}/3\).

Problem #PRU-109748

Problems Geometry Plane geometry Convex and non-convex figures Convex polygons Discrete Mathematics Combinatorics Painting problems Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.) Polygons Polygons (other)

13–15 4.0

We are given a convex 200-sided polygon in which no three diagonals intersect at the same point. Each of the diagonals is coloured in one of 999 colours. Prove that there is some triangle inside the polygon whose sides lie some of the diagonals, so that all 3 sides are the same colour. The vertices of the triangle do not necessarily have to be the vertices of the polygon.

Problem #PRU-109754

Problems Geometry Solid geometry Visual geometry in space

11–13 2.0

Prove that for all \(x \in (0;\pi /2)\) for \(n > m\), where \(n, m\) are natural, we have the inequality \(2 | \sin^n x-\cos^n x | \leq 3 | \sin^m x-\cos^m x |\);