Each of the integers from 1 to 4027 has been colored either green or red. Changing the color of a number is making it red if it was green and making it green if it was red. Two positive integers and are said to be cuates if either or is a prime number. A step consists in choosing two numbers that are cuates and changing the color of each of them. Show it is possible to apply a sequence of steps such that every integer from 1 to 2014 is green.
OMM 2014
Mexican Mathematical Olympiad 2014.
Other problems
A positive integer is said to reduce to a positive integer if when dividing by its units digits the result is . For example, 2015 reduces to . Find all the positive integers that become 1 after some amount of reductions. For example, 12 is one such number because 12 reduces to 6 and 6 reduces to 1.
Let be a circle and a point outside of . The tangents from to touch the circle at and . Let be the midpoint of and the circle through , and . Line cuts at , line cuts at , segment cuts at and line cuts at , with in segment . Prove lines , , and are concurrent.
Problem 4
Let be a rectangle with diagonals and . Let be the intersection of the bisector of with segment , on such that is midpoint of , and on such that (with between and ). Prove that the circumference through , and is tangent to .
Let be positive reals such that . Prove:
And determine when equality holds.
Let be the number of positive divisors of a positive integer (including and ). Find all values of such that .