olymmath

KURSCHAK 1989

Kürschák Competition 1989.

Other problems

Problem 1

In the plane, two intersecting lines aa and bb are given, along with a circle ω\omega that has no common points with these lines. For any line ℓ∣∣b\ell||b , define A=ℓ∩aA=\ell\cap a , and {B,C}=ℓ∩ω\{B,C\}=\ell\cap \omega such that BB is on segment ACAC . Construct the line ℓ\ell such that the ratio ∣BC∣∣AB∣\frac{|BC|}{|AB|} is maximal.

Problem 2

For any positive integer nn denote S(n)S(n) the digital sum of nn when represented in the decimal system. Find every positive integer MM for which S(Mk)=S(M)S(Mk)=S(M) holds for all integers 1≤k≤M1\le k\le M .

Problem 3

We play the following game in a Cartesian coordinate system in the plane. Given the input (x,y)(x,y) , in one step, we may move to the point (x,y±2x)(x,y\pm 2x) or to the point (x±2y,y)(x\pm 2y,y) . There is also an additional rule: it is not allowed to make two steps that lead back to the same point (i.e, to step backwards).

Prove that starting from the point (1;2)\left(1;\sqrt 2\right) , we cannot return to it in finitely many steps.