Documents

Problem I-1

Let R\mathbb{R} denote the set of all real numbers. For each pair (α,β)(\alpha, \beta) of nonnegative real numbers subject to α+β2\alpha + \beta \geq 2, determine all functions f ⁣:RRf\colon \mathbb{R} \to \mathbb{R} satisfying

f(x)f(y)f(xy)+αx+βyf(x)f(y) \leq f(xy) + \alpha x + \beta y

for all real numbers xx and yy.

Problem I-2

Find all integers n3n \geq 3 for which it is possible to draw nn chords of one circle such that their 2n2n endpoints are pairwise distinct and each chord intersects precisely kk other chords for:

(a) k=n2k = n - 2,

(b) k=n3k = n - 3.

Remark. A chord of a circle is a line segment whose both endpoints lie on the circle.

Problem I-3

Let ABCABC be a triangle with incenter II. The incircle ω\omega of ABCABC is tangent to the line BCBC at point DD. Denote by EE and FF the points satisfying AIBECFAI \parallel BE \parallel CF and BEI=CFI=90°\angle BEI = \angle CFI = 90°. Lines DEDE and DFDF intersect ω\omega again at points EE' and FF', respectively. Prove that EFAIE'F' \perp AI.

Problem I-4

Let nn and mm be positive integers. We call a set SS of positive integers (n,m)(n, m)-good if it satisfies the following three conditions:

(i) We have mSm \in S.

(ii) For all aSa \in S, all of the positive divisors of aa are elements of SS too.

(iii) For all mutually different numbers a,bSa, b \in S, we have an+bnSa^n + b^n \in S.

Determine all pairs (n,m)(n, m) such that the set of all positive integers is the only (n,m)(n, m)-good set.

Problem T-1

Let Z\mathbb{Z} denote the set of all integers and Z>0\mathbb{Z}_{>0} denote the set of all positive integers.

(a) A function f ⁣:ZZf\colon \mathbb{Z}\to \mathbb{Z} is called Z\mathbb{Z}-good if it satisfies f(a2+b)=f(b2+a)f(a^{2} + b) = f(b^{2} + a) for all a,bZa,b\in \mathbb{Z}. Determine the largest possible number of distinct values that can occur among f(1),f(2),,f(2023)f(1),f(2),\ldots ,f(2023), where ff is a Z\mathbb{Z}-good function.

(b) A function f ⁣:Z>0Z>0f\colon \mathbb{Z}_{>0}\to \mathbb{Z}_{>0} is called Z>0\mathbb{Z}_{>0}-good if it satisfies f(a2+b)=f(b2+a)f(a^{2} + b) = f(b^{2} + a) for all a,bZ>0a,b\in \mathbb{Z}_{>0}. Determine the largest possible number of distinct values that can occur among f(1),f(2),,f(2023)f(1),f(2),\ldots ,f(2023), where ff is a Z>0\mathbb{Z}_{>0}-good function.

Problem T-2

Let a,b,ca, b, c and dd be positive real numbers with abcd=1abcd = 1. Prove that

ab+1a+1+bc+1b+1+cd+1c+1+da+1d+14,\frac {a b + 1}{a + 1} + \frac {b c + 1}{b + 1} + \frac {c d + 1}{c + 1} + \frac {d a + 1}{d + 1} \geq 4,

and determine all quadruples (a,b,c,d)(a,b,c,d) for which equality holds.

Problem T-3

Find the smallest integer bb with the following property: For each way of colouring exactly bb squares of an 8×88 \times 8 chessboard green, one can place 7 bishops on 7 green squares so that no two bishops attack each other.

Remark. Two bishops attack each other if they are on the same diagonal.

Problem T-4

Let c4c \geq 4 be an even integer. In some football league, each team has a home uniform and an away uniform. Every home uniform is coloured in two different colours, and every away uniform is coloured in one colour. A team's away uniform cannot be coloured in one of the colours from the home uniform. There are at most cc distinct colours on all of the uniforms. If two teams have the same two colours on their home uniforms, then they have different colours on their away uniforms.

We say a pair of uniforms is clashing if some colour appears on both of them. Suppose that for every team XX in the league, there is no team YY in the league such that the home uniform of XX is clashing with both uniforms of YY. Determine the maximum possible number of teams in the league.

Problem T-5

We are given a convex quadrilateral ABCDABCD whose angles are not right. Assume there are points P,Q,R,SP, Q, R, S on its sides AB,BC,CD,DAAB, BC, CD, DA, respectively, such that PSBDPS \parallel BD, SQBCSQ \perp BC, PRCDPR \perp CD. Furthermore, assume that the lines PR,SQPR, SQ, and ACAC are concurrent. Prove that the points P,Q,R,SP, Q, R, S are concyclic.

Problem T-6

Let ABCABC be an acute triangle with AB<ACAB < AC. Let JJ be the center of the AA-excircle of ABCABC. Let DD be the projection of JJ on line BCBC. The internal bisectors of angles BDJBDJ and JDCJDC intersect lines BJBJ and JCJC at XX and YY, respectively. Segments XYXY and JDJD intersect at PP. Let QQ be the projection of AA on line BCBC. Prove that the internal angle bisector of QAP\measuredangle QAP is perpendicular to line XYXY.

Remark. The AA-excircle of the triangle ABCABC is the circle outside the triangle which is tangent to the lines ABAB, ACAC, and the line segment BCBC.

Problem T-7

Find all positive integers nn for which there exist positive integers a>ba > b satisfying

n=4abab.n = \frac{4ab}{a - b}.

Problem T-8

Let AA and BB be positive integers. Consider a sequence of positive integers (xn)n1(x_{n})_{n\geq 1} such that

xn+1=Agcd(xn,xn1)+Bfor every n2.x_{n+1} = A \cdot \gcd(x_{n}, x_{n-1}) + B \quad \text{for every } n \geq 2.

Prove that the sequence attains only finitely many different values.

Remark. We denote by gcd(a,b)\gcd(a, b) the greatest common divisor of positive integers aa and bb.