2
Part of 2011 All-Russian Olympiad
Problems(6)
Acute triangle
Source: All-Russian 2011
5/17/2011
Given is an acute angled triangle . A circle going through and the triangle's circumcenter, , intersects and at points and respectively. Prove that the intersection of the heights of the triangle lies on line .
geometrycircumcirclegeometric transformationgeometry proposed
Notebooks
Source: All-Russian 2011
5/17/2011
In the notebooks of Peter and Nick, two numbers are written. Initially, these two numbers are 1 and 2 for Peter and 3 and 4 for Nick. Once a minute, Peter writes a quadratic trinomial , the roots of which are the two numbers in his notebook, while Nick writes a quadratic trinomial the roots of which are the numbers in his notebook. If the equation has two distinct roots, one of the two boys replaces the numbers in his notebook by those two roots. Otherwise, nothing happens. If Peter once made one of his numbers 5, what did the other one of his numbers become?
quadraticsinvariantVietainductionalgebrapolynomialarithmetic sequence
Nine quadratics
Source: All-Russian 2011
5/17/2011
Nine quadratics, are written on the board. The sequences and are arithmetic. The sum of all nine quadratics has at least one real root. What is the the greatest possible number of original quadratics that can have no real roots?
quadraticsalgebra proposedalgebraQuadratic
Prove angle is right
Source: All-Russian 2011
5/17/2011
Given is an acute triangle . Its heights and are extended past points and . On these extensions, points and are chosen, such that angle is right. Let be a height of triangle . Prove that angle is a right angle.
geometrygeometry proposed
Parallelogram
Source: All-Russian 2011
5/17/2011
On side of parallelogram ( is acute) lies point so that triangle is an acute triangle. Let , , and be the circumcenters of triangles , , and respectively. Prove that the orthocenter of triangle lies on line .
geometryparallelogramcircumcirclegeometric transformationreflectionsymmetrygeometry proposed
ARO 2011 11-6
Source:
5/6/2011
There are more than stones on the table. Peter and Vasya play a game, Peter starts. Each turn, a player can take any prime number less than stones, or any multiple of stones, or stone. Prove that Peter always can take the last stone (regardless of Vasya's strategy).S Berlov
combinatorics proposedcombinatoricsgame