olymmath

BALKAN-SL 2015

Balkan MO Shortlist 2015.

Other problems

A2

Let a,b,ca,b,c be sidelengths of a triangle and r,R,sr,R,s be the inradius, the circumradius and the semiperimeter respectively of the same triangle. Prove that: 1a+b+1a+c+1b+c≤r16Rs+s16Rr+118s\frac{1}{a + b} + \frac{1}{a + c} + \frac{1}{b + c} \leq \frac{r}{16Rs}+\frac{s}{16Rr} + \frac{11}{8s} (Albania)

A3

Let a ,b,c,b,c be sidelengths of a triangle and ma,mb,mcm_a,m_b,m_c the medians at the corresponding sides. Prove that ma(ba−1)(ca−1)+mb(ab−1)(cb−1)+mc(ac−1)(bc−1)≥0.m_a\left(\frac{b}{a}-1\right)\left(\frac{c}{a}-1\right)+ m_b\left(\frac{a}{b}-1\right)\left(\frac{c}{b}-1\right) +m_c\left(\frac{a}{c}-1\right)\left(\frac{b}{c}-1\right)\geq 0. (FYROM)

A4

Find all functions f:R+→R+f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+} such that (x+y)f(2yf(x)+f(y))=x3f(yf(x)),   ∀x,y∈R+.(x+y)f(2yf(x)+f(y))=x^{3}f(yf(x)), \ \ \ \forall x,y\in \mathbb{R}^{+}. (Albania)

A5

Let m,nm, n be positive integers and a,ba, b positive real numbers different from 11 such thath m>nm > n and am+1−1am−1=bn+1−1bn−1=c\frac{a^{m+1}-1}{a^m-1} = \frac{b^{n+1}-1}{b^n-1} = c . Prove that amcn>bncma^m c^n > b^n c^{m} (Turkey)

A6

For a polynomials P∈R[x]P\in \mathbb{R}[x] , denote f(P)=nf(P)=n if nn is the smallest positive integer for which is valid (∀x∈R)(P(P(…P⏟n(x))…)>0),(\forall x\in \mathbb{R})(\underbrace{P(P(\ldots P}_{n}(x))\ldots )>0), and f(P)=0f(P)=0 if such n doeas not exist. Exists polyomial P∈R[x]P\in \mathbb{R}[x] of degree 201420152014^{2015} such that f(P)=2015f(P)=2015 ?

(Serbia)

C2

Isaak and Jeremy play the following game. Isaak says to Jeremy that he thinks a few 2n2^n integers k1,..,k2nk_1,..,k_{2^n} . Jeremy asks questions of the form: ''Is it true that ki<kjk_i<k_j ?'' in which Isaak answers by always telling the truth. After n2n−1n2^{n-1} questions, Jeramy must decide whether numbers of Isaak are all distinct each other or not. Prove that Jeremy has bo way to be ''sure'' for his final decision.

(UK)

C3

A chessboard 1000×10001000 \times 1000 is covered by dominoes 1×101 \times 10 that can be rotated. We don't know which is the cover, but we are looking for it. For this reason, we choose a few NN cells of the chessboard, for which we know the position of the dominoes that cover them. Which is the minimum NN such that after the choice of NN and knowing the dominoed that cover them, we can be sure and for the rest of the cover?

(Bulgaria)

G1

In an acute angled triangle ABCABC , let BB′BB' and CC′CC' be the altitudes. Ray C′B′C'B' intersects the circumcircle at B′′B'' andl let αA\alpha_A be the angle ABB′′^\widehat{ABB''} . Similarly are defined the angles αB\alpha_B and αC\alpha_C . Prove that sin⁡αAsin⁡αBsin⁡αC≤3632\sin \alpha _A \sin \alpha _B \sin \alpha _C\leq \frac{3\sqrt{6}}{32} (Romania)

G2

Let ABCABC be a triangle with circumcircle ω\omega . Point DD lies on the arc BCBC of ω\omega and is different than B,CB,C and the midpoint of arc BCBC . Tangent of Γ\Gamma at DD intersects lines BCBC , CACA , ABAB at A′,B′,C′A',B',C' , respectively. Lines BB′BB' and CC′CC' intersect at EE . Line AA′AA' intersects the circle ω\omega again at FF . Prove that points D,E,FD,E,F are collinear.

(Saudi Arabia)

G3

A set of points of the plane is called obtuse-angled if every three of it's points are not collinear and every triangle with vertices inside the set has one angle >91o>91^o . Is it correct that every finite obtuse-angled set can be extended to an infinite obtuse-angled set?

(UK)

G6

Let ABAB be a diameter of a circle (ω)(\omega) with centre OO . From an arbitrary point MM on ABAB such that MA<MBMA < MB we draw the circles (ω1)(\omega_1) and (ω2)(\omega_2) with diameters AMAM and BMBM respectively. Let CDCD be an exterior common tangent of (ω1),(ω2)(\omega_1), (\omega_2) such that CC belongs to (ω1)(\omega_1) and DD belongs to (ω2)(\omega_2) . The point EE is diametrically opposite to CC with respect to (ω1)(\omega_1) and the tangent to (ω1)(\omega_1) at the point EE intersects (ω2)(\omega_2) at the points F,GF, G . If the line of the common chord of the circumcircles of the triangles CEDCED and CFGCFG intersects the circle (ω)(\omega) at the points K,LK, L and the circle (ω2)(\omega_2) at the point NN (with NN closer to LL ), then prove that KC=NLKC = NL .

G7

Let scalene triangle ABCABC have orthocentre HH and circumcircle Γ\Gamma . AHAH meets Γ\Gamma at DD distinct from AA . BHBH and CHCH meet CACA and ABAB at EE and FF respectively, and EFEF meets BCBC at PP . The tangents to Γ\Gamma at BB and CC meet at TT . Show that APAP and DTDT are concurrent on the circumcircle of AFEAFE .

N1

Let dd be an even positive integer. John writes the numbers 12,32,…,(2n−1)21^2 ,3^2 ,\ldots,(2n-1)^2 on the blackboard and then chooses three of them, let them be a1,a2,a3{a_1}, {a_2}, {a_3} , erases them and writes the number 1+∑1≤i<j≤3∣ai−aj∣1+ \sum_{1\le i<j\leq 3} |{a_i} -{a_j}| He continues until two numbers remain written on on the blackboard. Prove that the sum of squares of those two numbers is different than the numbers 12,32,…,(2n−1)21^2 ,3^2 ,\ldots,(2n-1)^2 .

(Albania)

N2

Sequence (an)n≥0(a_n)_{n\geq 0} is defined as a0=0,a1=1,a2=2,a3=6a_{0}=0, a_1=1, a_2=2, a_3=6 , and an+4=2an+3+an+2−2an+1−an,n≥0a_{n+4}=2a_{n+3}+a_{n+2}-2a_{n+1}-a_n, n\geq 0 . Prove that n2n^2 divides ana_n for infinite nn .

(Romania)

N3

Let aa be a positive integer. For all positive integer n, we define an=1+a+a2+…+an−1.a_n=1+a+a^2+\ldots+a^{n-1}. Let s,ts,t be two different positive integers with the following property: If pp is prime divisor of s−ts-t , then pp divides a−1a-1 . Prove that number as−ats−t\frac{a_{s}-a_{t}}{s-t} is an integer.

(FYROM)

N4

Find all pairs of positive integers (x,y)(x,y) with the following property: If a,ba,b are relative prime and positive divisors of x3+y3x^3 + y^3 , then a+b−1a+b - 1 is divisor of x3+y3x^3+y^3 .

(Cyprus)

N5

For a positive integer ss , denote with v2(s)v_2(s) the maximum power of 22 that divides ss . Prove that for any positive integer mm that: v2(∏n=12m(2nn))=m2m−1+1.v_2\left(\prod_{n=1}^{2^m}\binom{2n}{n}\right)=m2^{m-1}+1. (FYROM)

N7

Positive integer mm shall be called anagram of positive nn if every digit aa appears as many times in the decimal representation of mm as it appears in the decimal representation of nn also. Is it possible to find 44 different positive integers such that each of the four to be anagram of the sum of the other 33 ?

(Bulgaria)