Let be a complex non-zero number such that . Prove that is uniquely representable as where and and .
Time allowed for this problem was 1 hour.
Iran Mathematical Olympiad 2009.
Let be a complex non-zero number such that . Prove that is uniquely representable as where and and .
Time allowed for this problem was 1 hour.
A sphere is inscribed in polyhedral . The faces of are coloured with black and white in a way that no two black faces share an edge. Prove that the sum of surface of black faces is less than or equal to the sum of the surface of the white faces.
Time allowed for this problem was 1 hour.
Sone of vertices of the infinite grid are missing. Let's take the remainder as a graph. Connect two edges of the graph if they are the same in one component and their other components have a difference equal to one. Call every connected component of this graph a branch. Suppose that for every natural the number of missing vertices in the square centered by the origin is less than . Prove that among the branches of the graph, exactly one has an infinite number of vertices.
Time allowed for this problem was 90 minutes.
Attachments: