2
Part of 2004 Estonia National Olympiad
Problems(4)
a_i-a_j of 5 different positive integers are different, least value of max a_i
Source: 2004 Estonia National Olympiad Final Round grade 9 p2
3/25/2020
The positive differences of five different positive integers are all different (there are altogether such differences). Find the least possible value of the largest number among the .
minmaxDifferencealgebra
angle bisestor of <APC passes throug D, ABCD parallelogram, AM=CN,
Source: 2004 Estonia National Olympiad Final Round grade 10 p2
3/25/2020
On side, of a parallelogram lie points respectively such that . Let be the intersection of and . Prove that the angle bisector of passes through .
geometryangle bisectorparallelogramequal segments
1/OK+ 1/OJ is contant for a line passing through a point on angle bisector
Source: 2004 Estonia National Olympiad Final Round grade 11 p2
3/25/2020
Draw a line passing through a point on the angle bisector of the angle , that intersects and at points and respectively. Prove that the valus of the sum does not depend on the choice of the straight line passing through , i.e. is defined by the size of the angle AOB and the selection of the point only.
Sumindependentfixedgeometryangle bisector
game with moving a button on a bar of 19 adjacent squares
Source: 2004 Estonia National Olympiad Final Round grade 12 p2
3/25/2020
Albert and Brita play a game with a bar of adjacent squares. Initially, there is a button on the middle square of the bar. At every turn Albert mentions one positive integer less than , and Brita moves button a number of squares in the direction of her choice - while doing so however, Brita must not move the button more than twice in one direction order. Prove that Albert can choose the numbers so that by the th turn, Brita to be forced to move the button out of the bar.
combinatoricsgamegame strategy