Subcontests
(6)Board numbers can be eventually all equal
Let n≥2 be an integer and let a1,a2,⋯an be fixed positive integers (not necessarily all distinct) in such a way that gcd(a1,a2⋯an)=1. In a board the numbers a1,a2⋯an are all written along with a positive integer x. A move consists of choosing two numbers a>b from the n+1 numbers in the board and replace them with a−b,2b. Find all possible values of x, with respect of the values of a1,a2⋯an, for which it is possible to achieve a finite sequence of moves (possibly none) such that eventually all numbers written in the board are equal. Red geometry!?
We color some points in the plane with red, in such way that if P,Q are red and X is a point such that triangle △PQX has angles 30º,60º,90º in some order, then X is also red. If we have vertices A,B,C all red, prove that the barycenter of triangle △ABC is also red. American point shows in Ibero geo!
Let △ABC be an acute triangle and let M,N be the midpoints of AB,AC respectively. Given a point D in the interior of segment BC with DB<DC, let P,Q the intersections of DM,DN with AC,AB respectively. Let R=A be the intersection of circumcircles of triangles △PAQ and △AMN. If K is midpoint of AR, prove that ∠MKN=2∠BAC Inequality with number of divisors
For each positive integer n, let d(n) be the number of positive integer divisors of n.
Prove that for all pairs of positive integers (a,b) we have that:
d(a)+d(b)≤d(gcd(a,b))+d(lcm(a,b))
and determine all pairs of positive integers (a,b) where we have equality case.