P1
Part of Russian TST 2015
Problems(7)
No worms were hurt in the making of this problem
Source: Russian TST 2015, Day 7 P1
4/20/2023
A worm is called an adult if its length is one meter. In one operation, it is possible to cut an adult worm into two (possibly unequal) parts, each of which immediately becomes a worm and begins to grow at a speed of one meter per hour and stops growing once it reaches one meter in length. What is the smallest amount of time in which it is possible to get adult worms starting with one adult worm? Note that it is possible to cut several adult worms at the same time.
combinatorics
Japan 2005 reboot
Source: Russian TST 2015, Day 8 P1 (Group NG), P2 (Groups A & B)
4/21/2023
Let and be polynomials in two variables with integer coefficients. The sequences of integers and satisfy a_{n+1}=P(a_n,b_n), b_{n+1}=Q(a_n,b_n)for all . Let be the number of integer points of the coordinate plane, lying strictly inside the segment with endpoints and . Prove that the sequence is non-decreasing.
algebrapolynomiallattice points
Inequality with high-order roots
Source: Russian TST 2015, Day 8 P1 (Groups A & B)
4/21/2023
Let be a natural number. Prove that
algebrainequalities
Only squares staisfy these conditions
Source: Russian TST 2015, Day 10 P1 (Group NG), P2 (Groups A & B)
4/21/2023
The points are selected respectively on the sides of the cyclic quadrilateral . It is known that and Prove that is a square.
geometrysquare
Easy divisibility NT
Source: Russian TST 2015, Day 9 P1 (Groups A & B)
4/21/2023
Find all pairs of natural numbers satisfying the following conditions:[*] is divisible by and
[*] is divisible by .
number theoryDivisibility
L-trominoes on board
Source: Russian TST 2015, Day 10 P1 (Group NG), P2 (Groups A & B)
4/21/2023
A chessboard is given, the cells of which are painted white and black alternatively so that the corner cells are black. There are [url=https://i.stack.imgur.com/V1kdh.png]L-trominoes placed on the board, no two of which overlap and which cover all of the black cells. Find the smallest possible value of .
combinatoricsboard
Cute NT with bounding
Source: Russian TST 2015, Day 10 P1 (Groups A & B)
4/21/2023
Prove that there exist two natural numbers such that for any relatively prime natural numbers .
number theoryprime numbers