olymmath

TW-TST 1997

Taiwan TST and National Olympiad 1997.

Other problems

Problem 1

Let aa be rational and b,c,db,c,d are real numbers, and let f:R→[−1.1]f: \mathbb{R}\to [-1.1] be a function satisfying f(x+a+b)−f(x+b)=c[x+2a+[x]−2[x+a]−[b]]+df(x+a+b)-f(x+b)=c[x+2a+[x]-2[x+a]-[b]]+d for all xx . Show that ff is periodic.

Problem 2

Given a line segment ABAB in the plane, find all possible points CC such that in the triangle ABCABC , the altitude from AA and the median from BB have the same length.

Problem 3

Let n>2n>2 be an integer. Suppose that a1,a2,...,ana_{1},a_{2},...,a_{n} are real numbers such that ki=ai−1+ai+1aik_{i}=\frac{a_{i-1}+a_{i+1}}{a_{i}} is a positive integer for all ii (Here a0=an,an+1=a1a_{0}=a_{n},a_{n+1}=a_{1} ). Prove that 2n≤a1+a2+...+an≤3n2n\leq a_{1}+a_{2}+...+a_{n}\leq 3n .

Problem 4

Let k=22n+1k=2^{2^{n}}+1 for some n∈Nn\in\mathbb{N} . Show that kk is prime iff k∣3k−12+1k|3^{\frac{k-1}{2}}+1 .

Problem 5

Let ABCDABCD is a tetrahedron. Show that a)If AB=CD,AC=DB,AD=BCAB=CD,AC=DB,AD=BC then triangles ABC,ABD,ACD,BCDABC,ABD,ACD,BCD are acute. b)If the triangles ABC,ABD,ACD,BCDABC,ABD,ACD,BCD have the same area , then AB=CD,AC=DB,AD=BCAB=CD,AC=DB,AD=BC .

Problem 6

Show that every number of the form 2p3q2^{p}3^{q} , where p,qp,q are nonnegative integers, divides some number of the form a2k102k+a2k−2102k−2+...+a2102+a0a_{2k}10^{2k}+a_{2k-2}10^{2k-2}+...+a_{2}10^{2}+a_{0} , where a2i∈{1,2,...,9}a_{2i}\in\{1,2,...,9\}

Problem 7

Find all positive integers kk for which there exists a function f:N→Zf: \mathbb{N}\to\mathbb{Z} satisfying f(1997)=1998f(1997)=1998 and f(ab)=f(a)+f(b)+kf(gcd⁡(a,b))∀a,bf(ab)=f(a)+f(b)+kf(\gcd{(a,b)})\forall a,b .

Problem 8

Let OO be the circumcenter and RR be the circumradius of an acute triangle ABCABC . Let AOAO meet the circumcircle of OBCOBC again at DD , BOBO meet the circumcircle of OCAOCA again at EE , and COCO meet the circumcircle of OABOAB again at FF . Show that OD.OE.OF≥8R3OD.OE.OF\geq 8R^{3} .

Problem 9

For n≥k≥3n\geq k\geq 3 , let X={1,2,...,n}X=\{1,2,...,n\} and let FkF_{k} a the family of kk -element subsets of XX , any two of which have at most k−2k-2 elements in common. Show that there exists a subset MkM_{k} of XX with at least [log⁡2n]+1[\log_{2}{n}]+1 elements containing no subset in FkF_{k} .