Problem Set

29 April 2010
1. Each square of a chessboard contains 0. It is allowed to select any two squares connected by
knight move and to increase numbers in them by 1. Is it possible to obtain the chessboard filled
with integers 1, 2,…,64?

2. Find all positive integer solutions (x, y) to the equation

2𝑦 2 = 𝑥 4 + 8𝑥 3 + 8𝑥 2 − 32𝑥 + 15

3. In triangle ABC, angles B and C are acute and the altitude from A meets BC in K. Let M be an
arbitrary point on AK, let Q be the intersection of line BM with AC, and let P be the intersection
of line CM with AB. Prove that the <PKA = <QKA.

4. Denote by s(n) and k(n) the sum and the number of decimal digits of a positive integer n. Find
all the integers n such that k(n) · s(n2) = n + 1.

5. For every positive numbers a, b, c, x, y, z prove the inequality

3 3 3 3
𝑎 𝑏 + 1 𝑦𝑧 + 𝑏 𝑐 + 1 𝑧𝑥 + 𝑐 𝑎 + 1 𝑥𝑦 ≤ 𝑎+1 𝑏+1 𝑐+1 𝑥+1 𝑦+1 𝑧+1

6. When the town football championship finished it appeared that the team which took the first
place scored 1 goal, the team which took the second place scored 2 goals, and the team which
took the third place scored 3 goals and so on. Find the minimum number of teams for which it is
possible. (Each pair of teams played a single game. A team is given 3 points for victory; 1 point
for draw and nothing for lose. If two teams got the same number of points, the one with better
difference of the numbers of scored and missed goals ranks higher. If these parameters are
equal then the team which scored more goals ranks higher.)