P1
Part of Russian TST 2019
Problems(6)
Two sequences are equal
Source: Russian TST 2019, Day 7 P1 (Group NG), P2 (Groups A & B)
3/27/2023
Let and be sequences of real numbers such that , and a_i=\sqrt{\frac{a_{i+1}+a_{i-1}}{2}}, b_i=\sqrt{\frac{b_{i+1}+b_{i-1}}{2}},for all . Prove that .
algebraSequences
Schedule of a school
Source: Russian TST 2019, Day 5 P1
3/22/2023
A school organizes optional lectures for 200 students. At least 10 students have signed up for each proposed lecture, and for any two students there is at most one lecture that both of them have signed up for. Prove that it is possible to hold all these lectures over 211 days so that no one has to attend two lectures in one day.
combinatoricsgraph theory
Inequality with divisors
Source: Russian TST 2019, Day 7 P1 (Groups A & B)
3/27/2023
A positive integer is called discontinuous if for all its natural divisors , written out in ascending order, there exists such that . Prove that there are infinitely many positive integers such that are all discontinuous.
number theoryDivisors
Pentagon geometry
Source: Russian TST 2019, Day 8 P1 (Groups A & B)
3/27/2023
A convex pentagon is given such that . The circle centered at point passes through and and touches the segment at point . Let the circle centered at the point be the circumcircle of the triangle . It is known that and . Prove that the tangents at points and to the circle intersect on .
geometrypentagon
Isosceles triangle geo
Source: Russian TST 2019, Day 10 P1 (Group NG), P2 (Groups A & B)
3/27/2023
Point is the middle of the side side of the isosceles triangle . On the extension of the base , point is marked such that is between and , and point is marked on the segment . The circumcircle of the triangle intersects the segment a second time at point . Prove that it is possible to make a triangle from the segments and .
geometry
Graph problem
Source: Russian TST 2019, Day 9 P1 (Groups A & B)
3/27/2023
The shores of the Tvertsy River are two parallel straight lines. There are point-like villages on the shores in some order: 20 villages on the left shore and 15 villages on the right shore. We want to build a system of non-intersecting bridges, that is, segments connecting a couple of villages from different shores, so that from any village you can get to any other village only by bridges (you can't walk along the shore). In how many ways can such a bridge system be built?
graph theorycombinatorics