olymmath

KURSCHAK 1985

Kürschák Competition 1985.

Other problems

Problem 1

We have triangulated a convex (n+1)(n+1) -gon P0P1…PnP_0P_1\dots P_n (i.e., divided it into n−1n-1 triangles with n−2n-2 non-intersecting diagonals). Prove that the resulting triangles can be labelled with the numbers 1,2,…,n−11,2,\dots,n-1 such that for any i∈{1,2,…,n−1}i\in\{1,2,\dots,n-1\} , PiP_i is a vertex of the triangle with label ii .

Problem 2

For every n∈Nn\in\mathbb{N} , define the power sum of nn as follows. For every prime divisor pp of nn , consider the largest positive integer kk for which pk≤np^k\le n , and sum up all the pkp^k 's. (For instance, the power sum of 100100 is 26+52=892^6+5^2=89 .) Prove that the power sum of nn is larger than nn for infinitely many positive integers nn .

Problem 3

We reflected each vertex of a triangle on the opposite side. Prove that the area of the triangle formed by these three reflection points is smaller than the area of the initial triangle multiplied by five.