olymmath

TW-TST 2001

Taiwan TST and National Olympiad 2001.

Other problems

Problem 1

Let AA be a set with at least 33 integers, and let MM be the maximum element in AA and mm the minimum element in AA . it is known that there exist a polynomial PP such that: m<P(a)<Mm<P(a)<M for all aa in AA . And also p(m)<p(a)p(m)<p(a) for all aa in A−(m,M)A-(m,M) . Prove that n<6n<6 and there exist integers bb and cc such that p(x)+x2+bx+cp(x)+x^2+bx+c is cero in AA .

Problem 2

Let a1,a2,...,a15a_1,a_2,...,a_{15} be positive integers for which the number akk+1−aka_k^{k+1} - a_k is not divisible by 1717 for any k=1,...,15k = 1,...,15 . Show that there are integers b1,b2,...,b15b_1,b_2,...,b_{15} such that: (i) bm−bnb_m - b_n is not divisible by 1717 for 1≤m<n≤151 \le m < n \le 15 , and (ii) each bib_i is a product of one or more terms of (ai)(a_i) .

Problem 3

Let n≥3n\ge 3 be an integer and let A1,A2,…,AnA_{1}, A_{2},\dots, A_{n} be nn distinct subsets of S={1,2,…,n}S=\{1, 2,\dots, n\} . Show that there exists x∈Sx\in S such that the n subsets Ai−{x},i=1,2,…nA_{i}-\{x\}, i=1,2,\dots n are also disjoint.

what i have is thiswe may assume that the union of the AiA_{i} s is SS .

Problem 4

Let Γ\Gamma be the circumcircle of a fixed triangle ABCABC , and let MM and NN be the midpoints of the arcs BCBC and CACA , respectively. For any point XX on the arc ABAB , let O1O_1 and O2O_2 be the incenters of △XAC\vartriangle XAC and △XBC\vartriangle XBC , and let the circumcircle of △XO1O2\vartriangle XO_1O_2 intersect Γ\Gamma at XX and QQ . Prove that triangles QNO1QNO_1 and QMO2QMO_2 are similar, and find all possible locations of point QQ .

Problem 5

Let f(n)=∑k=0n−1xkyn−1−kf(n)=\sum_{k=0}^{n-1}x^ky^{n-1-k} with, xx , yy real numbers. If f(n)f(n) , f(n+1)f(n+1) , f(n+2)f(n+2) , f(n+3)f(n+3) , are integers for some nn , prove f(n)f(n) is integer for all nn .

Problem 6

Suppose that n−1n - 1 items A1,A2,...,An−1A_1,A_2,...,A_{n-1} have already been arranged in the increasing order, and that another item AnA_n is to be inserted to preserve the order. What is the expected number of comparisons necessary to insert AnA_n ?