olymmath

ISL 1997

IMO Shortlist 1997.

Other problems

Problem 2

Let R1,R2,…R_1,R_2, \ldots be the family of finite sequences of positive integers defined by the following rules: R1=(1),R_1 = (1), and if Rn−1=(x1,…,xs),R_{n - 1} = (x_1, \ldots, x_s), then

Rn=(1,2,…,x1,1,2,…,x2,…,1,2,…,xs,n).R_n = (1, 2, \ldots, x_1, 1, 2, \ldots, x_2, \ldots, 1, 2, \ldots, x_s, n).

For example, R2=(1,2),R_2 = (1, 2), R3=(1,1,2,3),R_3 = (1, 1, 2, 3), R4=(1,1,1,2,1,2,3,4).R_4 = (1, 1, 1, 2, 1, 2, 3, 4). Prove that if n>1,n > 1, then the kk th term from the left in RnR_n is equal to 1 if and only if the kk th term from the right in RnR_n is different from 1.

Problem 3

For each finite set UU of nonzero vectors in the plane we define l(U)l(U) to be the length of the vector that is the sum of all vectors in U.U. Given a finite set VV of nonzero vectors in the plane, a subset BB of VV is said to be maximal if l(B)l(B) is greater than or equal to l(A)l(A) for each nonempty subset AA of V.V.

(a) Construct sets of 4 and 5 vectors that have 8 and 10 maximal subsets respectively.

(b) Show that, for any set VV consisting of n≥1n \geq 1 vectors the number of maximal subsets is less than or equal to 2n.2n.

Problem 5

Let ABCDABCD be a regular tetrahedron and M,NM,N distinct points in the planes ABCABC and ADCADC respectively. Show that the segments MN,BN,MDMN,BN,MD are the sides of a triangle.

Problem 6

(a) Let nn be a positive integer. Prove that there exist distinct positive integers x,y,zx, y, z such that

xn−1+yn=zn+1.x^{n-1} + y^n = z^{n+1}.

(b) Let a,b,ca, b, c be positive integers such that aa and bb are relatively prime and cc is relatively prime either to aa or to b.b. Prove that there exist infinitely many triples (x,y,z)(x, y, z) of distinct positive integers x,y,zx, y, z such that

xa+yb=zc.x^a + y^b = z^c.

Problem 7

The lengths of the sides of a convex hexagon ABCDEFABCDEF satisfy AB=BCAB = BC , CD=DECD = DE , EF=FAEF = FA . Prove that: BCBE+DEDA+FAFC≥32.\frac {BC}{BE} + \frac {DE}{DA} + \frac {FA}{FC} \geq \frac {3}{2}.

Problem 11

Let P(x)P(x) be a polynomial with real coefficients such that P(x)>0P(x) > 0 for all x≥0.x \geq 0. Prove that there exists a positive integer n such that (1+x)n⋅P(x)(1 + x)^n \cdot P(x) is a polynomial with nonnegative coefficients.

Problem 12

Let pp be a prime number and ff an integer polynomial of degree dd such that f(0)=0,f(1)=1f(0) = 0,f(1) = 1 and f(n)f(n) is congruent to 00 or 11 modulo pp for every integer nn . Prove that d≥p−1d\geq p - 1 .

Problem 16

In an acute-angled triangle ABC,ABC, let AD,BEAD,BE be altitudes and AP,BQAP,BQ internal bisectors. Denote by II and OO the incenter and the circumcentre of the triangle, respectively. Prove that the points D,E,D, E, and II are collinear if and only if the points P,Q,P, Q, and OO are collinear.

Problem 19

Let a1≥⋯≥an≥an+1=0a_1\geq \cdots \geq a_n \geq a_{n + 1} = 0 be real numbers. Show that ∑k=1nak≤∑k=1nk(ak−ak+1).\sqrt {\sum_{k = 1}^n a_k} \leq \sum_{k = 1}^n \sqrt k (\sqrt {a_k} - \sqrt {a_{k + 1}}). Proposed by Romania

Problem 22

Does there exist functions f,g:R→Rf,g: \mathbb{R}\to\mathbb{R} such that f(g(x))=x2f(g(x)) = x^2 and g(f(x))=xkg(f(x)) = x^k for all real numbers xx

a) if k=3k = 3 ?

b) if k=4k = 4 ?

Problem 23

Let ABCDABCD be a convex quadrilateral. The diagonals ACAC and BDBD intersect at KK . Show that ABCDABCD is cyclic if and only if AKsin⁡A+CKsin⁡C=BKsin⁡B+DKsin⁡DAK \sin A + CK \sin C = BK \sin B + DK \sin D .

Problem 25

Let X,Y,ZX,Y,Z be the midpoints of the small arcs BC,CA,ABBC,CA,AB respectively (arcs of the circumcircle of ABCABC ). MM is an arbitrary point on BCBC , and the parallels through MM to the internal bisectors of ∠B,∠C\angle B,\angle C cut the external bisectors of ∠C,∠B\angle C,\angle B in N,PN,P respectively. Show that XM,YN,ZPXM,YN,ZP concur.

Problem 26

For every integer n≥2n \geq 2 determine the minimum value that the sum ∑i=0nai\sum^n_{i=0} a_i can take for nonnegative numbers a0,a1,…,ana_0, a_1, \ldots, a_n satisfying the condition a0=1,a_0 = 1, ai≤ai+1+ai+2a_i \leq a_{i+1} + a_{i+2} for i=0,…,n−2.i = 0, \ldots, n - 2.