olymmath

NL-BXMO-TST 2021

Dutch BxMO Team Selection Test 2021.

Other problems

Problem 1

Given is a cyclic quadrilateral ABCDABCD with ∣AB∣=∣BC∣|AB| = |BC| . Point EE is on the arc CDCD where AA and BB are not on. Let PP be the intersection point of BEBE and CDCD , let QQ be the intersection point of AEAE and BDBD . Prove that PQ∥ACPQ \parallel AC .

Problem 2

Find all triplets (x,y,z)(x, y, z) of real numbers for which {x2−yz=∣y−z∣+1y2−zx=∣z−x∣+1z2−xy=∣x−y∣+1\begin{cases}x^2- yz = |y-z| +1 y^2 - zx = |z-x| +1 z^2 -xy = |x-y| + 1 \end{cases}

Problem 3

Let pp be a prime number greater than 22 . Patricia wants 77 not-necessarily different numbers from {1,2,...,p}\{1, 2, . . . , p\} to the black dots in the figure below, on such a way that the product of three numbers on a line or circle always has the same remainder when divided by pp . Image

(a) Suppose Patricia uses the number pp at least once. How many times does she have the number pp then a minimum sum needed?

(b) Suppose Patricia does not use the number pp . In how many ways can she assign numbers? (Two ways are different if there is at least one black one dot different numbers are assigned. The figure is not rotated or mirrored.)

Problem 4

Jesse and Tjeerd are playing a game. Jesse has access to n≥2n\ge 2 stones. There are two boxes: in the black box there is room for half of the stones (rounded down) and in the white box there is room for half of the stones (rounded up). Jesse and Tjeerd take turns, with Jesse starting. Jesse grabs in his turn, always one new stone, writes a positive real number on the stone and places put him in one of the boxes that isn't full yet. Tjeerd sees all these numbers on the stones in the boxes and on his turn may move any stone from one box to the other box if it is not yet full, but he may also choose to do nothing. The game stops when both boxes are full. If then the total value of the stones in the black box is greater than the total value of the stones in the white box, Jesse wins; otherwise win Tjeerd. For every n≥2n \ge 2 , determine who can definitely win (and give a corresponding winning strategy).

Problem 5

Given is a triangle ABCABC with the property that ∣AB∣+∣AC∣=3∣BC∣|AB| + |AC| = 3|BC| . Let TT be the point on segment ACAC such that ∣AC∣=4∣AT∣|AC| = 4|AT| . Let KK and LL be points on the interior of line segments ABAB and ACAC respectively such that KL∥BCKL \parallel BC and KLKL is tangent to the inscribed circle of △ABC\vartriangle ABC . Let SS be the intersection of BTBT and KLKL . Determine the ratio ∣SL∣∣KL∣\frac{|SL|}{|KL|}