Problems(5)
AB x CD = AC x BD if <A + <C = 60^o and AB x CD = BC xAD
Source: 2014 Romania JBMO TST 1.4
5/31/2020
Let be a quadrilateral with . If , prove that .Leonard Giugiuc
geometryanglesratio
path of a chess knight , n colors, nxn board
Source: 2014 Romania JBMO TST 2.4
6/3/2020
Let be an integer. We have at our disposal colors. We color each of the unit squares of an board with one of the colors.
a) Prove that, for any such coloring, there exists a path of a chess knight from the bottom-left to the upper-right corner, that does not use all the colors.
b) Prove that, if we reduce the number of colors to , then the statement from a) is true for infinitely many values of and it is false also for infinitely many values of
floor functionColoringcombinatorics
D lies on the circumcircle of triangle XY Z, incircle, orthocenter related
Source: 2014 Romania JBMO TST 3.4
5/31/2020
In the acute triangle , with , let denote the midpoint of the side and denote the feet of the altitudes drawn from and , respectively. Let be the intersection point of the tangents in and to the circumcircle of triangle be the intersection point of lines and and be the intersection point of lines and .
a) Prove that is the incircle of triangle .
b) The circumcircles of triangles and meet again at . Prove that the orthocenter of triangle is on the line .
c) Prove that the point lies on the circumcircle of triangle .
geometrycircumcircleincircleorthocenter
concyclic wanted, intersecting chords related
Source: 2014 Romania JBMO TST 4.4
5/31/2020
In a circle, consider two chords that intersect at , lines and meet at . Let be the projection of onto . We denote by the midpoints of the segment lines and , respectively. Prove that the points are concyclic.
geometryConcyclicChordsmidpoints
turn all coins tail up after a finite number of moves, equilateral
Source: 2014 Romania JBMO TST 5.4
6/3/2020
On each side of an equilateral triangle of side consider points that divide the sides into equal segments. Through these points draw parallel lines to the sides of the triangles, obtaining a net of equilateral triangles of side length . On each of the vertices of the small triangles put a coin head up. A move consists in flipping over three mutually adjacent coins. Find all values of for which it is possible to turn all coins tail up after a finite number of moves.Colombia 1997
Equilateralcombinatorial geometrycombinatorics