olymmath

OSN 2003

Indonesian National Science Olympiad 2003.

Other problems

Problem 1

Prove that a9−aa^9 - a is divisible by 66 for all integers aa .

Problem 2

Let ABCDABCD be a quadrilateral, and P,Q,R,SP,Q,R,S are the midpoints of AB,BC,CD,DAAB, BC, CD, DA respectively. Let OO be the intersection between PRPR and QSQS . Prove that PO=ORPO = OR and QO=OSQO = OS .

Problem 3

Find all real numbers xx such that ⌊x2⌋+⌈x2⌉=2003\left\lfloor x^2 \right\rfloor + \left\lceil x^2 \right\rceil = 2003 .

Problem 4

Given a 19×1919 \times 19 matrix where each component is either 11 or −1-1 . Let bib_i be the product of all components in the ii -th row, and kik_i be the product of all components in the ii -th column, for all 1≤i≤191 \le i \le 19 . Prove that for any such matrix, b1+k1+b2+k2+⋯+b19+k19≠0b_1 + k_1 + b_2 + k_2 + \cdots + b_{19} + k_{19} \neq 0 .

Problem 5

For any real numbers a,b,ca,b,c , prove that 5a2+5b2+5c2≥4ab+4ac+4bc5a^2 + 5b^2 + 5c^2 \ge 4ab + 4ac + 4bc and determine when equality occurs.

Problem 6

The hall in a castle is a regular hexagon where its sides' length is 6 meters. The floor of the hall is to be tiled with equilateral triangular tiles where its sides' length is 50 centimeters. Each tile is divided into three congruent triangles by their altitudes up to its orthocenter (see below). Each of these small triangles are colored such that each tile has different colors and no two tiles have identical colorings. How many colors at least are required?

A tile's pattern is:

Problem 7

Let k,m,nk,m,n be positive integers such that k>n>1k > n > 1 and (k,n)=1(k,n) = 1 . If k−n∣km−nm−1k-n | k^m - n^{m-1} , prove that k≤2n−1k \le 2n - 1 .