This action might not be possible to undo. Are you sure you want to continue?
5.0
Views: 3,151Likes: 28https://www.scribd.com/doc/72368268/101ProblemsinAlgebra
09/20/2014
text
original
FROM THE TRAINING OF THE USA IMO TEAM
T ANDREESCU £t Z FEND
AMT PUBLISHING
101 PROBLEMS IN ALGEBRA
FROM THE TRAINING OF THE USA 1MO TEAM
T ANDRUSCU Ft Z FFNG
Published by
AMT PUBLISHING
Australian Mathematics Trust University of Canberra ACT 2601
AUSTRALIA
Copyright ©2001 AMT Publishing
Telephone: +61 2 6201 5137
AMTT Limited ACN 083 950 341
National Library of Australia Card Number and ISSN Australian Mathematics Trust Enrichment Series ISSN 13260170 101 Problems in Algebra ISBN 1 876420 12 X
Terra Haute USA RON DUNKLEY. Typically. at the same time.THE AUSTRALIAN MATHEMATICS TRUST ENRICHMENT S E R I E S EDITORIAL COMMITTEE Chairman Editor GRAHAM H POLLARD. Waterloo CANADA WALTER E MIENTKA. Canberra AUSTRALIA ED J BARBEAU. Canberra AUSTRALIA WARREN J ATKINS. Sofia BULGARIA JOHN WEBB. be interesting and sometimes challenging to the undergraduate and the more advanced mathematician. Lincoln USA NIKOLAY KONSTANT1NOV. . Moscow RUSSIA ANDY Liu. Toronto CANADA GEORGE BERZSENYI. Canberra AUSTRALIA PETER J TAYLOR. with a lucid expository style in their solutions. They are intended to be sufficiently detailed at an elementary level for the mathematically inclined or interested to understand but. the problems have occurred in either national or international contests at the secondary school level. It is believed that these mathematics competition problems are a positive influence on the learning and enrichment of mathematics. Cape Town SOUTH AFRICA The books in this series are selected for their motivating. interesting and stimulating sets of quality problems. Edmonton CANADA JORDAN B TABOV.
U Mottershead.THE AUSTRALIAN MATHEMATICS TRUST ENRICHMENT BooKs IN THE SERIES 1 SERIES AUSTRALIAN MATHEMATICS COMPETITION BOOK 1 19781984 JD Edwards. AR Edwards. G Pollard Et PJ Taylor 5 PROBLEM SOLVING VIA THE AMC W Atkins 6 TOURNAMENT OF TOWNS QUESTIONS AND SOLUTIONS 19801984 PJ Taylor 7 TOURNAMENT OF TOWNS QUESTIONS AND SOLUTIONS 19891993 PJ Taylor 18 ASIAN PACIFIC MATHEMATICS OLYMPIADS 19892000 H Lausch Et C Bosch Giral 9 METHODS OF PROBLEM SOLVING BOOK 1 JB Tabov Ft PJ Taylor 10 CHALLENGE! 19911995 JB Henry. J Dowsey. DJ King Et PJ O'Halloran 2 MATHEMATICAL TOOLCHEST AW Plank Et NH Williams 3 TOURNAMENT OF TOWNS QUESTIONS AND SOLUTIONS 19841989 PJ Taylor 4 AUSTRALIAN MATHEMATICS COMPETITION BOOK 2 19851991 PJ O'Halloran. A Nakos Et G Vardaro ii 1 12 USSR MATHEMATICAL OLYMPIADS 19891992 AM Slinko AUSTRALIAN MATHEMATICAL OLYMPIADS 19791995 H Lausch Et PJ Taylor 13 CHINESE MATHEMATICS COMPETITIONS AND OLYMPIADS 19811993 A Liu .
JE Munro Et PJ Taylor 17 SEEKING SOLUTIONS JC Burns 18 101 PROBLEMS IN ALGEBRA T Andreescu Et Z Feng .1995 ME Kuczma Et E Windischbacher 115 TOURNAMENT OF TOWNS QUES11ONS AND SOLUTIONS 19931997 PJ Taylor Et AM Storozhev 116 AUSTRALIAN MATHEMATICS COMPETITION BOOK 3 19921998 WJ Atkins.114 POLISH Et AUSTRIAN MATHEMATICAL OLYMPIADS 1981.
.
.PREFACE This book contains one hundred highly rated problems used in the training and testing of the USA International Mathematical Olympiad (IMO) team. Instead. The book further stimulates students' interest for future study of mathematics. It provides indepth enrichment in important areas of algebra by reorganizing and enhancing students' problemsolving tac tics and strategies. the book gradually builds students' algebraic skills and techniques. It is not a collection of one hundred very difficult. This work aims to broaden students' view of mathematics and better prepare them for possible participation in various mathematical competitions. impenetrable questions.
.
and they . full days of classes and extensive problem sets give students thorough preparation in several important areas of mathematics. In some cases. These topics include combinatorial arguments and identities. algorithmic proofs. Olympiad questions can seem impenetrable to the novice. Olympiadstyle exams consist of several challenging essay problems. generating functions. intense training of 2430 very promising students who have risen to the top of the American Mathematics Competitions. complex numbers in geometry. based on performance in the preceding exams of the sequence. the selection process leading to participation in the International Mathematical Olympiad (IMO) consists of a series of national contests called the American Mathematics Contest 10 (AMC 10). and the United States of America Mathematical Olympiad (USAMO). the American Mathematics Contest 12 (AMC 12). graph theory. working backward from the desired result is helpful. cleverly applied. theory of equations. functional equations and classical inequalities. number theory. Here is some advice for students who attempt the problems that follow. The six students representing the United States of America in the IMO are selected on the basis of their USAMO scores and further IMOtype testing that takes place during MOSP. probability. the American Invitational Mathematics Examination(AIME). Be patient. Experiment with simple cases. do read the solutions. polynomials. telescoping sums and products. Cor rect solutions often require deep analysis and careful argument. Try to make connections between problems.INTRODUCTION In the United States of America. A very important theme of this work is: all important techniques and ideas featured in the book appear more than once! Olympiad problems don't "crack" immediately. Throughout MOSP. yet most can be solved with elementary high school mathematics techniques. Participation in the AIME and the USAMO is by invitation only. Take your time! Very few contestants can solve all the given problems. Try different approaches. Even if you can solve a problem. The Mathematical Olympiad Summer Program (MOSP) is a fourweek. recursive relations. They may contain some ideas that did not occur in your solutions. combinatorial and advanced geometry.
All terms in boldface are defined in the Glossary. Don't get discouraged if you have trouble at first. Use the glossary and the reading list to further your mathematical education. but they often obscure the torturous process of investigation. Many of the problems have multiple solutions. Meaningful problem solving takes practice. When you read the solutions. . try to reconstruct the thinking that went into them. but not all are outlined here. use the books on the reading list.viii Introduction may discuss strategic and tactical approaches that can be used elsewhere. For additional practice. and see if you can solve it in a different way. "What were the key ideas?" "How can I apply these ideas further?" Go back to the original problem later. The formal solutions are also models of elegant presentation that you should emulate. inspiration and attention to detail that led to them. false starts. Ask yourself.
. Many problems are either inspired by or fixed from mathematical contests in different countries and from the following journals: HighSchool Mathematics. China Revista Matematica Timi§oara. Romania Kvant.ACKNOWLEDGEMENTS Thanks to Tiankai Liu who helped in proof reading and preparing solutions. We express our deepest appreciation to the original proposers of the problems. Russia We did our best to cite all the original sources of the problems in the solution part.
.
Petersburg American High School Mathematics Examination American Invitational Mathematics Examination American Mathematics Contest 10 American Mathematics Contest 12.ABBREVIATIONS AND NOTATIONS Abbreviations AHSME AIME AMC10 AMC12 ARML IMO USAMO MOSP Putnam St. which replaces AHSME American Regional Mathematics League International Mathematical Olympiad United States of America Mathematical Olympiad Mathematical Olympiad Summer Program The William Lowell Putnam Mathematical Competition St. Petersburg (Leningrad) Mathematical Olympiad Notations for Numerical Sets and Fields Z the set of integers the set of integers modulo n the set of positive integers the set of nonnegative integers the set of rational numbers the set of positive rational numbers the set of nonnegative rational numbers the set of ntuples of rational numbers the set of real numbers the set of positive real numbers the set of nonnegative real numbers the set of ntuples of real numbers the set of complex numbers .
.
ADVANCED PROBLEMS 13 3. INTRODUCTORY PROBLEMS xiii 1 2. SOLUTIONS TO ADVANCED PROBLEMS GLOSSARY 65 131 FURTHER READING 137 .CONTENTS PREFACE vii ix xi INTRODUCTION ACKNOWLEDGEMENTS ABBREVIATIONS AND NOTATIONS 1. SOLUTIONS TO INTRODUCTORY PROBLEMS 27 4.
.
INTRODUCTORY PROBLEMS .
.
for z = 1. b. for all values of x. and c be real and positive parameters. . x1 = 4 and xn+1 = xn_1 . x2i . f (97) = 97. 2. INTRODUCTORY PROBLEMS Problem 1 Let a. n. < 2. a Problem 3 Let x1. Determine the minimum and maximum possible values of xi+x2+ +xn.nxn for all' n E N. b.1. (ii) x1 + x2 + (iii) + xn 19.. .. Problem 4 The function f. .. Solve the equation a+bx+ b+cx+ c+ax= b ax+ cbx+ acx... Problem 2 Find the general term of the sequence defined by x0 = 3. X. and d are nonzero real numbers. except  Find the range of f. has the properties f (19) = 19. defined by f(x) = ax+b cx+d' where a. d c and f (f (x)) = x. c. be a sequence of integers such that (i) 1 < x.
One may erase any two numbers. cannot coincide with the initial set. + a16y16 + a17y17. b. Find a2.. where y = x + 1 and as are constants. Problem 7 The polynomial 1x+x2x3+..+x16_x17 may be written in the form ao + a1y + a2y2 + . if they exist. and h(x). and then write the numbers a + 2 and b . Problem 9 Find polynomials f (x).2 1. such that for all x..=c+. 2 Prove that the set of numbers on the board. g(x). 1 1 If (x) I . and c be distinct nonzero real numbers such that a+b=b+.a instead. Problem 8 Let a.I g(x) I + h(x) = ifx<1 if 1 < x < 0 3x + 2 2x+2 ifx>0.. say a and b. after any number of the preceding operations. c 1 1 1 Prove that Iabcl = 1. . Introductory Problems Problem 5 Prove that (ab)2 < a+b 8a  2 \< (ab)2 a 8b for all a>b>0. Problem 6 Several (at least two) nonzero numbers are written on a board.
Problem 12 Let a. Introductory Problems 3 Problem 10 Find all real numbers x for which 8x + 27" 12x + 18x 7 6 Problem 11 Find the least positive integer m such that for all positive integers n. and e be positive integers such that abcde = a + b + c + d + e. Problem 15 Find all real numbers x for which 10x + 1lx + 12x = 13x + 14x. b. Find all possible values of x.1. e}. d. c. c. d. Find the maximum possible value of max{a. Problem 13 Evaluate 3 4 2001 1!+2!+3! +2!+3!+4! Problem 14 1999!+2000!+2001! Let x= vfa2 +a+1'1a2 a+1. a ER. . b.
n)n for all m.n)= f(m. for all a Prove that b in the interval [0. . 1]. f Problem 20 (2001I ) +f (20012 ) + +f (20001) Prove that for n > 6 the equation 1 + 1 2 x2 +. Problem 19 Let f (x) = Evaluate 2 4x 2 for real numbers x. Find all pairs (p.f (b)I < I a .n+1)= f(m. 1] such that f (O) =f(l) = 1 and I f (a) . q) such that f (p.bI. Introductory Problems Problem 16 Let f : N x N . + 1 x1 x2 =1 has integer solutions. Problem 17 Let f be a function defined on [0. q) = 2001.4 1. If(a)f(b)I < Problem 18 Find all pairs of integers (x.N be a function such that f (1. 1) = 2. y) such that 2 x3 + y3 = (x + y)2..x .1. Problem 21 Find all pairs of integers (a. b) such that the polynomial ax17 + bxls + 1 is divisible by x2 .n) +m and f(m.nEN.. f(m+1.
Problem 26 Find all real numbers x satisfying the equation 2x+3x4x+6x9x=1. .a3. }. a3 . to be an integer for infinitely many values of n. Establish necessary and sufficient conditions on x1 and x2 for x. and that a19 = a92 = 0. n) for which mn > 0 and m3 + n3 + 99mn = 333. define DA to be the sequence {a2 .. a3. 4.. a4 . Problem 23 Let xn be a sequence of nonzero real numbers such that xi_2xn_1 xn 2xn_2 .a1. Problem 25 For any sequence of real numbers A = {a1. Problem 27 Prove that 80 16<Ev1 k=1 <17.xn_1 for n = 3. let p(n) be the product of the nonzero digits of n...a2. (If n has only one digit. then p(n) is equal to that digit. Find a1.. a2. Introductory Problems 5 Problem 22 Given a positive integer n. .1. k Problem 28 Determine the number of ordered pairs of integers (m.. . Problem 24 Solve the equation x33x= x+2.}.) Let S = p(1) + p(2) + What is the largest prime factor of S? + p(999). Suppose that all of the terms of the sequence A(AA) are 1.
cl < 2. Problem 30 Evaluate n k=O E (n .6 1. Problem 34 Prove that the polynomial (x .1.al)(x . an are distinct integers. Introductory Problems Problem 29 Let a.xnl where x is a real number in the interval (0. lb .bi < 2.a2). Prove that at least two of the inequalities la . . 1 Problem 32 What is the coefficient of x2 when (1 + x)(1 + 2x)(1 + 4x). it is irreducible..k)!(n + k)! Problem 31 Let 0 < a < 1.. Solve for positive numbers x. 1).. cannot be written as the product of two nonconstant polynomials with integer coefficients. Find the maximum value of Ix' . . and c be positive real numbers such that a + b + c < 4 and ab+bc+ca > 4. Ic .(1+2 nX) is expanded? Problem 33 Let m and n be distinct positive integers. i.an) . where al.al < 2 are true. a2. b.(x ...e.
Prove that (a+ is an irrational number. Problem 39 Let x. a21) +(a . Evaluate 1 1 1 xy+zl+yz+xl+zx+y1 . x2. x3. Introductory Problems 7 Problem 35 Find all ordered pairs of real numbers (x. y.xl) for real numbers x1.x2) = x3(x5 + x1 .1)x2 + (2x2 .x3) = x4(x1 + x2 .x4 + x5)2 (x4 .2 for real numbers x. and z be complex numbers such that x + y + z = 2.x3 + x4)2 (x3 . x2+y2+z2=3 and xyz = 4.2)x = 2x+1 .x5 + x1)2 (x5 .x1 + x2)2 = x2(x4 + x5 .a21) Problem 38 Solve the system of equations (x1 .1. x5. Problem 37 Let a be an irrational number and let n be an integer greater than 1.x2 + x3)2 (x2 . Problem 36 Solve the equation 2(2x . x4.x4) = x5(x2 + x3 . y) for which: (1+x)(1+x2)(1+x4) = l+y7 and (1 + y)(1 + y2)(1 + y4) = 1 + x7.x5) = xl(x3 + x4 .
d. determine the maximum and the minimum value of a. b. Who has a winning strategy? Problem 41 Given that the real numbers a.8 1. with 0 < r < s. Prove that ak < s for some k.1)2 . Introductory Problems Problem 40 Mr. Find all complex numbers x such that (X) 2 x 2 2 . and e satisfy simultaneously the relations a+b+c+d+e=8 and a2+b2+c2 +d2+e2=16. be a nonzero polynomial with integer coefficients such that P(r) _ P(s) = 0 for some integers r and s. Fat wins the game if and only if the resulting equation has two distinct rational solutions. Problem 44 Let P(x) = aoxn + al xn1 + . Fat is going to pick three nonzero real numbers and Mr. + a. where a is a given real number.. Problem 43 Prove that 1 3 4 2n . c..ax 2. Problem 45 Let m be a given real number. Mr. Taf is going to arrange the three numbers as the coefficients of a quadratic equation x2+ x+ =0.. Problem 42 Find the real zeros of the polynomial Pa(x) = (x2 + 1)(x .1 2n 1 2 737 for all positive integers n.
+ 1 n1 2 1xn_1 Let a and b be given real numbers.n>2.1 (Xn1 + 2 1 I . Prove that a2 + b2 > 1 and c2 + d2 > 1. . and xn+1 . Problem 48 Find all complex numbers z such that (3z + 1)(4z + 1)(6z + 1)(12z + 1) = 2.. xn_1i be the zeros different from 1 of the polynomial 1x1 + 1x2 Problem 50 +. Solve the system of equations x . Introductory Problems 9 Problem 46 The sequence given by xo = a. Prove that ab = 1. y .yx 2yz 1x2+y2 a.x x2y2 = b 1x2+y2 for real numbers x and y. Problem 47 Let a.1. . Prove that 1 1 P(x)=xn1. and d be real numbers such that (a2+b21)(c2+d21) > (ac+bd1)2.. c. b. x1 = b. is periodic. Problem 49 Let x1i x2.
.
ADVANCED PROBLEMS .
.
and z be positive real numbers.. z be positive real numbers such that x4 + y4 + z4 = 1. Determine with proof the minimum value of x3 1x8+1y8+1z8. Problem 55 Let x. y 3 z3 Problem 54 Let {an}n>1 be a sequence such that al = 2 and an 1 an+i = 2 + an for allneN.2. y. Find an explicit formula for an. y.. ADVANCED PROBLEMS Problem 51 Evaluate 0200 0) 2 + (2000) + 5 (20800) + . Prove that x + y x+ (x+y)(x+z) y+ (y+z)(y+x) + z + z (z +X) (z + y) < . Problem 53 Find all real solutions to the equation 2X + 32: + 6X = x2. + (2000) Problem 52 Let x.
.14 2. Prove that f(f(x)) = x. Advanced Problems Problem 56 Find. < 1 + 1 +. For each integer k > 1. 22". f(x + y) +N(X) + f(y)) = f(f(x + f(y)) + f(y + f(x))). + 1. Problem 58 Let F be the set of all polynomials f (x) with integers coefficients such that f (x) = 1 has at least one integer root.+ 1 <122. Prove that 1 2 =xnx. with proof. find mk. Evaluate f (2001). xn x1 x2 Problem 60 Suppose that f : R+ > 1[8+ is a decreasing function such that for all x.yER+.... Problem 57 Let f : N * N be a function such that f (n + 1) > f (n) and f (f (n)) = 3n for all n. the least integer greater than 1 for which there exists f E F such that the equation f (x) = Mk has exactly k distinct integer roots. all nonzero polynomials f (z) such that f(z2) + f(z)f(z + 1) = 0. Problem 59 Let x1 = 2 and x'+1 for n > 1.
b.x) = x. f(x. Problem 66 Find a triple of rational numbers (a. defined on the set of ordered pairs of positive integers. y E Q. Problem 63 Let a. <2. .. n. (x+y)f(x.y) = yf(x. satisfying the following properties: f(x. 1} such that...Q such that f(x + y) + f(x . such that zk < 1. Problem 62 Let2<a<1. Prove that there exist e1. Advanced Problems 15 Problem 61 Find all functions f : Q ..2. k = 1. e2. Prove that a+b+l+b+c+l+c+a+l C1 Problem 64 Find all functions f. . . for any m < n. c) such that 9 321= 3a+ 3b+ yc.y) = f(y. Prove that the equation x3(x + 1) = (x + a)(2x + a) has four distinct real solutions and find these solutions in explicit form..y) = 2f(x) + 2f(y) for all x. b. and c be positive real numbers such that abc = 1.x). Problem 65 Consider n complex numbers zk. en E {1.x+y).2. .
x=n .Z2 w2 4212 +4232 +4252 +4272 x2 2 z2 w2 _ 62 . Problem 70 The numbers 1000. Advanced Problems Problem 67 Find the minimum of logxl (X2 1 4 + logX2 X3 = 4) + .52 + 62l 32 .. Prove that c < 1. a and b. . one is allowed to erase two numbers.. Prove that the equation 1 +a1x+ has at most one nonzero real root. y E R. a. After 1999 such operations. one obtains exactly one number c on the board. are real numbers in the interval (4.. x2 y 2 z2 w2 8212 +8232 +8252 +8272 Problem 69 Find all functions f : R > R such that 1. not all zero. 2999 have been written on a board. .4 where x1i x2.2 + 62 . a2.16 2. be real numbers. f(xf(x) +f(y)) = (f(x))2 +y for all x. Problem 71 Let al.Z2 w2 2212 +2232 +2252 +2272 x2 2 . xn.. b)..... 1+a.. Problem 68 Determine x2 + y2 + z2 + w2 if x2 y2 . Each time.. 1001. 1). say. and replace them by the number 2 min(a. .Y + 62 .72 = 1. . + logy 1 1 xl .
b and c be positive real numbers such that abc = 1.. alas + a2a6.. prove that at least one of the following six numbers: alai + a2a4. an > blb2 . as.. 0 < bl < b2 n . a2.. Advanced Problems 17 Problem 72 Let {an} be the sequence of real numbers defined by al = t and an+i = 4an(1 .2. Problem 76 Let a. Prove that Problem 75 .an) forn>1.. For how many distinct values of t do we have ai998 = 0? Problem 73 (a) Do there exist functions f : JR > JR and g : JR + R such that f(g(x)) = x2 for all x E R? and g(f(x)) = x3 (b) Do there exist functions f : JR > JR and g : JR + JR such that f(g(x)) = x2 for allxEJR? and g(f(x)) = x4 Problem 74 Let 0 < al < a2 < an. < bn be real numbers such that n E ai > E bi. ala2 . a3a7 + a4a8. . i=1 i=1 Suppose that there exists 1 < k < n such that bi < ai for 1 < i < k and b2 a2 for i > k. Given eight nonzero real numbers al. a5a7 + a6a8 is nonnegative. Prove that ab be ca as+b5+ab+b5+c5+bc+c5+a5+ca l . ala7 + a2a8. a3a5 + a4a6. b.
who has a winning strategy? Problem 80 Find all positive integers k for which the following statement is true: if F(x) is a polynomial with integer coefficients satisfying the condition 0<F(c) <k for c=0. Taf wins. y).1. Prove that F2n = F2n3 +2 + Fen2 9 3 2F2.... If Mr. .y) + 4f(x)y holds for all pairs of real numbers (x. Fat wins. Problem 81 The Fibonacci sequence Fn is given by F1=F2=1. Mr.. They fill in real numbers to empty spaces in turn...Fn+2=Fn+1+Fn (nEN). Y Problem 79 Mr.. If the resulting polynomial has no real root. Fat goes first. Taf play a game with a polynomial of degree at least 4: x2n + _x2n1 + _x2n2 +.k+1. = F(k + 1). Mr. Advanced Problems Problem 77 Find all functions f : R > R such that the equality f(f(x) + y) = f(x2 . Problem 78 Solve the system of equations: 3x y x+ x2 +.y2 =3 x+3y x2+y2 =0. then F(O) = F(1) = .18 2. otherwise. Fat and Mr.. for alln>2. + _x + 1.
define the difference of P(x) on the interval [a...P(a). Advanced Problems 19 Problem 82 Find all functions u : lib > R for which there exists a strictly monotonic function f :ill. b).. .. .. Prove that 2 < xnyn < 3 for all n > 1.. (a. y E R.2. .. . b]) as P(b) . Prove that there exists a subset S of {z1. b). Find all integer roots of P(P(x)) given that 0 is a root of P(x).. . 1] into a finite number of intervals and color them red and blue alternately such that. Problem 86 For a polynomial P(x).. Z2.. for every quadratic polynomial P(x). > l such that f(x + y) = f(x)u(y) + f(y) for all x. zn be complex numbers such that Iz1I+Iz21+. are defined in the following way: X1 = Ill = V3. Y2. Problem 85 Two real sequences x1i x2. Yn+1 = 1 + y2 for all n > 1. zn} such that I: z zES 6 Problem 84 A polynomial P(x) of degree n > 5 with integer coefficients and n distinct integer roots is given. . Prove that it is possible to dissect the interval [0. b] (a.+znl =1. . Problem 83 Let z1i Z2.. and y1. What about cubic polynomials? ([a. and xn+1 = xn + yn 1 } 1+X .. the total difference of P(x) on red intervals is equal to that of P(x) on blue intervals.
]I82 > R be a function such that for Prove that f is the zero function. An. Who has a winning strategy? Problem 88 Let n > 2 be an integer and let f : any regular ngon A1A2 .n. (ii) for every positive integer n.20 2.. Advanced Problems Problem 87 Given a cubic equation x3 + _x2 + _x +  = 0.+f(An) =0.. Fat and Mr. Taf are playing the following game.1.. . Fat chooses a real number and Mr. Fat wins the game if the final equation has three distinct integer roots. After three moves the game is over. Prove that d > p .<1.2. Mr. a1. n . Consider the sequence ao. f (1) = 1. 11<an. the remainder upon division of f (n) by p is either 0 or 1. Mr.. Mr. an. Problem 89 Let p be a prime number and let f (x) be a polynomial of degree d with integer coefficients such that: (i) f (0) = 0. f(A1)+f(A2)+. Problem 90 Let n be a given positive integer. Taf puts it in one of the empty spaces. In one move. Prove that . with ao = 2 and 2 ak = ak1 + ak_1 n fork=1.
anlx . y) > 0 for all real numbers x and y.1)! (x + n) _ 1 x' (n1)! n(x + 1).an = 0 has precisely one B=yn (b) Let A= 1aj and Prove that AA < RB. and find the smallest such k as a function of n.. . which cannot be written as the sum of squares of polynomials with real coefficients. (a) Prove that °O E (b) Prove that 00 (n . . Problem 93 For each positive integer n... a2. show that there exists a positive integer k such that k = f(x)(x + 1)2n + g(x)(x2n + 1) for some polynomials f. (a) Prove that xn . g with integer coefficients. Problem 92 Prove that there exists a polynomial P(x.. not all zero. an be nonnegative real numbers.. y) with real coefficients such that P(x.2. 3a.(x + n) 00 1 n=1 ti=1(x + k)2* .alxn1 positive real root R. Problem 94 Let x be a positive real number.. Advanced Problems 21 Problem 91 Let a1.
. z0) in nonzero integers. Problem 96 Let n > 3 be an integer and let x1.. . Prove that one can find nine distinct numbers a. 2. (i = 1..+ x2 .xn Let y'. xn be positive real numbers. Show that inIxi .xn) 1 xn Problem 97 Let x1.n3} be a set of 3n2 elements... xn be distinct real numbers. X2. .. Suppose that ) Prove that 1 = 1. x1+ x2+. x2.. .. yo.x... Define the polynomials P(x) = (x . .x1)(x x2).. yn_1 be the roots of Q. bz. c... n . + L) 1 xx1 + xx2 x .(x and Q(x) = P(x) (I + .2...22 2.. and let X C S= {1.. y2.+ xn>(n1) 1 xl + 1 +.. 3) in X such that the system aix + bly + c1z a2x + b2y + c2z = 0 = 0 a3x+b3y+c3z = 0 has a solution (x0.j < inlyiy31. Advanced Problems Problem 95 Let n > 3 be an integer.
a2) .. Y2"_1 be the sums of nonempty subsets of xi. c3 E JR.. Problem 100 Let X1. xn be variables. x1 + x2 and p1 = Yi + y2 + y3 = 2x1 + 2x2i P2 = Y1Y2 + Y2Y3 + y3y1 = xl + X2 + 3x1x2i P3 = y1112y3 = xlx2 + xlx2 Problem 101 Prove that there exist 10 distinct real numbers al.... Advanced Problems 23 Problem 98 Show that for any positive integer n. x2.al)(x . . . x)2' +1 cannot be written as the product of two nonconstant polynomials with Problem 99 Let fl. x2. Prove that there exist c1. Let pk(xl.. the polynomial AX) = (x2 + integer coefficients.. .. and let yi. . if n = 2. a2i .. For which k and n is every coefficient of pk (as a polynomial in xl. y2i y3 are x1. xn) even? For example. (x . . c2...(x + alo) has exactly 5 different real roots. y2. .. alo such that the equation (x . such that CI fl (x) + C2f2(x) + C3f3(x) = 0 for allxEJR. a2. x7) be the kth elementary symmetric polynomial in the yi (the sum of every product of k distinct yis). a3 E R.2... .. then yl. . not all zero.alo) = (x + al)(x + a2).. f2i f3 : JR > JR be functions such that a1f1 + a2f2 +a3f3 is monotonic for all al.
.
SOLUTIONS TO INTRODUCTORY PROBLEMS .
.
kxk = (k + 2)2 .nxn for allnEN. .3. and c be real and positive parameters. Since the right hand side is a decreasing function of x and the left hand side is an increasing function of x. b. Fork>1.k(k + 3) = k + 4. then Xk+1 = x2_1 .1. Solution 2 We shall prove by induction that xn = n + 3. x1 = 4 and 2 xn+1 = xn_1 . there is at most one solution. Solve the equation a+bx+ vl'b c+ax=ax+ cbx+ acx. SOLUTIONS TO INTRODUCTORY PROBLEMS Problem 1 [Romania 1974] Let a. This completes the induction. Solution 1 It is easy to see that x = 0 is a solution. as desired.ifxk_1=k+2 =k+2andXk =k+3. Problem 2 Find the general term of the sequence defined by xo = 3. The claim is evident for n=0. Thus x = 0 is the only solution to the equation.
f (97) = 97.. . the lower bound (19) is achieved... n. Solution 3 Let a. for i = 1.+xn. b.. the upper bound (133) is achieved. b = 59). (ax+b ) +b cx+d ax+b c (cx+d) +d a x' . b = 2). c. C f (f (x)) = x. Determine the minimum and maximum possible values of xi+x2+. It follows that a = 40 . Solution 4. Solutions to Introductory Problems Problem 3 [AHSME 1999] Let x1i X2. x.. We need not consider the zeros.3c. Alternative 1 For all x. Then a. so xl +x2 + +xn = a+b+8c = 19+6c. f (f (x)) = x. c are nonnegative integers satisfying a+b+2c= 19 and a+b+4c= 99. respectively. 2. and d are nonzero real numbers. i. where 0 < c < 19 (since b > 0).d Find the range of f. for all values of x. .. has the properties f (19) = 19. and 2s in the sequence. When c = 0 (a = 40. be a sequence of integers such that (i) 1 < xti < 2. defined by f(x) = ax+b cx+d' and where a.28 3. Problem 4 [AIME 1997] The function f... b. Is. (ii) xl + x2 + + x2 = 99. When c = 19 (a = 21.c and b = 59 .e. except . and c denote the number of Is.. b.
19a+b Hence and 972c=2. Solution 4. b. we must have a = d. Thus the range of f is R .97a+b. i(x) _ dxb cx + a The nonzero numbers a. Therefore Ax) = 58x . This yields f same as in the first solution. and the rest is the Problem 5 Prove that (ab)2 8a  a+b 2 a < (ab)2 8b for all a>b>0.a2)x .192)c = 2(97 . Alternative 2 The statement implies that f is its own inverse. Solution 5.b(a + d) = 0. c.19)a. it follows that a = d. It follows that a = 58c. . c. which in turn leads to b = 1843c. respectively.{58}. The conditions f (19) = 19 and f (97) = 97 lead to the equations 192c=2. which implies that c(a + d) = 0. b. Since c 0. Solutions to Introductory Problems 29 (a2 + bc)x + b(a + d) x.1843 = 58 + 1521 x58 x58' which never has the value 58. c(a + d)x + be + d2  c(a + d)x2 + (d2 . and d must therefore be proportional to d. The inverse may be found by solving the equation ay + b cy + d for y. Alternative 1 Note that C 2f + / `<1< 2Vb +V1` J . (972 . and a.3.
Solution 6 Let S be the sum of the squares of the numbers on the board. cannot coincide with the initial set. This completes the proof. say a and b.30 3. One may erase any two numbers. Solutions to Introductory Problems (V 1b+Vb)2(VwVb)2 4a <(VuVO)2< (/+/)2(/ Vrb)2 4b (ab)2 8a <  a2 ab+b 2 <  (ab)2 8b from which the result follows. Prove that the set of numbers on the board. and then write the numbers a + 2 and b . Note that S increases in the first operation and does not decrease in any successive operation. Alternative 2 Note that (a+b\2 a+b 2 ab = 2 ab a+b + 2 _ ab (ab)2 2(a+b)+4 ab Thus the desired inequality is equivalent to 4a>a+b+2 ab>4b. Problem 6 [St. Solution 5. as Ca+2 \2 J +(b2)2=4(a2+b2)>a2+b2 with equality only if a = b = 0.2 instead. Petersburg 1989] Several (at least two) nonzero numbers are written on a board. which is evident as a > b > 0 (which implies a > ab > b). . after any number of the preceding operations.
1) = 1 .(y . Solution 7.+(1y)17..x18 and (1 + x)f(x) = 1 .x18.1) 17 Thus a2 = (2 ) 2 + (1)..(y . Alternative 2 Let f (x) denote the given expression.1)18 1+(y1) y Therefore a2 is equal to the coefficient of y3 in the expansion of 1(y1)1s a2 = (18) = 816.3. Here we used the formula (n) and the fact that k+ (k+ 1) .. Solution 7...+. Find a2. Alternative 1 Let f (x) denote the given expression. Then f(x) = f(y .1) = 1 (y .. where y = x + 1 and as are constants.1)2 =1+(1y)+(1y)2+. Then xf(x)=xx2+x3.1)18  1 .. + (17) = (18).(k + 1 (22) _ (33) = 1. Hence f(x) = f(y . . (y . Solutions to Introductory Problems 31 Problem 7 [AIME 1986] The polynomial 1x+x2x3++x16x17 may be written in the form ao + aly + a2y2 + . + a16y16 + a17y17.1) + (y ..
3x + 2 Solution 9. Hence f (x) = (3x + 3)/2. and c be distinct nonzero real numbers such that a+=b+=c+. and h(x). Prove that IabcI = 1. if F(x) is the given function. andca= aabb . one can suppose that F(x) = alx + 1 l+ blxl+ cx + d (cab)x+da ifx<1 (a+cb)x+a+d if1<x<0 (a+b+c)x+a+d ifx > 0.x+ 21 .15x/21 . c = 1. if they exist. such that for all x. 0} + 3x + 2 = (3x . Solution 8 From the given conditions it follows that a b= b bc c . b c = ccaa.3. g(x). Alternative 2 Note that if r(x) and s(x) are any two functions. s) = r+s+Ir .Ig(x) I + h(x) = ifx<1 if 1 < x < 0 2x + 2 ifx > 0. Alternative 1 Since x = 1 and x = 0 are the two critical values of the absolute functions. we have F(x) = max{3x . and d = 1/2. and h(x) = x + z . which implies that a = 3/2. then max(r.(5x+I5xl)/2+3x+2 = 1(3x+3)/21 . Solutions to Introductory Problems Problem 8 Let a. 1 If (X) I .32 3. b = 5/2. .sl 2 Therefore. from which the desired result follows. Solution 9. g(x) = 5x/2. b. Problem 9 [Putnam 1999] Find polynomials f (x). Multiplying the above equations gives (abc)2 = 1.3 + 13x + 31)/2 . 0} max{5x.
It is easy to check that both x = 1 and x = 1 satisfy the given equation. the equation becomes a3 + b3 a2b + b2a a2 .13ab + 6b2 = 0. Solution 11 Note that (0)+(1)+.3b)(3a .3.2b) = 0.. 10) (5 Thus m = 4. Solutions to Introductory Problems 33 Problem 10 Find all real numbers x for which 8x + 27x 12x + 18x 7 6 Solution 10 By setting 2x = a and 3x = b. which implies that x = 1 and x = 1. Therefore 2x+1 = 3x+1 or 2x1 = 3x1.ab + b2 ab 7 6 _ 7 6' 6a2 .+\2n1 C2 n) < 2 =(1+1)2n=4n and for n = 5. = 252 > 35 . Problem 11 [Romania 1990] Find the least positive integer m such that C2nln n <m for all positive integers n.. (2a .
If d = 1. Solutions to Introductory Problems Problem 12 Let a. (1. 5). 1.e. 1n =X1 +X2 + . 1. xn are positive integers such that 1112. We need to find the maximum value of e. 2)..1) < 4. 3).. d. 1. 1. . 1. Problem 13 Evaluate 3 4 2001 1! + 2! + 3! + 2! 3!+ 4! + + 1999! + 2000! + 200 1! . Solution 12. 2. c. 1. c. . de < 3 + d + e or (d. 2. d) = (1.. 1. It is easy to see that (1. d. b. Hence (a.1)(e. which leads to max{e} = 5.34 3. Alternative 1 Suppose that a < b < c < d < e. b. suppose that a < b < c < d < e. c. and e be positive integers such that abcde=a+b+c+d+e. Alternative 2 As before. or (1. 2).. Therefore max{e} = 5. . then e < abcde < 5e. which is impossible. then a = b = c = 1 and 4 + e = e. 1. Comment: The second solution can be used to determine the maximum value of {x1i X2.. 5) is a solution. Note that 1_ 1+ 1+ 1+ 1+ 1 bcde cdea deab eabc abcd < de + de + dc I I 1 ++d=3+d+ e I Therefore. Find the maximum possible value of max{a..n}. e}. 1. x... x2. Thus d1>lande1<4ore<5. (1. i. Since e<a+b+c+d+e<5e. 1. when xi. Solution 12. b. 1. (1.+ 1n. 4).. 1 < abcd < 5.
Solutions to Introductory Problems 35 Solution 13 Note that k+2 k! + (k + 1)! + (k + 2)! _ k+2 k![1+k+1+(k+1)(k+2)] 1 k!(k + 2) k+1 (k + 2)! (k + 2) . .a2a+ 1. Squaring both sides of x+ yields vla2 a2+a+1 2x a2a+1=2ax2. Find all possible values of x.1 (k + 2)! (k + 1)! (k + 2)! By telescoping sum.3. Solution 14. a E R. the desired value is equal to 1 1 2 2001! Problem 14 Let x = a2+a+1. Alternative 1 Since a2+Ial+1> Ial and x= we have 2a a2 + a + 1 + a2a+1' jxj < 12a/al = 2.
Since IxI < 2. P is well defined. //2). Solutions to Introductory Problems Squaring both sides of the above equation gives 4(x2 .PBj < IABI = 1. And it is clear that all the values 1 < d < 1 are indeed obtainable. By the Triangle Inequality. We claim that it is the only one. 1 < x < 1. 1) there exists a real number a such that x = a2+a+1. Then P is a point on the xaxis and we are looking for all possible values of d = PA . for such a d.4) or a 2 = x2(22 . Solution 14. SPA . Problem 15 Find all real numbers x for which lOx + 11x + 12x = 13x + W. . i. B = (1/2. (Points A and B are foci of the hyperbola.1) > 0. for every x E (1. Alternative 2 Let A = (1/2.QB = d is well defined.axis. dividing by 132 on both sides gives (10 ) x + (11)x+ ( 13)2 = 1+ (13)2. this half hyperbola intersects the x.e. //2).1)a 2 = x 2 (x 2 . 0). / The left hand side is a decreasing function of x and the right hand side is an increasing function of x.a2a+1. In fact.4) 4(x2 .) Since line AB is parallel to the xaxis..1) Since a2 > 0. we must have 22(x2 4) (X2 . Conversely.36 3. Therefore. and P = (a. In fact. a half hyperbola of all points Q such that QA . Solution 15 It is easy to check that x = 2 is a solution.PB. x2 4 < 0 which forces x2 1 < 0. Therefore their graphs can have at most one point of intersection.
1 for p.1)  + p(p .n) n for all m. n E N. q E N.1. Problem 16 [Korean Mathematics Competition 2001] Let f : N x N .n)= f(m. k E N. 1) = 2. Solutions to Introductory Problems 37 Comment: More generally. Note that 1999 is a prime number and that p .1) = 2. Find all pairs (p. Solution 16 We have f(p.3. .1) 2  q(q .1 = f(p2.q1)(q1)+p(p1) 2 q(q .n)+m and f(m.q < p + q .q = 1 and p + q .1) 2 = 1999.1) 2 f(1.q) + p .1 = 1999.1) 2 2001.q)+(p2)+(p. p .1) f(l. +(a+2k)2 for a = k(2k + 1). (pq)(p+q. q) = 2001. Hence p = 2000 and q = 1999.1999.q) = f(p .q = 2 and p + q .1) 2 f(1. p .q) + p(p.n+ 1) =f(m. We have the following two cases: 1. a2+(a+ 1)2 + . q) such that f (p. Hence p = 1001 and q= 999. .1 = 3998. f(m+1. Therefore p(p . 2. + (a + k)2 = (a + k + 1)2 + (a + k + 2)2 + .N be a function such that f (1.
f (b) I < I a .e.38 3. 1] such that f(0)=f(1)=1andlf(a)f(b)I <IabI.bI > 1/2. n). Ia . as desired. Problem 18 Find all pairs of integers (x. Solution 18 Since x3+y3 = (x+y)(x2xy+y2). 1. Then I f (a) . y) such that x3 + y3 = (x + y)2. all pairs of integers (n. x2(y+1)x+y2y=0. Suppose that x + y 54 0. .7G.bI . By symmetry. Then the equation becomes x2xy+y2=x+y. Then If(a)f(b)I = If(a)f(1)+f(0)f(b)I If(a)f(1)I +If(0)f(b)I < 1a+b0 1(ab) 1 Ia1I+I0bI < 2. 999). Problem 17 [China 1983] Let f be a function defined on [0. are solutions. Prove that If(a) .f(b)I < 2 Solution 17 We consider the following cases. i. 1]. as desired. n c. 1999) or (1001. for all a 54 bin the interval [0.bI < 1/2. Solutions to Introductory Problems Therefore (p. 2. q) = (200Q. Ia . we may assume that a > b.
Therefore. the integer solutions of the equation are (x. f(1x)= 41x+2 2 _ 24x _ 4x 4+2. n). y) = (1. (1. which lead to the solutions (1. Solutions to Introductory Problems 39 Treated as a quadratic equation in x. 1). Solution 20 Note that 1 1 1 1 1 a2 (2a)2 + (2a)2 + (2a)2 + (2a)2' . (2. (2. 2). Thus the desired sum is equal to 1000. (0.4x 4x+2' from which it follows that f (x) + f (1 . (2. 2).y. and (2. Problem 19 [Korean Mathematics Competition 2001] Let 2 f(x) = 4x + 2 for real numbers x.1). and (n. 1/2).3. Evaluate f ( 2001) + f ( 2001) + + f ( 20001) Solution 19 Note that f has a halfturn symmetry about point (1/2.x) = 1. 2). 0). (0. 1). (1. 1. Solving for 0 > 0 yields 32y .3+2y 3 3 Thus the possible values for y are 0. we calculate the discriminant 0=y2+2y+14y2+4y=3y2+6y+1.1). Problem 20 Prove that for n > 6 the equation 2+2+ 1 1 .+2=1 1 x1 x2 xn has integer solutions. Indeed. 0). and 2. 2). for all n E Z.
3..1 = 0. xn+l.2an. 12. .q = (p8 + g8)(p4 + g4)(p2 + q2)(p + q) . and (2. This completes the proof. Thus ap17 + bp16 = 1 and aq 17 + bg16 = 1. Note that p and q must also be the roots of ax17 + bx16 + 1 = 0. Solutions to Introductory Problems from which it follows that if (x. Solution 21.1. p + q = 1 and pq = 1. Since x1 = 1 is a solution for n = 1. Multiplying the first of these equations by q16. 3. xn.x ..2an. 2) is a solution for n = 4. (2. a2. Xn+2. 2. 6) and (2. 4) is a solution for n = 7. Therefore we can construct the solutions inductively if there are solutions for n = 6. xn1. . By Vieta's theorem..2an. 4. 1 ) is an inte 2 1 then + 1 x2 2 +.. xn+3) = (a1 a2 . xn) _ (a.40 3. and 8. 4. 2.x ..) is an integer solution to 2 2 + x2 + xl 1 1 + xn+3 2 = 1. 3. Problem 21 [AIME 1988] Find all pairs of integers (a. x2. 2. 7. ger solution to 1 . b) such that the polynomial ax17+bx16+1 is divisible by x2 . 4.i x2. 12) are solu tions for n = 6 and n = 8. the second one by p16 and using the fact that pq = 1. 4. an1. 4. 2. 2.2an. Alternative 1 Let p and q be the roots of x2 .. we find ap + b = q16 and aq + b = Thus a = p's (1) p 1s 16 pq . respectively. 2. It is easy to check that (2.. 2. 2.+ 22 n (x1.
. and for 3 < k < 15. Then k2 = 3 and k4 = 7. (p+q)22pq=1+2=3.c1=1 co . let k2n = p2n +q2n. + (p16 + q16) p7g7(p2 + q2) + p8g8 _ (p14 + q14) + . b) = (987.2p2g2 =92=7.k2n for n > 3.+c1xco)(x2x1)=ax17+bx16+1.843+322 . Solution 21..q17 b = pq p16 + p15q + p14g2 + . Hence b = 2207.2 = 47.. 1597). .(p2 + q2) + 1.47 = 987. 7 .18+7. Likewise. . Then k6 = 18. For n > 1.. = = it follows that a = 1 . coc. k14 = 843. xk: Ck2Ck1+Ck=O. k8 = 47.3. eliminating a in (1) gives p17 .p2g2(p2n + q2n) = 3k2n+2 . k16 = 2207.3+ 1 = 1597 or (a..123+47. Alternative 2 The other factor is of degree 15 and we write (c15x15C14X14+.2p4g4 = 49 . (p4 + q4)2 . c2 = 2. klo = 123. (p2 + q2)2 . Solutions to Introductory Problems Since 41 p+q = p2+q2 = p4 + q4 p8 + q8 1.. Comparing coefficients: x0 x1: x2 : co=1. k12 = 322...c1 + c2 = 0. + q'6 (p16 + q'6) + pq(p14 + q14) + p2g2(p12 + q12) + .3. and k2n+4 = p2n+4 + q2n+4 = (p2n+2 + q2n+2)(p2 + q2) .=0.
b) = (987. Comment: Combining the two methods. + p(999)...0.F2n+4 = F2n+3 ... Solutions to Introductory Problems It follows that for k < 15.+9)30.42 3.0.. let p(n) be the product of the nonzero digits of n.._1 and k2n satisfy the same recursive relation. we obtain some interesting facts about sequences k2. then p(n) is equal to that digit.. . Thus a = cl5 = F16 = 987 and b = c14 ... ck = Fk+1 (the Fibonacci number). Since 3F2n+3 . and F2..5. =(0+1+. p(n) is the product of nonzero digits of n. (Note that the final 0 in the above expression becomes a 1 and compensates for the contribution of 000 after it is changed to 111.. It is easy to check that k2 = F1 + F3 and k4 = F3 + F5.+1. since ignoring 0's is equivalent to thinking of them as 1's in the products.F2n+5 = 2F2n+3 ._1. The sum of the products of the digits of all such positive numbers is (0.7.. and the largest prime factor is 103.F2n+2 = F2. Therefore ken = F2n_1 + F2n+i and F2n+1 = ken .) Hence S=4631=(461)(462+46+1)=33. The sum of these products can be found by replacing 0 by 1 in the above expression.) Let S = p(1) + p(2) + . However.c15 = F17 = 1597 or (a. Problem 22 [AIME 1994] Given a positive integer n.ken2 + k2n_4 .1k2 + (1)n. 1597). + (_1)n. it follows that F2.. (If n has only one digit.0+0. What is the largest prime factor of S? Solution 22 Consider each positive integer less than 1000 to be a threedigit number by prefixing Os to numbers with fewer than three digits.103.
e.. Solution 23.1n1 for n = 3.Yn1 = 0 for all n.6 cos a = or 2(cos a + 1).2)x2 for n = 3. If xn is a nonzero integer when n is in an infinite set S.3. Clearly.(n . Alternative 2 An easy induction shows that 11x2 11x2 (x1 . Solutions to Introductory Problems 43 Problem 23 [Putnam 1979] Let xn be a sequence of nonzero real numbers such that xn = 1n2xn1 2xn2 . i. We consider the following cases... Problem 24 Solve the equation x33x= x+2.. . In this form we see that xn will be an integer for infinitely many values of n if and only if xl = x2 = m for some nonzero integer m. Establish necessary and sufficient conditions on x1 and x2 for xn to be an integer for infinitely many values of n. 2 cos 3a = V 4 cost a 2.. Yn .4. Alternative 1 It is clear that x > 2.x1)' 1n (n . Solution 24. Then Yn .. Alternative 1 We have 1 21n2 . 1.1)x1 . 0 < a < 7r.xn_1 1n2xn1 2 1 xn 1n1 Xn2 Let yn = 1/xn. a nonzero integer. which in turn implies that x1 = x2 = m. yn is an arithmetic sequence.. this condition is also sufficient. the equation becomes 8 cos3 a .Yn2. Solution 23.. Setting x = 2 cos a. the yn's for n E S satisfy 1 < yn < 1.Yn1 = Yn1 . 2 < x < 2.x2)n + (2x2 .. Since an arithmetic sequence is unbounded unless the common difference is 0.4.
nEZ. x > 2. 2. x = 2. .or 3a+2=2n7r. . The equation becomes 1 (t2+)3 3It2+ 2)= 1t2+ 2+2. which has no solutions for t > 1. Therefore. 1 1 is+ t6 =t+ t. Solutions to Introductory Problems from which it follows that cos 3a = cos 22' Then 3a2=2m7r. Hence there are no solutions for x > 2. the solution in this case is x=2cosO=2. x = 2 cos 47r/5. x=2cos45 and x=2cos47 . Hence there are no solutions in this case. Alternative 2 For x > 2. and x = 2 cos 47r/7. please see the first solution. Then x34x=x(x24)>0and x2x2=(x2)(x+1)>0 or It follows that x33x>x> x+2. there is a real number t > 1 such that x = t 2 +t2. For 2 < x < 2. (t71)(t51)=0.mEZ. Solution 24.44 3. Since 0 < a < 7r.
} with the nth term given by d + (n .. Solution 25 Suppose that the first term of the sequence AA is d. a. Then AA={d.d+2. a4 .b)2 + (b . and that ai9 = a92 = 0. define AA to be the sequence {a2 . al +d+ (d+ 1) + (d+2)..a . Problem 26 [Korean Mathematics Competition 2000] Find all real numbers x satisfying the equation 2x+3x4X+6X9X=1. a3 . so al = (1 .1)2 = 0. . the equation becomes 1 + a 2 + b 2 . For any sequence of real numbers A = {al.. a2. al +d+ (d+ 1)...d+l.3.a) 2 + (a .a2.2).92)/2 = 819. Suppose that all of the terms of the sequence A(AA) are 1. Find al. This shows that an is a quadratic polynomial in n with leading coefficient 1/2.}.al. Solution 26 Setting 2x = a and 3x = b. a3.1).19)(n . Since alg = a92 = 0. +d..1)(n .. Multiplying both sides of the last equation by 2 and completing the squares gives (1 .b ..19)(1 . Solutions to Introductory Problems 45 Problem 25 [AIME 1992] }.a3.} with the nth term given by an = al + (n . Hence A = {al.92). we must have an = 2 (n ..1)d + 2 (n .ab = 0.
33)(m2 + n2 . We have m3 + n3 + 99mn . 1 k= vk Solution 27 Note that 2( k+1mi) Therefore 80 1 = k+1+f < '7k k=1 '" 1:( k=1 80 which proves the lower bound.k1 \ 80 2 1 k1vfk> Therefore 80 1 1: k=1 k <1+2E( k=2 . 2 . If m + n = 33.333. then 333 = (m + n)3 = m3 + n3 + 377in(m + n) = m3 + n3 + 99mn. and x = 0 is the only solution.n)2 + (m + 33)2 + (n + 33)2]. Problem 28 [AHSME 1999] Determine the number of ordered pairs of integers (m. 2 (vrk . which proves the upper bound. On the other hand. n) for which mn > 0 and m 3 + n 3 + 99772n = 333 Solution 28 Note that (m + n)3 = m3 + n3 + 3mn(m + n). Our proof is complete.333 _ (m + n .mn + 33m + 33n + 332) = (m + n .46 3.k12 801<17. Solutions to Introductory Problems Therefore 1 = 2' = 3'. Problem 27 [China 1992] Prove that 80 16 < ) '<17.33)[(m . Hence m + n .33 is a factor of m3 + n3 + 99mn .
are true. we have a3 + b3 + C3 . Ic . and the desired result follows. 32).al < 2 Solution 29 We have a+b+c)2 < 16. 0). Solutions to Introductory Problems 47 Hence there are 35 solutions altogether: (0. lb . and (33.3. i.a)2]. (1. i. (33.e.c)2 + (c . i. .a)2 < 8.bi <2. a2 + b2 + c2 < 8.b)2 + (b .3abc = 2(a + b + c) [(a . 33). 33). i. Comment: More generally.c)2 + (c .(ab + be + ca) < 4.b)2 + (b . b. and c be positive real numbers such that a + b + c < 4 and ab+bc+ca>4.cl < 2. a2 + b2 + c2 . (a .e.e. Problem 29 [Korean Mathematics Competition 2001] Let a. Prove that at least two of the inequalities la . Problem 30 Evaluate E 1 .e. a2 + b2 + c2 + 2(ab + be + ca) < 16.
x=x°. Problem 32 What is the coefficient of x2 when (1 + x)(1 + 2x)(1 + 2nx) is expanded? . Solutions to Introductory Problems Solution 30 Let Sn denote the desired sum. Problem 31 [Romania 1983] Let 0 < a < 1. It follows that f(x)g(x) = h(x) has unique solution x = a. Consider functions from W ' R. Then both f and g are decreasing and h is increasing. h(x)=x'. Then Sn = 1 (2n)! a (n . Solve for positive numbers x.48 3.k)! (n + k)! 1 2n 1 k=o n k=O 1 (2n)! 1 ( n ..kJ k (2k n) 2n 1 F 2n (2n\ + 2n (2n)! 2 r2zn L \2nJ n 22n1 1 (2n)! + 2(n!)2. 9(x) = logo x. f(x)=a'. Solution 31 Taking logo yields a' log.
nxn = (1 + x)(1 + 2x) .xnI = xn .y)mn) Applying the AMGM inequality yields Ixm .2) 3 Problem 33 Let m and n be distinct positive integers.2 + (24 +2 6 ++2 2n ) .2 + 22n2 2 n1 +2 2n 2 n a1.2 n+1 +2 3 (2n+1 .xm = xn(l .2 + 22n 2 n ) x2 + we have an..2 + 22n 2 n = an2.3.1) (2n+1 . we can assume that m > n. Solutions to Introductory Problems 49 Solution 32 Let + an. where x is a real number in the interval (0.1= 1+2+ Since fn(x) (1+2 nX).2 = an1. 1). Find the maximum value of I xm .o = 1 and a . Thus . Solution 33 By symmetry.(22 + 23 + . = fn1(x)(1 + 2'Lx) = (1+(2 n . +2=2 ' 1.o + an.n nn (m n)mn .2x2 + ) (1+2 nX) = 1+(2 n+1 .xmn) = (yn(1 .1)x + an_1. SinceO<x<1. Let y = xmn. fn(x) = an.1) x + (an_1. yn(ly)'nn = (mn n n)n ((m nn)y)n(1y)mn n+mn n /n mnny+(mn)(1y) ) 1 (mn) n+m.xm<xnand0<y<1..1x + It is easy to see that an. + 2n) 24(22n2 _ 1) _ 1) 2+ 4(2n1 3 22n+2 3.xn I.
suppose that f(x) _ (x . an are distinct integers.an) .xnI < (nn(m l  n)m_n mm' = (m  n) / nnm Equality holds if and only if (mn)y = 1y n or Comment: For m = n + 1.1.xn+l < nn (n + 1)n+l for real numbers 0 < x < 1. jp(ai)j = q(ai)j = 1 .. a2.al)(x .an) . where al.e. Let f (x) = p(x)q(x) such that p(x) and q(x) are two polynomials with integral coefficients having degree less than n. it is irreducible. Since p(ai)q(ai) = f(ai) _ 1 and both p(ai) and q(a. i..(x . Solutions to Introductory Problems Therefore x m .' .a2)..) are integers. Then g(x) = p(x) + q(x) is a polynomial with integral coefficients having degree less than n.al)(x ..a2). we have xn . Equality holds if and only if x = n/(n + 1).1 is not irreducible. cannot be written as the product of two nonconstant polynomials with integer coefficients..(x . Problem 34 Prove that the polynomial (x .50 3. Solution 34 For the sake of contradiction.
Thus there are no solutions in this case. x .y8 = (x .y the first and the second equation. and x6 . xy < 0. y) for which: (1+x)(1+x2)(1+x4) = 1+y7 and (1 + y)(l + y2)(1 + y4) = 1 + x7. Then (1 + x)(1 + x2)(1 + x4) > 1 and 1 + y7 < 1.3. x8 . xy < 0. showing that there are no solutions in this case.y7) .y < 0. we can assume that x > 0 > y. Then it is clear that x = y = 0 and (x. Solutions to Introductory Problems and p(ai) + q(ai) = 0.y6).y8 > 0. By the symmetry. Then f (x) = p(x)2. x7 .y) + (x7 . x. Solution 35 We consider the following cases. which is impossible. By the symmetry. we can assume that x < y < 0. Then (1+x)(1+x2)(1+x4) > 1+x7 > 1+y7. y > 0 and x j4 y.y7 < 0. Subtracting the first equation from the second yields x8 . 1. There are no solutions in this case. (1) Since x < y < 0. 4. . which implies that the leading coefficient of f (x) must be a negative integer. xy = 0. we can assume that x > y > 0. By the symmetry. p(x) = q(x) and Problem 35 Find all ordered pairs of real numbers (x. 51 Thus g(x) has at least n roots. Multiplying by 1.xy(xs . But degg < n. y) = (0. y < 0 and x j4 y. 2. Therefore. the system now reads 1x8 = (1+y7)(1x)=1x+y7xy7 1y8 = (1+x7)(1y) = 1y+x7x7y. the lefthand side of (1) is positive while the righthand side of (1) is negative. so g(x) = 0. 3.y6 > 0. respectively. x.x and 1. 0) is a solution. since the leading coefficient of f (x) is 1.
1.1 and dividing by 2 on the both sides. Therefore (2) is true if and only if x = 0 or y = 0. Prove that \1 (a+ a21 j +(a. y) = (0. / .1 and x always have the same sign.1) 2 (X2 + x .a2ll is an irrational number.1)x2 + (2x2 . Problem 36 Solve the equation 2(2x .2 for real numbers x. Since f (x) = 2' . Solution 36 Rearranging terms by powers of 2 yields 2x2x + 2x+1(x2 . which in turn implies that their sum is not equal to 0. 1) are the only solutions to the system. (2) Hence if the terms on the lefthand side of (2) are nonzero.2)x = 2x+1 .1) + y(2x .1) = 0. (1) Setting y = x2 . 0) and (1. y) = (0. x(2y 1) > 0. x = y.52 3. they must have the same sign. and 1. which implies that (x. Solutions to Introductory Problems 5. Problem 37 Let a be an irrational number and let n be an integer greater than 1.0. (x. 0) or Therefore. 1.1) = 0. (1) becomes 211x+2xy(x+y)=0 or x(2y . Then solving 1x8=1x+y7xy7=lx+x7x8 leads to x = 0. which leads to solutions x=1.
x3) (x3 .3. assume that N is rational. we obtain that bm + 1/b' is rational for all mEN.x4) (x4 . Solutions to Introductory Problems 53 Solution 37 Let N = (a + a2 .x3 + x4)2 = x2(x4 + x5 .. In particular. For the sake of contradiction. x4. x3.x1) for real numbers x1i x2. Then by using the identity bm+1 + b +1 = (b + b / (m + b"')  (bm_ 1 +b 11 repeatedly for m = 1.x2) = x3(x5 + x1 .x4 + x5)2 = x4(x1 + x2 .x1 + x2)2 = x5(x2 + x3 . Solution 38 Let xk+5 = Xk.1) and let b=(a+ a21)n.. Then N = b + 1/b.x5) = x1(x3 + x4 . in contradiction with the hypothesis. bn +bn =a+ a21+a. .a21=2a is rational. Adding the five equations gives s 5 J(3xk .1) + (a  a2 . Problem 38 Solve the system of equations (xl .. x5.X2 + x3)2 (x2 .x5 + x1)2 (x5 .4xkxk+l + 2xkxk+2) = 1:(x2 + 2xkxk+2) k k=1 k=1 It follows that 1:(xk .xkxk+l) = 0k=1 . Therefore our assumption is wrong and N is irrational. 2.
a) for a E R. But 2(xy + yz + zx) = (x + y + z)z .x3.x2.1)(z . Solutions to Introductory Problems Multiplying both sides by 2 and completing the squares yields from which x1 = xz = x3 = X4 = x5. a.1). xz+yz+zz = 3. and xyz = 4.1)(y . y.1) x+y+z3 (x .1)(z . Therefore S = 2/9. .1)(z .x5) = (a. a.54 3.1)(y . Likewise.1) 1 1 (x . yz+x1=(y1)(x1) zx+y1=(z1)(x. and Hence S _ _ 1 (x .x4.1 Let S be the desired value.1 1 5(xy+yz+zx).1) + (y . Note that xy+z1=xy+1xy=(x1)(y1). a.1) + (z . Therefore the solutions to the system are (x1. Problem 39 Let x.(xy+yz+zx)+x+y+z.(x2 + yz + z2) = 1. and z be complex numbers such that x+y+z = 2.1)(y .1)(x . Evaluate 1 1 1 xy+z1 Solution 39 yz+x1 zx+y.1) xyz.
c. Who has a winning strategy? Solution 40 Mr. Then f (1) = A + B + C = a + b + c = 0. such that a + b + c = 0. the other solution is C/A. and C be any arrangement of a. Solutions to Introductory Problems 55 Problem 40 [USSR 1990] Mr.a. 16=a2+4x2+b2+ci+d2+e2>a2+4x2=a2+ (8 _ 4 2 Then b1 + c1 + d1 + e1 = 0 and a) (1) or 0 > 5a2 . will do the trick. B. A set of three distinct rational nonzero numbers a. where a = 0 if and only if b = c = d = e = 2 and a=16/5 if and only ifb=c=d=e=6/5. Since the product of the two solutions is C/A. d. d. Let b=x+bl. Mr.16a = a(5a . and c. and c. their average is x = (8 .3. Fat wins the game if and only if the resulting equation has two distinct rational solutions. Taf is going to arrange the three numbers as the coefficients of a quadratic equation x2+x+= 0. and it is different from 1.16). . which implies that 1 is a solution. d=x+dl. Fat has the winning strategy. b. and e is 8 . Solution 41. Let A. Fat is going to pick three nonzero real numbers and Mr. e=x+e1. b. Alternative 1 Since the total of b. c=x+c1. determine the maximum and the minimum value of a. Problem 41 [USAMO 1978] Given that the real numbers a. and e satisfy simultaneously the relations a+b+c+d+e=8anda2+b2+c2+d2+e2=16. b.a)/4. Therefore 0 < a < 16/5. and let f (x) = Ax 2 + Bx + C. c.
1)2 . Dividing by x2 yields (+!) (x_2+. (1) follows from _ (8a)2 b2+c2+d2+e2> (b+c+d+e)2 4 4 and the rest of the solution is the same.l+af a2 I+a2 2 Problem 43 Prove that 1 3 2n . .56 3. if a > 0.1 . Solutions to Introductory Problems Solution 41. It follows that x+1=1f x X1. Solution 42 We have (x2 + 1)(x2 . Problem 42 Find the real zeros of the polynomial Pa(x) = (x2 + 1)(x . then the polynomial Pa(x) has the real zeros 1+ 1+af 2 a 2. 2n < 3n for all positive integers n. then Pa(x) also has the real zeros X3.2 In addition.axe = 0. which in turn implies that.ax 2.) By setting y = x + 1/x.4 = 1. 1 2 4.2x + 1) .2 = l+ a. where a is a given real number./l+a . if a > 8. the last equation becomes y22ya=0. Alternative 2 By the RMSAM inequality.
3. Solutions to Introductory Problems
57
Solution 43
We prove a stronger statement:
1
3 4
2n1
2n
1
2
3n _+1
We use induction. For n = 1, the result is evident. Suppose the statement is true for some positive integer k, i.e.,
1
3
4
2k  1
2k
1
2
<
3k+1'
1
Then
1
3
2k1 2k+1
2k
2k+1
2
4
2k+2
2k+1
<
3k+1 2k+2'
1
In order for the induction step to pass it suffices to prove that
1
3k+1 2k+2
This reduces to
3k+4'
(2k+1
2
3k+1
2k+2) < 3k+4'
(4k2 + 4k + 1)(3k + 4) < (4k2 + 8k + 4)(3k + 1),
0 < k,
which is evident. Our proof is complete.
Comment:
By using Stirling numbers, the upper bound can be improved to 1/ 7rn for sufficiently large n.
Problem 44 [USAMO Proposal, Gerald Heuer]
Let
P(x) = a0x" +
a1xn1
+ ... + an
be a nonzero polynomial with integer coefficients such that
P(r) = P(s) = 0
for some integers r and s, with 0 < r < s. Prove that ak < s for some k.
58
3. Solutions to Introductory Problems
Solution 44 Write P(x) _ (x  s)xcQ(x) and
Q(x) = box' +
bix'n'1 +
... + b,,,,
where b,,,, 54 0. Since Q has a positive root, by Descartes' rule of signs, either there must exist some k for which bk > 0 > bk+1, or b,,,. > 0. If there exists a k for which bk > 0 > bk+1, then
ak+1 = sbk + bk+1 < 5
If b,,,, > 0, then a, = sb, < s.
In either case, there is a k such that ak < s, as desired.
Problem 45
Let m be a given real number. Find all complex numbers x such that
(x) 2
x+
+
x
2
x1
_ 2+m. m
Solution 45
Completing the square gives
x
x
2
(x++x)
x21
=
_
2x2
x2_1+m +m,
2
2x2
x2  1
+ m2 + m
.
Setting y = 2x2/(x2  1), the above equation becomes
y2y(m2+m)=0,
(ym1)(y+m)=0.
Thus
x 2x 2
1
= m or

2x 2
1
=m+
which leads to solutions
m x=f m+2 if m#2and x=±% m+1 ifm m1
1.
3. Solutions to Introductory Problems
59
Problem 46
The sequence given by xo = a, xl = b, and
xn+1 = 2 (Xn1 +
is periodic.
I
I
.
Prove that ab = 1.
Solution 46
Multiplying by 2xn on both sides of the given recursive relation yields
2xnxn+l = xn_lxn + 1
or
2(xnxn+l  1) = xn_lxn  1.
Let yn = xn_lxn  1 for n E N. Since Yn+1 = yn/2, {yn} is a geometric sequence. If xn is periodic, then so is yn, which implies that yn = 0 for all n E N. Therefore
ab=xoxl=yi+1=1.
Problem 47
Let a, b, c, and d be real numbers such that
(a2+b21)(c2+d21)>(ac+bd1)2.
Prove that
a2+b2>1andc2+d2>1.
Solution 47
For the sake of the contradiction, suppose that one of a2 + b2 or c2 + d2
is less than or equal to 1. Since (ac + bd  1)2 > 0, a2 + b2  1 and
c2 + d2  1 must have the same sign. Thus both a2 + b2 and c2 + d2 are less than 1. Let
x=1a2b2andy=1c2d2.
Then 0 < x, y < 1. Multiplying by 4 on both sides of the given inequality
gives
4xy > (2ac + 2bd  2)2 = (2  2ac  2bd)2 = (a2+b2+x+c2+d2+y2ac2bd)2 = [(ac)2+(bd)2+x+y]2
>
(x + y)2 = x2 + 2xy + y2,
Solution 48 Note that 8(3z + 1)6(4z + 1)4(6z + 1)2(12z + 1) = 768. which is impossible.e. . x2.= 768. Thus our assumption is wrong and both a2 + 62 and c2 + d2 are greater than 1.X2 + ...759 = 0.60 3. (w .y)2.10w .3).x1 + 1 . w2 i. . Setting u = 24z + 5 and w = u2 yields (u + 3)(u + 1)(u . (u2 i._1. xn. Solutions to Introductory Problems or 0 > x2 . Problem 48 Find all complex numbers z such that (3z + 1)(4z + 1)(6z + 1)(12z + 1) = 2. (24z + 8)(24z + 6)(24z + 4)(24z + 2) = 768.2xy + y2 = (x . Therefore the solutions to the given equation are z 335 and z= 24 23a5 24 Problem 49 Let x1.e.33)(w + 23) = 0.n>2. + 1 _n1 2 1 . be the zeros different from 1 of the polynomial 1 .xn_1 .1)(u .  1)(u2 .9) = 768. Prove that 1 1 P(x)=xn1.
...1 x Then Q(x) = (1)"x'1 + (1)n1 (n) (1 .. Alternative 2 For any polynomial R(x) of degree n1. + (n) x _ (n) 1and as are the nonzero roots of the polynomial Q(x). By the Vieta's Theorem... 1 1 1 1x1 + 1x2 1 1 1 1xn_1 an1 a2 a1 a2a3.an is equal to the additive inverse of the ratio between the coefficient of x and the constant term in Q(x).1 _ 1 .. n. + aia2. let ai = 1 .. the desired value is equal to (n S n1 12 P as desired... xn_1.... + a1a2.. .... Alternative 1 For i = 1.an + aia3...an1 ala2. + 1 X .an + . Thus the desired sum is the sum of. i. Solutions to Introductory Problems 61 Solution 49.e....an1 and P = a1. x2... whose zeros are x1.X1 X .x) x (1 .. .X2 x . the ratio between S = a2.a.the reciprocals of the roots of polynomial Q(x).an + ..xi.xn_1 = R' (x) R(x) . the following identity holds: 1 + 1 + .xi = 0. as/ Q(ai) _ xi .1 ai xn2 +.2. . Let Q(x) = P(1 .3. ..an + a1a3...x)n .ai)n . that is. (n) Solution 49.
It follows that (a . andy=uv.. Solutions to Introductory Problems For R(x) = xn 1 x1 = xn1 + xnz + . Adding the two equations and subtracting the two equations in the original system yields the new system u . Then 0<x2y2=uv<1. R(1) = n and R'(1)=(n1)+(n2)+ It follows that 1 +1= n(n1) 2 R'(1) 1 1x1 + 1x2 Problem 50 +.62 3.+yandv=xy.b) l u v. Solve the system of equations x .b2)(1 .uv) = (a2 .+ 1 n.. x=u2v.1 2 1xn1 R(1) Let a and b be given real numbers.b) 1 a2+b2 (a+b) 1a2+b2 u which in turn implies.y xz_yz 1x2+y z y .x x2y2 = a. .. 1x2+y2 for real numbers x and y.b 1a +b2 J 2'2 ' whenever 0 < a2 .b2. b Solution 50 Letu=x.b2 < 1.azbz andv= 1+ a2b2 a+b a2b2 b+a a2b2 1a4. hence uv = a2 .uv). + x + 1. Multiplying the above two equations yields uv(1 .that (xy) = '2 1.u uv = (a+b) 1uv v + v uv = (a ..
SOLUTIONS TO ADVANCED PROBLEMS .
.
SOLUTIONS TO ADVANCED PROBLEMS Problem 51 Evaluate 0200 0) 2 + (2000) + 5 (20800) + .u8) 1 9 IL 9 J ..1. let f(u) = u(1 . Determine with proof the minimum value of x3 1x8+1y8+1z8 Solution 52 For 0 < u < 1.4...u8). y 3 z3 (1 . + (2000) Solution 51 Let 2000 f (X) = (1 + x)2000 = k=0 02000) k xk. Let w = (1 + vi) /2. + (2000) 2000 2 =f(1)+wf(w)+w2f(w2) = 22 000 + w (1 + L. Let A be a positive real number. Then w3 = 1 and w2 +w+ l =0.. A(f (u))8 = Au8(1 .1 3 Problem 52 Let x. y.u8) < f Au8 +8(1 .u8) . Hence 3 (2 000) + 2000) 5 +. By the AMGM inequality. Thus the desired value is 22000 . z be positive real numbers such that x4 + y4 + z4 = 1.))2000 + w2 (1 + w2) 2000 = 22000 + w(w2)2000 + w2(_w)2000 = 22000 + w2 + w = 22000 .
Then s2 = 28 + 3S + 68 > 3. 1 Comment: This is a simple application of the result of problem 33 in the previous chapter. which in turn implies that 6S > 4S = (28)2 > s2.66 4. and hence [s] > 1. Problem 53 [Romania 1990] Find all real solutions to the equation 2x + 3x + 6x = x2.] > 1 + [s] > 8.x2 is increasing. Assume that there is a solution s > 0.z8) (x4+y4+24)439 8 943 8 ' with equality if and only if x=y=z= 43.y8) + z4 z(1 .x8) 4 4 Y y(1 . so the equation f (x) = 0 has the unique solution x = 1. Solution 53 For x < 0. . so s > f . the function f (x) = 2x + 3x + 6x .. Solutions to Advanced Problems Setting A = 8 in the above inequality yields or It follows that x3 1x8+1y8+1z8 > y 3 z3 x4 x(1 . But then s > lsj yields 2S > 2isJ = (1 + 1) L.
Solutions to Advanced Problems 67 So 2S + 33 + 6S > s2. Therefore x = 1 is the only solution to the equation. . a22V12an+2 anv2 an+vf2 (a. Problem 54 Let {an}n>1 be a sequence such that al = 2 and an 1 an+1 = 2 + an for all n E N. Note that an+1+v/'2 a2n+2vf2an+2 an+ 2 an+1vf2Therefore.4. Find an explicit formula for an. + 2^1 (Vr.[(vf2. a contradiction. and z be positive real numbers.1 Problem 55 Let x.+1)2n+1] (V/2+ 1) 2n .2+1)try anvf2and an = v/2. Prove that x y x+ (x+y)(x+z) + y+ (y+z)(y+x) z + z+ (z+x)(z+y)  Solution 55 Note that (x+y)(x+z) > xy+ xz. y. Solution 54 Solving the equation leads to x = fV12.
.. m = n. 2. . Thus f is of the form zm(z .`' Likewise.1)n(z + 1)n(z2 . where m and n are nonnegative integers and 9(z) = (z . ..zl)(z . and f is nonzero. squaring both sides of the above inequality yields x2 + yz > 2x yz.zl)(z2  z2). with proof. all nonzero polynomials f (z) such that f(z2) + f(z)f(z + 1) = 0.zk) _ a2zm+n(z + 1)m(z .(z2 Thus a = a2.z2). Thus x x < x Vrx (x+y)(x+z) y x+ + xz _ Vrx.+ f+. which is evident by the AMGM inequality.(z . y+ and (y+z)(y+x) z < x+ f + f +f+VfZ VfY_ z+ (z+x)(z+y) Adding the last three inequalities leads to the desired result.zl)(z . Dividing by z2m(z ..1)n(z . (z .zk).. for i = 1.68 4. Solutions to Advanced Problems In fact.. Then z2m = zm+n. k.. zi 54 0 and zi 1 . . the last equation becomes 9(z2) = 9(z)9(z + 1). that is. Solution 56 Let f(z) = azm(z .z2 34 0. The given condition becomes az2m(z .1)n(z + 1)n.1)ng(z).zk) . so a = 1.z2) . Problem 56 Find. Since zi 0 1. 1 ..1)mg(z).
Problem 57 Let f : N > N be a function such that f (n + 1) > f (n) and f (f (n)) = 3n for all n. and so on. 1. 1. all its roots must have absolute value 1. g cannot have any roots. f(3n)=2. Since g cannot have infinitely many roots. g(r4) g(r8) = = 0. g((r . so the same should be true of r2: r2 E < 1+Vi 1\i 2 2 This is absurd. Therefore. Clearly. Evaluate f (2001). Hence. f (2.and 2. 3n) = 3n+1 . then clearly g must have at least one complex root r 0... the f (z) are all the polynomials of the form z(z . Now g(r2) = g(r)g(r + 1) = 0. Now. if Iri=I(r^1)21=1. 2 2 But r2 is also a root of g. so I (r1)21=1. Alternative 1 We prove the following lemma...1)"n for mEN. then rE 1+Vr3i 1Oi . Solutions to Advanced Problems 69 We claim that g(z) . Suppose not.4. 2. and g(z) __ 1.1)g(r) = 0. 0. Lemma For n = 0.3n.1.1)2) = g(r . Solution 57.
Since 2001(3) = 2202010. we can prove that f (n)(3) 2a2 = at if a1 = 1.3n). Hence f (2001) = f (2. let n(3) = ala2 n. f (3n +. Since f : N 4 N. Hence Proof: f(2) = f(f(1)) = 3. This completes the induction. note that f (1) 54 1. There are 3n . which is impossible.3 n)) = 2. Thus 1 < f (1) < f (f (1)) = 3 or f (1) = 2. lag . Therefore f (2 . Since f (n + 1) > f (n). otherwise 3 = f (f (1)) = f (1) = 1.3n+1 and f (2 3n+1) = f (f(3n+1)) = 3n+2 as desired. f (3n) =2.32 +23 4 +23 6 + 1 . 3n + m) = f (f (3n + m)) = 3(3 n + m) for 0 < m < 3n. 3n and there are 3n . ae0 if a1 = 2. Suppose that for some positive integer n > 1. Solutions to Advanced Problems We use induction. Alternative 2 For integer n. f (2001)(3 = 12020100 or f (2001) = 1 .) =23 n + m. Since f is an increasing function..70 4. for 0 < m < 3n. For n = 0. Solution 57. . at denote the base 3 representation of Using similar inductions as in the first solution.1 integers m such that 3n < m < 2 .3') =3n+1 Then..3' and f (2.36 + 543) = 3 (36 + 543) = 3816.3n<m'<3n+1=f(2.1 integers m' such that f(3n)=2.37 = 3816. f is increasing. f (1) > 1. f (3n+1) = f (f(2 .
Solutions to Advanced Problems 71 Problem 58 [China 1999] Let F be the set of all polynomials f (x) with integers coefficients such that f (x) = 1 has at least one integer root. Mk = [k/2]! [k/2]! + 1. 1 .rkl Now rl. Since Mk > 1.. I1mkI > Ir1r2.mk = (x ...rk)gk(x). which equals 1 . .. For each integer k > 1. find mk.1) ('2')(x .. Note that rlr2 rk divides the constant term of gk(x) .mk cannot be 0..1)(x + 1)(x . . Now 9k (0) = fk(a) = 1.mk. This value of mk is attained by 9k(x) _ (. rkl > 11 (1) 2 . so we can write 9k(x) . Solution 58 Suppose that fk E F satisfies the condition that fk(x) = Mk has exactly k distinct integer roots.(2). so the constant term of gk is 1... Now gk(x) = Mk has exactly k distinct integer roots rl.. r2i rk are distinct integers. r 2 .r2) . rk. so ) Irlr2 . and none of them is 0. and let a be an integer such that fk (a) = 1. Let gk be the polynomial in F such that 9k(x) = fk(x + a) for all x.2)(x + 2) (x + (1)k [k/21) + [k/2]! [k/21 ! + 1.4. Thus.rl)(x . (1)k+l [k/2]1 hence Mk > [k/2]! [k/21! + 1..mk. where qk(x) is an integer polynomial.3 .. the least integer greater than 1 for which there exists an f E F such that f (x) = Mk has exactly k distinct integer roots. (x .
xn is increasing.Si + 1 = 3 and (1) becomes 2 < 3 < 4. x2 = xi .1 xn+1 .xn + 1. forn>1.1 < 22 (1) We use induction to prove (1). Now suppose that (1) is true for some positive integer n = k..1) 1 xn .1 = xk+1(xk+1 . for n E N.1 < 22k (2) Then for n = k + 1. the lower bound of (1) follows from Xk+2 . Prove that 1Solution 59 Since x1 = 2 and 221 x1 x2 1<1+1+.1 1 xn xn xn .1)..+1 <121. For n = 1.72 4.1 = Xn(Xn . Then xn100. 2^ xn xn+1 . Solutions to Advanced Problems Problem 59 Let x1 = 2 and z xn+1 = xn .1) > 2 2k1 2 2k1 = 2 2k . i. 22k 1 < xk+1 . Hence 1 1 xn+1 . 1 1 1 1 < xn+1 .1 which implies that 1 1 1 1 x1 x2 xn xn+1 Thus it suffices to prove that. which is true.1 or 1 xn(xn ..e.
Problem 60 [Iran 1997] Suppose that f : R+ R+ is a decreasing function such that for all x)yER+.4. Solutions to Advanced Problems 73 Since xk+1 is an integer.1) < 22k (22k . If f (f (x)) > x.1 < 22k .1 = xk+1(xk+1 . The solution above shows that this condition is not necessary. Solution 60 Setting y = x gives f (2x) + f (2f (x)) = f (2f (x + f (x))). Thus f (f (x)) = x as desired. the lower bound of (2) implies that 22 Xk+1 C and xk+1 . the left hand side of this equation is negative. so f(f(x) +f(f(x)) > f(x+f(x)) and f(x)+f(f(x)) <x+f(x). Comment: In the original formulation f was meant to be a continous function. This finishes the induction and we are done. a contradiction.1. Prove that f(f(x)) = x.f(2f(x + f(x))). Replacing x with f (x) yields f (2f (x)) + f (2f (f (x))) = f (2f (f (x) + f (f (x)))) Subtracting these two equations gives f(2f(f(x))) . A similar contradiction occurs if f (f (x)) < x.11 < as desired. f(x + y) + f(f(x) + f(y)) = f(f(x + f(y)) + f(y + f(x))).f(2x) = f(2f(f(x) + f(f(x)))) . . from which it follows that 22k+1 xk+2 .
Solutions to Advanced Problems Problem 61 [Nordic Contest 1998] Find all functions f : Q > Q such that f(x + y) + f(x . Any such function works. Now suppose f is any function satisfying f(x + y) + f(x .2)2f(z) _ (2n2 .1)z) + 2f(z) so f(nz) = 2f((n . so f (0) = 0.2. since f(x+y) +f(x . The claim holds for n = 0 and n = 1.1)2f(z) + 2f(z) .74 4.1)z) + 2f(z) .1 and n . y e Q.f((n .4n + 2 + 2 .y) = 2f(x) + 2f(y) for all x. Then letting x = y = 0 gives 2f (0) = 4f (0).y) = k(x+y)2 + k(x .y) = 2f (x) + 2f (y). We will prove by induction that f (nz) = n2f(Z) for any positive integer n and any rational number z.(n .1)z .n 2 + 4n . .1)z + z) + f ((n .4)f (z) = n2f(z) and the claim holds by induction.z) = 2f((n . let n > 2 and suppose the claim holds for n .1)z.2)z) = 2(n .2kxy + ky2 = 2kx2 + 2ky2 = 2f (x) + 2f (y).y)2 = kx2 + 2kxy + ky2 + kx2 . Letting x = 0 in the given equation gives f (y) + f (y) = 2f (0) + 2f (y) = 2f (y) so f (y) = f (y) for all rational y. y = z in the given equation we obtain f (nz) + f ((n .2)z) = f ((n . Then letting x = (n . thus f (nz) = n2f(Z) for all integers n. Solution 61 The only such functions are f (x) = kx2 for rational k.
8x2 + 4x3 + 4x4 = (x + a= 3x + (x + 2x2) 2 2x2)2.4.x2 yields the quadratic equation x2+2x+a=0.x3 .1+4a 2 show that the four solutions are distinct. Prove that the equation x3(x + 1) = (x + a)(2x + a) has four distinct real solutions and find these solutions in explicit form. whose solutions are x _ (1 f 1 ++ 4a) 2 The second choice a = 2x .1a<1+ 1a< 1. Thus The first choice a = x+x2 yields the quadratic equation x2 xa = 0.x4 = 0. whose solutions are The inequalities 1. The discriminant of this equation is 9x2 . g2f(x) = f(qx) = f(p) = p2f(1) = kp2 so f(x) = kp2/q2 = kx2. Problem 62 [Korean Mathematics Competition 2000] Let1<a<1. Solution 62 Look at the given equation as a quadratic equation in a: a2 + 3xa + 2x2 . Solutions to Advanced Problems 75 Now let k = f (1). then for any rational number x = p/q. k E Q. 1+ 1+4a . are the only solutions. Thus the functions f (x) = kx2.
the inequality becomes 1 x+1y+1z+1 + + 1 1 C y+1z+1 x+l' y+z+2 < x x (y + 1)(z + 1) . y = b + c and z = c + a. x+y+z+2<xyz. b. By the AMGM inequality. 2(a+b+c) < a2b+ab2 +b2c+bc2 +c2a+ca2.76 4.x + 1' xy+xz+2x+y+z+2 < xyz+xy+xz+x. Solutions to Advanced Problems Indeed 1+ 1a< 1/+4a 2 reduces to which is equivalent to 2 1a<3. Alternative 1 Setting x = a + b. . 2(a+b+c)+2 < (a+b)(b+c)(c+a). or 3a < 4a2. Prove that a+b+l+b+c+l+c+a+1 C1 Solution 63. and c be positive real numbers such that abc = 1.1+4a 6 1+4a<6+8a. Problem 63 [Tournament of Towns 19971 Let a. which is evident. 3 (alb + a2c + 1) > 3 a4bc = 3a.
4. Solutions to Advanced Problems
Likewise,
77
(b2c + b 2 a+ 1) > 3b
and
(c2a + c2b + 1) > 3c.
Therefore we only need to prove that
2(a+b+c) +3 < 3(a+b+c),
3 <a+b+c,
which is evident from AMGM inequality and abc = 1.
Solution 63, Alternative 2 Let a = a', b = bl, c = ci. Then alblcl = 1. Note that
a, + bi  alb,  albi = (a,  bi)(ai  bi) > O,
which implies that
ai + bi > a,bl(a, + b1).
Therefore,
1
_
1
a+b+1
ai + bi + alblcl
1
albl(a, + bi) + alblcl alblcl
a,bl(a, + bl + cl)
Cl
al+bl+cl
Likewise,
1
<
al
bl
b+c+1  al+bl+cl
and
c+a+1  al+bl+cl
Adding the three inequalities yields the desired result.
1
<
78
4. Solutions to Advanced Problems
Problem 64 [AIME 1988]
Find all functions f, defined on the set of ordered pairs of positive integers, satisfying the following properties:
f(x,x) = x, f(x,y) = f(y,x), (x + y)f(x,y) = yf(x,x + y).
Solution 64
We claim that f (x, y) = lcm(x, y), the least common multiple of x and y. It is clear that lcm(x, x) = x
lcm(x, y) = lcm(y, x).
lcm(x, y)
xy
= gcd (x, y)
gcd (x, y) = gcd (x, x + y),
where gcd (u, v) denotes the greatest common divisor of u and v. Then
(x + y)lcm(x, y)
_ (x + y) _
xy gcd (x, y)
x(x + y) gcd (x, x + y)
= ylcm(x, x + y).
Now we prove that there is only one function satisfying the conditions of the problem.
For the sake of contradiction, assume that there is another function
g(x, y) also satisfying the given conditions. Let S be the set of all pairs of positive integers (x, y) such that f (x, y) A g(x, y), and let (m, n) be such a pair with minimal sum m+n. It is clear that m A n, otherwise
f (m, n) = f (m, m) = m = g(m, m) = g(m, n). By symmetry (f (x, y) = f (y, x)), we can assume that n  m > 0. Note that
nf(m,nm) = [m+(nm)]f(m,nm) = (nm)f(m,m+(nm))
(nm)f(m,n)
4. Solutions to Advanced Problems
or
79
f(m,nm) =
Likewise,
n
nm f(m,n).
g(m,nm) = n nm g(m,n).
g(m, n), f (m, n  m) g(m, n  m). Thus (m, n  m) E S. But (m, n  m) has a smaller sum m + (n  m) = n, a contradiction. Therefore our assumption is wrong and f (x, y) = lcm(x, y) is the only
Since f (m, n)
solution.
Problem 65 [Romania 1990]
Consider n complex numbers zk, such that Zk I < 1, k = 1, 2, ... , n. Prove that there exist e e2,,. .. , en E {1, 1} such that, for any m < n, 1
lelzl +e2z2 +''' +emzml < 2.
Solution 65
Call a finite sequence of complex numbers each with absolute value not exceeding 1 a green sequence. Call a green sequence {zk}'1 happy if it has a friend sequence {ek}n k_1 of is and is, satisfying the condition of the problem. We will prove by induction on n that all green sequences are happy. For n = 2, this claim is obviously true. Suppose this claim is true when n equals some number m. For the case of n = m + 1, think of the Zk as points in the complex plane.
For each k, let Bk be the line through the origin and the point corresponding to zk. Among the lines 21, L2, 6, some two are within 60° of each other; suppose they are f, and f,3, with the leftover one being f,. The fact that Qa and Qp are within 60° of each other implies that there exists some number e,3 E {1, 1} such that z' = za + e,3 z,3 has absolute value at most 1. Now the sequence z', z.y, z4, z5, ... , zk+1 is a kterm green sequence, so, by the induction hypothesis, it must be happy; let e', e7, e4, e5, ... , ek+1 be its friend. Let ea = 1. Then the sequence {ei}k+1 is the friend of {zi}k+l. Induction is now
complete.
80 4. and y2+y+1= 3y2+3y+3 3 which implies that _ y3+3y2+3y+1 3 . . Let xand y = 32. we obtain x (34 V9 32+1) 2 1 Consequently. (a.(y+1)3 3 x3=y1= y2+y+1 1 3 (y+l)3 (1) or 'r3 x y+ On the other hand. b. Solutions to Advanced Problems Problem 66 [ARML 1997] Find a triple of rational numbers (a. b. Note that 1=y31=(y1)(y2+y+1). 3=y3+1=(y+1)(y2y+1) from which it follows that 1 y+l _ y2y+1 3 (2) Combining (1) and (2). c) = 4 9' 9' 9 is a desired triple. c) such that V321= Solution 66 3a+ 3b+yc. Then y3=2andx= 3y1.
4212 +42 32 x2 y2 z2 . we have log... + logxn log XI (1 . Problem 68 [AIME 1984] Determine x2 + y2 + z2 + w2 if x2 2212 +2232 +2252 +2272 =1.1/4.4. .4 ) >  2 log x2 log xi log xn + + log x3 + . since (x . Solution 67 Since log.4 I + log.... Equalities hold if and only if x1 = x2 = . xn are real numbers in the interval (4. xk+1 = 21og xk+l 4 logxk It follows that logxl I x2 .1 log xn > 2n by the AMGM inequality... (X3 ... 8212+8232+8252+8272 .. + logx (ii  1 4 where x1i x2. 1).w2 x2 y 2 z2 W2 6212 +6232 +6252 +6272 x2 2 z2 w2 =1. + log x2 109X..4) + . x is a decreasing function of x when 0 < a < 1 and. = xn = 1/2. Solutions to Advanced Problems 81 Problem 67 [Romania 1984] Find the minimum of logxl 1 1 x2  4 + logx2 x3  4 + .1/2)2 > 0 implies x2 > x . y 2 z2 w2 +4252 +4272 =1." xk+i .. .1 > logxk xk+1 = 2 logx.
Multiplying to clear fractions.16) (t .. 16.1)(t .49) x2(t . P(t) = (t . from which it follows that x2+y2+z2+w2= 36.e. 9.9)(t . t 0 1. Solutions to Advanced Problems Solution 68 The claim that the given system of equations is satisfied by x2.16.64). Since the range of a2+y consists of all real numbers. .82 4.9)(t . where P(t) = (t .49) . y E JR.e. 36. P(t) = 0 has exactly four zeros t = 4.25) (t . and 64.25) (t . Problem 69 [Balkan 1997] Find all functions f : R + R such that f(xf(x) +f(y)) = (f(x))2 +y for all x. (1) is equivalent to the polynomial equation P(t) = 0. we find that for all values of t for which it is defined (i.49) z2(t1)(t9)(t49)w2(t1)(t9)(t25).25)(t . Solution 69 Let f (0) = a. and 49). 25. and w2 is equivalent to claiming that x2 t12+t32+t52+t72 =1 y 2 z2 w2 (1) is satisfied by t = 4.36)(t ..1)(t .y2(t . Setting x = 0 in the given condition yields f(f(y)) = a2 + y.4) (t . Comparing the coefficients of t3 in the two expressions of P(t) yields 1+9+25+49+x2 +y2+z2+w2 = 4+ 16+36+64. z2. y2. 36. for all y c R. Since deg P(t) = 4. i. f must be surjective. and 64.
f (y) = y. Note that (f (y))2 = y2. b). Setting x = b in the given condition yields f(f(y)) = f(bf(b) + f(y)) = (f (b))' + y = y. say. Each time. for all x. Solutions to Advanced Problems 83 Thus there exists b E R such that f (b) = 0. y E R. Suppose that f (x) 54 x. . one is allowed to erase two numbers. and replace them by the number 2 min(a. Setting x = cf (c) + f (y) in (1) yields If (cf (c) + f (y))]2 = [cf (c) + f (y)]2 = [c2 + f (y)]2.4. (f(x))2 +y = f(xf(x) +f(y)) = f[f(f(x))f(x) +f(n)] = f[f(x)f(f(x)) +y] =f(f(x))2+y=x2+y. for all y E R. a function which satisfies the given condition. (f(x))2 = x2 (1) It is clear that f (x) = x is a function satisfying the given condition. 2999 have been written on a board. . that is. It follows that (y)]2 [c2 + f or = (c2 + y)2. setting x = c in the given condition yields f(cf(c) +f(y)) = (f(c))2 +y = c2 +y. for all y E R. After 1999 such operations. for x E R. Prove that c < 1. Then there exists some nonzero real number c such that f (c) = c. Problem 70 The numbers 1000. Therefore the only functions to satisfy the given condition are f (x) = x or f (x) = x. 1001. one obtains exactly one number c on the board. a and b. for allyeR. It follows that. for all y E R. and.
Then a min(a. a2.. be real numbers..84 4.k2 > 20002 100 Rearranging terms in S yields C . the sum is a monovariant). as desired. . Note that. At the beginning this sum is S _ 1 1 1 1 1000 + 1001 + + 2999 < c' where 1/c is the sum at the end. .b) = We have 2 1 1 1 a +b 2 )' from which it follows that the sum of the reciprocals of all the numbers on the board is nondecreasing (i. Hence f(x)= 1+a. Solutions to Advanced Problems Solution 70 By symmetry. we may assume a < b. Prove that the equation 1 +a1x+ l+a2x+ has at most one nonzero real root..k + 2000 + k 20002 . Problem 71 [Bulgaria 1998] Let al.x .1000 (1001 1 2999) 1 (1002 1 2998) (1999 2001 1. for 1 < k < 999.x++ l+a. a.e... + l+a. x = n Solution 71 Notice that fi (x) = 1 + ax is concave. 1 1 _ 4000 4000 1 2000 . 2000 1000 + 1000 x 2000 or c < 1. not all zero.
so An+1 C [0.an) forn> 1. Problem 72 [Turkey 1998] Let {an} be the sequence of real numbers defined by a1 = t and an+1 = 4an(1 .1). Observe that f1(0) = 10. we have three real roots x1 < x2 < X3. 1].4. An C [0. 1]) = [0. f1(1) = {1/2}. Suppose there is more than one nonzero root. . a contradiction. For how many distinct values of t do we have a1998 = 0? Solution 72. our assumption is wrong and there can be at most one nonzero real root for the equation f (x) = n. and I{y: f(y)=x}j =2 for allxE [0. Therefore. we can find two distinct points on the curve with derivative 0. 11. Then x c An+1 = f (x) E An C [0. Now suppose n > 1 and An C [0. 1]. 85 Since f'(x) exists. Alternative 1 Let f (x) = 4x(1 . Solutions to Advanced Problems is concave. 1 E An. 1}. and the claims hold. Let An = {x E R : fn(X) = 0}. For n = 1. 1 E An. then An+1 = {x E 118: f n+1 (x) = 0} = {xER: fn(f(x))=0}={xER: f(x)EAn}. We claim that for all n > 1. there can be at most one point on the curve y = f (x) with derivative 0. Applying the MeanValue theorem to f (x) on intervals [x1i x2] and [x2i x3]. 1]. f1([0. we have A1= Ix GRI f(x)=0}= [0. 1].x). and An I = 2n1 + 1. 1]. and IAnI = 2n1 + 1. 1] = x c [0. Since x = 0 is also a root.
we have f'+1(1) = 0 for all n > 1. f (sine ¢) = 4 sin20(l .. . since a1 = sine 0. a3 = sin 2 40. Thus the values of t which give a1998 = 0 are sin2(kir/21997) k E Z. so there are 21996 + 1 such values of t. Solutions to Advanced Problems Since f (0) = f (1) = 0.. 1]. 7r/2] such that sin 0 = V. Solution 72. l{x: f(x)=1}I+ aE[0. a1998 = 0 if and only if f 1997(t) = 0. 1].}l I{x : f (x) = all aEA. Alternative 2 As in the previous solution. Finally. so if a1998 = 0 we must have t E [0. observe that if f (x) E [0..1) Ifx : f (x) =all aEA Thus the claim holds by induction.sine 0) = 4 sin 2 O cost 0 = sin 2 20. giving 21996 + 1 such values of t. a1998 = sin 2 219970. so 1 E A.. Now choose 0 E [0.+1 Now we have jAn+1 j l{x : f (x) E A. . it follows that a2 = sin 2 20.. Therefore a1998 = 0 sin 2 19970 = 0 0= k7r 21997 for some k E Z.86 4. . Observe that for any 0 E R. 1] then x E [0.
11. a contradiction. 0. g described above satisfy the conditions of the problem. b E {1. 1} such that f (a) = f (b). We claim that the functions f. Now let y = Of (x) Then g(y) = x and g(f(x)) = g(y2) (y2)In(y2) = y41ny = (ylny)4 In(y2) = (yInyl\)4 (y2) ify>1 _ 1 0 if0<y<1 ify=0 = [g(y)]4 X4 . It is clear from the definition of f that f (g(x)) = x2. we are allowed to define f as an even function such that f (x) = y2. (b) Let g(x) = Ixl'n 1x1 IxjInlyl if Jxi > 1 if 0 < JxJ < 1 0 ifx=0. thus. Note that g is even and jai = JbI whenever g(a) = g(b). But then a3 = g(f(a)) = g(f(b)) = b3. Therefore. Thus.4. whence x E {1 0 1} x3 = x = f (X) = [ f (x)]2 = f (X) E {0. there exist different a. the desired functions f and g do not exist. Solutions to Advanced Problems 87 Problem 73 [IMO 1997 short list] (a) Do there exist functions f : R * ]I8 and g : R > R such that f(g(x)) = x2 and g(f(x)) = x3 for allxER? (b) Do there exist functions f : R > R and g : R * R such that f(g(x)) = x2 and g(f(x)) = x4 for all xEll? Solution 73 (a) The conditions imply that f (x3) = f (g(f (x))) = [f (x)]2. where y is such that g(fy) = x.
Prove that a1a2. Alternative 1 We define two new sequences..bi) ai >0.88 4.ai)(ai . let ai=ak andbi=bi+aka. For i = 1 .. For z = 1.fori>k. Solution 74. bn )n'..< n + bn < ak from which the desired result follows. .. ai = (ak . > 0. n.ak ai ai = ak and bi = Then ai .0<b1 <b2 <bn be real numbers such that n a i=1 i=1 n Suppose that there exists 1 < k < n such that bi < a. 2.) . bn. . ... Then bi+b2+ +b'<nak. for cy(x . .bi=ak or (a' b.Y) (Y + c) > 0.. _ (bib2 ...(ai _ bi) bak = ak(aib..an > b1b2. Solution 74. . Therefore flak Applying the AMGM inequality yields b1b2 . let b. 2. bnakn aia2. for 1 < i < k and bi>a. (1) Note that. > Y x+c y+c x>yandc>0. Solutions to Advanced Problems Problem 74 [Weichao Wu] Let0<a1 <a2 . n.. Alternative 2 W e define two new sequences... <an..) a.an bi + b2 + ..
4. Solutions to Advanced Problems
89
Setting x = ai, y = bi, and c = ak  ai, the above inequality implies that ai/bi > ati/b?, for i = 1, 2, ... , n. Thus,
ala2...an > a' a' ...a'
(2)
blb2...bn
Using (1) and the AMGM inequality yields (ala2 ... a' r _ ak ? or
bi+b2+...+b'
n
1 > (blb2 ... bn) "
aia2 ... an > bib2 ... bn
(3)
It is clear that the desired result follows from (2) and (3).
Problem 75
, a8, prove that at least one of the following six numbers: alai + a2a4, alas + a2a6, ala7 + a2a8,
Given eight nonzero real numbers al, a2,
a3a5 + a4a6, a3a7 + a4a8, a5a7 + a6a8 is nonnegative.
Solution 75 [Moscow Olympiad 1978]
First, we introduce some basic knowledge of vector operations. Let u = [a, b] and v = [m, n] be two vectors.
Define their dot product u v = am + bn. It is easy to check that
(i)
m2+n2 = IvI2, that is, the dot product of vector with itself is the square of the magnitude of v and v v > 0 with equality if
and only if v = [0, 0];
(ii)
(iii) u. (v + w) = u v + u w, where w is a vector;
(iv) (cu) v = c(u v), where c is a scalar.
When vectors u and v are placed tailbytail at the origin 0, let A and B be the tips of u and v, respectively. Then AI = v  u. Let LAOB =0. Applying the law of cosines to triangle AOB yields
Iv  u12
= AB2
= OA2 + OB2  20A OB cos B = 1u12 + IV12  2jul ivI cos8.
90
4. Solutions to Advanced Problems
It follows that
(vu) (vu)=
or
v2lullvlcosO,
cos 0 =
lullvl
Consequently, if 0 < 0 < 90°, u v > 0. Consider vectors vi = [al, a2], v2 = [a3i a4], v3 = [a5, as], and v4 =
[a7, a8].
Note that the numbers ala3 +a2a4i ala5 +a2a6, ala7+a2a8, a3a5+a4a6, a3a7 + a4a8, a5a7 + a6a8 are all the dot products of distinct vectors v; and vj. Since there are four vectors, when placed tailbytail at the origin, at least two of them form a nonobtuse angle, which in turn implies the desired result.
Problem 76 [IMO 1996 short list]
Let a, b and c be positive real numbers such that abc = 1. Prove that
ca
a5+b5+ab + b5+c5+be + c5+a5+ca C
1.
Solution 76
We have
a5 + b5 > a2 b2 (a + b),
because
(a3
 b3)(a2  b2) > 0,
ab
with equality if and only if a = b. Hence
ab
a5 + b5 + ab
a2b2 (a + b)
1
+ ab
ab(a + b) + 1
abc
ab(a + b + c)
c
a+b+c
Likewise,
be
a
b5+c5+bc  a + b + c
4. Solutions to Advanced Problems
and
91
ca
b
c5+a5+ca  a+b+c'
Adding the last three inequalities leads to the desired result. Equality holds if and only if a = b = c = 1.
Comment:
Please compare the solution to this problem with the
second solution of problem 13 in this chapter.
Problem 77 [CzechSlovak match 1997]
Find all functions f : R > ]l8 such that the equality
f(f(x) + y) = f(x2  y) + 4f(x)y
holds for all pairs of real numbers (x, y).
Solution 77
Clearly, f (x) = x2 satisfies the functional equation. Now assume that there is a nonzero value a such that f (a)
Let y = x
z_
a2.
2f (x) in the functional equation to find that
)
f
(f (x
2
+x2) = f (f(x)+x2) +2f(x)(xz f(x))
or 0 = 2f (x)(x2  f (x)). Thus, for each x, either f (x) = 0 or f (x) = x2. In both cases, f (0) = 0. Setting x = a, it follows from above that either f (a) = 0 or f (a) = 0 or f (a) = a2. The latter is false, so f (a) = 0. Now, let x = 0 and then x = a in the functional equation to find that
f (y) = f (y),
and so
f (y) = f (a2  y)
f (y) = f (y) = f (a2 + y); that is, the function is periodic with nonzero period a2. Let y = a2 in the original functional equation to obtain
f (f (x)) = f (f (x) + a2) = f (x2  a2) + 4a2f (x) = f (x2) + 4a2f (x)
However, putting y = 0 in the functional equation gives f (f (x)) = f (x2) for all x.
yi) x2 + y2 x2 + y2 = 3.1 = 3y. Since a is nonzero. 1) or (x. either f(x) = x2 or f(x) = 0. Therefore. 4a2f(X) = 0 for all x. Solutions to Advanced Problems Thus.y)y + (x + 3y)x = 3y. Then 1_ xyi z x2 + y2 Thus the last equation becomes z+3i=3 z or z23z+(3i)=0.92 4. Hence Z= 3f 3+4i 2 = 3±(1+2a) 2 that is. Problem 78 [Kvant] Solve the system of equations: 3xy x+ x2 + y2 =3 x+3y yx2+y2=0.  i(x . It follows that y 0 and 3y + 1 2y . Solution 78.y) +(x + 3y)i 3 x2 y2 or x+ya+3(xyi) . and adding up yields 2xy + (3x . (x. y) Solution 78. x2 y2 or 2xy . f (x) = 0 for all x. Alternative 1 Multiplying the second equation by i and adding it to the first equation yields x+yi+ (3x . Alternative 2 Multiplying the first equation by y. y) = (2. the second by x. Let z = x + yi.
1) and (1. Problem 79 [China 1995] Mr. +_xs +_x2t1 where s and 2t . If Mr. They fill in real numbers to empty spaces in turn.1 even spaces. We say a blank space is odd (even) if it is the coefficient of an odd (even) power of x. Mr. Taf will fill in arbitrary real numbers into one of the remaining even spaces. who has a winning strategy? Solution 79 Mr.4. Fat and Mr.1 are distinct positive integers and q(x) is a fixed We claim that there is a real number a such that p(x) = q(x) + axs + x 2t1 will always have a real root regardless of the coefficient of x2ti Then Mr. that is. Taf can simply fill in a in front of xs and win the game. Taf wins. the given polynomial becomes p(x) = q(x) polynomial. otherwise. if there are any.2y 1 12 + y2  13 2y 1 I . Taf has a winning strategy.3y = 0. Fat goes first. Fat wins. It follows that y2 = 1 and that the solutions to the system are (2. or 4y43y21=0.3 plays. Solutions to Advanced Problems 93 Substituting this into the second equation of the given system gives y (. . Since there are only n . Taf play a game with a polynomial of degree at least 4: x2n + _x2n1 + _x2n2 + . 1).. If the resulting polynomial has no real root.. there will be at least one odd space left after 2n . Mr. First Mr. + x + 1.
1..b] 22t1 q(2) + q(1) + a[22t+1 + Since s 54 2t . Solution 80 The statement is true if and only if k > 4. Let b be the coefficient of that 1 22t_1 p(2) + p(1) 11 22t 1 = = q(2) + 2s2t+la + b + [q(1) + (1)sa . since F(k + 1) . Note first that F(k + 1) = F(0). x2t1 Problem 80 [IMO 1997 short list] Find all positive integers k for which the following statement is true: if F(x) is a polynomial with integer coefficients satisfying the condition 0<F(c)<k for c=0. which implies that there is a real root of p(x) in between 1 and 2..1)G(x)..) and p(2) have different signs. Thus a=1 2s2t+1 + (_1)s is well defined such that a is independent of b and 22t_1 p(2) + p(1) = 0.. 2s2t+1 + (_1)s O 0.1. It follows that either p(1) = p(2) = 0 or p(1. Note Now we prove our claim. .. then F(0) = F(1) F(k + 1).k+1. Solutions to Advanced Problems x2t1 in p(x).1.94 4. p(x) has a real root regardless of the coefficient of as claimed. Consider any polynomial F(x) with integer coefficients satisfying the inequality 0 < F(c) < k for each c E 10..F(0) = x(x . We start by proving that it does hold for each k > 4. Our proof is thus complete. In either case. .F(0) is a multiple of k + 1 not exceeding k in absolute value.k . k + 1}. Hence F(x) . .
F(0)j = (k .2)! . if F(x) satisfies the given condition then 0 and k + 1 are roots of F(x) and F(0) for any k > 1. . (1) The equality c(k + 1 . But the proof also provides information for the smaller values of k as well. as it is equivalent to (c . IH(c)j.. Thus F(x) . 3..1)H(x).F(O) I = c(k + 1 .x)(x .2)! > 1.2)(x . Since G(c) is an integer.(x . G(c) = 0. it is not hard to find the following counterexamples: F(x) = x(2 . . Taking this into account. for k = 3. . (k .c) > k holds for each c {2. . We established that the statement in the question holds for any k > 4. and for any c in this set. . . 3. and if k > 3 then 2 must also be a root of F(x) .4. Fork > 4.. k > IF(c) . To complete the proof of our claim.1} is not empty if k > 3. (1) implies that JG(c)j < 1. k .k + 1)(x .x) F(x) = x(4 . Hence H(c) = 0. (2) where H(x) is a polynomial with integer coefficients.. k . it remains to show that H(1) _ H(k) = 0. (2) implies that k > IF(c) ..3).F(0) = x(x .1)(k . for k = 2.. k}. Note that the set {2.. 2.F(0).2)2 for k = 1. Consequently. More exactly.c) > 0..c)IG(c)I for each c E { 1.. Note that for c = 1 and c = k.k .1}. k .x) F(x) = x(3 . Solutions to Advanced Problems 95 where G(x) is a polynomial with integer coefficients.
+1 .9F2n = 9F2n(F2n+2F2n2 .F2..2)F2n2 ..9F2n+2F2nF2n2 = 0.F2n = F2n2. . whence 3F2n . 2..F 22n) _ 9F2n.F3 . The desired result follows from 9F2n+2F2nF2n2 .F2n = F2n(3F2n2 .F3 .+2 2.Fn+2=Fn+i+F.2F2n = F2n1 .96 4. Solutions to Advanced Problems Problem 81 [Korean Mathematics Competition 2001] The Fibonacci sequence Fn is given by Fi=F2=1.F2n+2 .F4 = 1. Applying (1) twice gives F2n+2F2n2 = (3F2n .F2n2 = F2nF2n4 . Prove that 3 F2n  F2n3 +2 + F2n_2 9 3 .. Setting a = 3F2n.2 .2F2n for alln>2. Solution 81 Note that F2n+2 .F2n2 F2n  F6F2 . and c = F2n_2 in the algebraic identity a3+b3+c33abc=(a+b+c)(a2+b2+c2abbeca) gives 27F23. (nEN).3F2n = F2. b = F2n+2.F2n2 = 0 (1) for alln>2.F2n) .
or f(x)(u(y) . u(x) . We must show that u is of the form u(x) = a' for some a E ][8+. To see that these work. If a # 1. since u(0) = 1. y E R. First. take f (x) = x for a = 1.4.1) = f(y)(u(x) .u(0)) for all x.1. we obtain f (x) = f (x)u(0) + f (0) for all x E R. y E R. letting y = 0.1 = (a' .1 f(x) f(Y) for allxy00. this equation also holds for x = 0. Thus. u(0) 1 would imply f (x) = f (0)/(1 . y E R. u(x) = 1+Cf (x) for x 0 0. Now suppose u : R .1) for all x. y E R. f : R + R are functions for which f is strictly monotonic and f (x + y) = f (x)u(y) + f (y) for all x. . Solutions to Advanced Problems 97 Problem 82 [Romania 1998] Find all functions u : R * R for which there exists a strictly monotonic function f : R + R such that f(x + y) = f(x)u(y) + f(y) for all x. Solution 82 The solutions are u(x) = ax. It follows that there exists C E R such that u(x)1 _G f(x) for all x 0. That is. f (0) = 0. Thus. take f (x) = a' . a E R+.1 = f(x)u(y) + f(y) for all x.1)ay + ay . we have f(x)u(y) + f(y) = f(x + y) = f(x) + f(y)u(x). then f(x + y) = a"y . Then f (x) 0 0 for all x A 0.1 _ u(y) . Next. so we must have u(0) = 1 and f (0) = 0. which would contradict the fact that f is strictly monotonic.R.
. 2. Solutions to Advanced Problems If C = 0.+IznH = 1.. 22. Then 1= zkER. Z2. Since u(x) = 1 + C f (x) for all x. Prove that there exists a subset S of {z1.gEN. z2. Since u is monotonic and the rationals are dense in R.. a E R+. including the ray L. ZkEIZ2 zkE7Z3 By the Pigeonhole Principle. 180°. respectively. z } such that I2z zES 6 Solution 83. Alternative 1 Let fl. For i = 1. x E R. with the positive xaxis.i Izkl + E zkl + E Izkl. . observe 1+Cf(x+y) 1 +Cf (x)u(y) +Cf (y) u(y) + C f (x)UM u(x)u(y) for all x. then u(x) = 1 for all x... then u(n) = a" for all n E N. zn be complex numbers such that IZiI+IZ2I+. and u(p/q) = (u(p))1/1 = aplq for allpE7L.. . 3.sou(x)=ax for allxEQ. and we are done.. Problem 83 [China 1986] Let Z1.98 4. Let a = u(1) > 0. and u(x) _ 1/u(x)forallx. let Ri denote the region between Li and Li+1 (here P4 = f1).sou(x)>0forallxasu(0)=1. at least one of the above sums is not less than 1/3. . we have u(x) = ax for allxER. Otherwise. Thus all solutions are of the form u(x) = ax. u is strictly monotonic. and 300°. Thus u(nx) = u(x)" for all n E Z. y E R. . and Q3 be three rays from origin that form angles of 60°.
the lower bound can be further improved to 1/7f. Solutions to Advanced Problems 99 Say it's R3 (otherwise. 1 E Xk > 2 Zk ER3 zk ER3 zkl>2 1 36 1 1 Solution 83. Then 1 = C Iz11+Iz21+. zn} such that Ez zES 4 For 1 < k < n. Xk = IxkI > Izkl/2. Consequently. By symmetry.. Problem 84 [CzechSlovak Match 1998] A polynomial P(x) of degree n > 5 with integer coefficients and n distinct integer roots is given. Then for Zk E R3. we apply a rotation.4. 1: Zk zk ER3 as desired. . which does not effect the magnitude of a complex number). .+lznl (Ix11+Iy11)+(ix21+1y21)+. we may assume that 4 <_ Ixkl xk>0 Consequently. E Zk xk>O 1 4 Comment: Using advanced mathematics.+(Ixnl +Iynl) >IxkI+1: lxkI+1: lykl+1: lyklxk>0 xk<O Yk>0 Yk<O By the Pigeonhole Principle.. let Zk = xk + iyk.. at least one of the above sums is not less than 1/4. Let Zk = xk + iyk.. Alternative 2 We prove a stronger statement: there is subset S of {z1i z2... . Find all integer roots of P(P(x)) given that 0 is a root of P(x).
so P(k)I < Irnl.rn are integers.100 4.. that is. 2. b]. ri and IkI < Irnl. Let P(x) = a(x .r2 I .rn)I >. this is only possible if P(x) = (x + 2)(x + 1)x(x . a < b. a contradicLet a.rn)I = Ikllrn . Suppose. c be real numbers. on the contrary.. I k . We prove our claim by contradiction.1. Solutions to Advanced Problems Solution 84 The roots of P(x) are clearly integer roots of P(P(x)). < Irnl.. at most two of I k ..r3). For x E [a. Also note that P(k) = ri0 for some io.r4I equal .riI > 1 for all i. Then IP(k)I > 2Ik(k . IkI < Irnl.(x . Thus Ik(k . or at both endpoints.)I. so Ia(kr2).rl..1)I > allkr2llkr3llkr4I > 2.x) reaches its minimum value at an endpoint x = a or x = b. which implies that Irnl < 2. Since n > 5. a contra ...rn. 1. tion.rn). Since P(k) 54 0. ri = 0 < Ir2l < Ir3l < . It follows that Irnl > IP(k)I > 2Ik(k . where a. the function f(x) = x(c . 1 < IkI < Irnl .kI > IkI(Irnl kI) > Irnl 1. that P(P(k)) = 0 for some integer k such that P(k) 0.2(Irnl 1).rl)(x .2). we claim there are no other integer roots. IkI > rnl.1)(x ..r3I I k .. we must have I k .. b.(kr.rn)I > 2IkI > Irnl. But then it is impossible to have k diction. Now we consider the following two cases: 1.r2i. and P(k)j > 2I k(k . Since the ri are all distinct.r2) (X ..
Solutions to Advanced Problems 101 Thus our assumption was incorrect.. . Since xns are increasing for n > 1. Problem 85 [Belarus 19991 Two real sequences x1i x2.4. and the integer roots of P(P(x)) are exactly all the integer roots of P(x). V 1 + xn1' Thus 3xn_1 > xn.. XI = y1 = V . this means that Zn = xn_1 for all n > 1.. Thus. Xn Xn xnyn= = xn1 Zn Note that 1 +n. we have 2 2 xn_1 > x1 = 3 > 1 3' which implies that 2xn_1 > ity. are defined in the following 1 + xn. Solution 85. Alternative 2 Setting xn = cot On for 0 < On < 90° yields (Xn+1 On)= COt On + 1 + COt2 en = COt On + CSC On = cot 2 . Alternative 1 Let zn = 1/yn and note that the recursion for yn is equivalent to zn+1 = Zn + 1 + zn. .. Also note that z2 = f = xi i since the xis and zis satisfy the same recursion..1 > xn1 n_ Thus Xn > 2xn_1 and XnYn > 2.. which leads to the upper bound of the desired inequal Solution 85. and xn+1 = xn + yn Yn+1 = 1+ l+y2 for all n > 1. and y1i y2i way: . Prove that 2 < XnYn < 3 for all n > 1. which is the lower bound of the desired inequality.
And since for n > 1 we have Bn < 30°. For a positive real number c and a set S C_ IR.tan 2 Bn 2 . for every quadratic polynomial P(x).P(a). Problem 86 [China 1995] For a polynomial P(x). (a. What about cubic polynomials? ([a. for every polynomial P(x) with deg P < k. Solutions to Advanced Problems Since 01 = 30°. It follows that xnyn = I . the total difference of P(x) on red intervals is equal to that of P(x) on blue intervals. Similar calculation shows that yn = tan(2Bn) _ 2 tan 0n 1 . b). 1] into a finite number of intervals and color them red and blue alternately such that. We prove a more general result. . Lemma Let t be a positive real number. Prove that it is possible to dissect the interval [0. define the difference of P(x) on the interval [a. tang On is positive and xnyn > 2. let / P denote the difference of polynomial P on i.102 4. Solution 86 For an interval i. we have in general 0. = 2 0 1. b]) as P(b) . we can see the relationship 1 yn xn1 used in the first solution. b). 1 Comment: From the closed forms for xn and yn in the second solution. b] (a. 2kf] into a finite number of intervals and color them red and blue alternatively such that. and let k be a positive integer. let S + c denote the set obtained by shifting S in the positive direction by c. we also have tan2o n < so that xnyn < 3. It is always possible to dissect interval Ik = [0.tang On Since tan On 54 0. the total difference of P(x) on the red intervals is equal to that on the blue intervals.
and.4. the total difference of f on B' is n+1 equal to that of f on Rn+1 The only possible trouble left is that the colors in B'+1 U Rn+1 might not be alternating (which can happen at the end of the In and the beginning of In + 2n1). By the induction hypothesis. = 0. R. Suppose that the statement is true for k = n. For k = 1. we can just use intervals [0. It is easy to see that a linear or constant polynomial has the same difference on the two intervals. (If R'+1 and both contain the number 2n1.g(x). . But note that if intervals i1 = [a1i b1] and i2 = [b1. then Ai1f + 22f = 23f7 where i3 = [a1i c1]. for any polynomial f with deg f < n + 1. Solutions to Advanced Problems 103 Proof We induct on k. 21]. 1] and (2. the total differences of P on Rn is equal to that of P on B. Obh bEB. Orh. and Bn+1 = Bn U (Rn + 2n1). U Bn = In. Then deg h < n. for any polynomials P(x) with deg P < n. that number may be removed from one of them. where n is a positive integer. rEBn It follows that obf = bEBn+l rER'ri}1 where Rn+1 = Rn U (Bn + 2n1). there exists a set Rn of red disjoint intervals and a set Bn of blue disjoint intervals such that Rn f1 B. or =rER. c1] are in the same color.) It is clear that Bn+1 and R'+1 form a dissection of In+1 and. Define g(x) = f(x + 2n1) and h(x) = f(x) . that is. Now consider polynomial f (x) with deg f < n + 1. > rERn Abf + E Or9 _ E Arf + E Obg bEBn rER.
Fat can pick 0 first. Fat has a winning strategy. then Mr.+l rER.104 4. Fat and Mr. Taf chooses b = (mnp)2. obf = > orf. .+i This completes the induction and the proof of the lemma. Setting first f = a and then f = a in the lemma. Mr. In one move. Fat chooses a real number and Mr. bEB. Mr. for every polynomial f (x) with deg f < n + 1.. in Bn+1 URn+1. Taf are playing the following game. Solutions to Advanced Problems Thus. Who has a winning strategy? Solution 87 Mr. Fat then picks the number (mnp)2. Mr. Mr. Let the polynomial be x3 + axe + bx + c. If Mr. n. Thus. Fat will choose c = 0.. We consider the following cases: (a) Mr." Problem 87 [USSR 1990] Given a cubic equation x3+x2+x+_=0. Taf puts it in one of the empty spaces. and p are three positive integers such that m2 + n2 = p2. it is clear that the answer to each of the given questions is "yes. there exists a dissection In+1 = Bn+1 U Rn+1 such that. Fat wins the game if the final equation has three distinct integer roots. The given polynomial becomes x(x . we can simply put consecutive same color intervals into one bigger interval of the same color. Taf chooses a = 0.mnp) (x + mnp). where m. Mr. After three moves the game is over. yielding the polynomial equation x3+bx+c=0.
yielding the equation x3+ax2+c=0. The polynomial becomes (x .mp) [x + (m + 1)P1 [x + m(m + 1)p]. Fat will choose b = m2n2 .(m + 1)q] [x . The given polynomial becomes (x + m2)(x + n2)(x . Taf chooses b = 0. Fat can choose a=(m2+m+1)2. then Mr.m(m + 1)q]. Taf chooses a = m2(m + 1)2(m2 + in + 1)3. (b) Mr.p2m2. then Mr. Mr. Taf chooses c = (mnp)2. Fat can choose c = m8(m + 1)8(m2 + m + 1)6.n2p2 . where q=m2+m+1. where p = m2(m + 1)2(m2 +m+ 1)2. Solutions to Advanced Problems 105 If Mr. where m is an integer greater than 1. Taf chooses c=m2(m+1)2(m2+m+1)3. If Mr. Fat then picks the number m2(m+ 1)2(m2 +m+ 1)3. The polynomial becomes (x + mq) [x . .4. If Mr.p2). then Mr.
c 2 .21. .49.106 4.a) or x(x .. Taf could do: F 0 T a b F T b F 0 3600 " Roots 60.+f(A. 1.0.60 c " 4.. Fat and Mr. Prove that f is the zero function.1)(x . . for each of k = 1. a b 3.1) yc.) =0. n. j=1 In particular. Solution 88 We identify 1182 with the complex plane and let ( = e2. Fat needs only to pick two integers a and b such that ab(a . Then the condition is that for any z E C and any positive real t.9. The polynomial becomes either x(x . .0.27. we obtain f(z_(k+(')=0.25 8.. 8.b). An.rz/n.42 c . Mr.0 and a + b = 1.7 a 2 3 .9.. Then the problem reduces to problem 40 of the previous chapter. n f(z + W) = 0. 2 Problem 88 [Romania 1996] Let n > 2 be an integer and let f : 1[82 > R be a function such that for any regular ngon A1A2 .49 14.1)(b . Below is an example of what Mr.1 0.. .7 49 3 3 481 16..9. Taf chooses c = 0. j=1 . Our proof is complete. 42749. f(A1)+f(A2)+. Solutions to Advanced Problems (c) Mr.1)(x .
(ii) for every positive integer n. we have n n EEf(z(1(m)(k)=0. assume that d < p .. Alternative 1 For the sake of the contradiction.. hence is 0.k . the remainder upon division of f (n) by p is either 0 or 1. Solutions to Advanced Problems 107 Summing over k. f (k) p2 k=0 k!(1)pk (p .. S(f) := f (0) + f (1) + .k .2)! Setting x = p .(x .0 (mode).k + 1)(x .. Problem 89 [IMO 1997 short list] Let p be a prime number and let f (x) be a polynomial of degree d with integer coefficients such that: (i) f (0) = 0.1 gives p2 AP1) = k=0 f(k)(p . Thus f (z) = 0 for all z c C.4. ..1)(p  2).. m=1 k=1 For m = n the inner sum is n f (z). 1.2.. that is.. for other in. Prove that d > p . Then by Lagrange's interpolation formula the polynomial f (x) is determined by its values at 0.p + 2) k=0 k. (1) .. + f (p . p2 f(x) f(k)x. p .(x . Solution 89.(p .1).1.2.. the inner sum again runs over a regular polygon. f (1) = 1. .1) .k) (_1)p k k! E f (k) k=0 (1)p It follows that (1)kkt ( J)pkk! J p2 f (k) k=0 (mod p).
i0 where Si = k=0 (mod p) for all i = 0. where j denotes the number of those k E {0. 1. . The statement is true for i = 0 as So = p. p2 S(f) = i=o aiSi .2.0 (mod p). and our proof is complete. (ii) implies that S(f) . But (i) implies that 1 < 7 < p . Solutions to Advanced Problems On the other hand. it follows that Si .0 p .0 (mod p). + alx + a0. This completes the induction and the proof of the claim.7 (mod p). We use strong induction on i to prove our claim. Then P1 p1 p2 p2 P1 p2 S(f) _ k=o P1 1 a k=0 i=0 i=0 k=0 aiSi... and let f (x) = ap_2xp2 + . Assume that d < p . 1..108 4. we approach the problem indirectly. which contradicts M.2. . Therefore.Si . Solution 89. Note that 0_pi+i =Eki+1 Eki+1 _E[(k+1)i+iki+i] k=1 p p1 p1 k=0 k=0 E(1)k3 =(i+1)S+ k=0i=0 (i±1)5 0 i (i + 1)Si (mod p) Since 0 < i + 1 < p. p . . Now suppose that So . Alternative 2 Again. . The rest is the same as in the first solution.1} for which f (k) . Thus our original assumption was wrong. .1 (mod p)..2. So S(f) A 0 (mod p).0 (mod p) for some 1 < i < We claim that Si .1. p .Si1 ...
a.. 2..4. .<1. Alternative 1 W e prove a stronger statement: For k = 1 . Solutions to Advanced Problems 109 Problem 90 Let n be a given positive integer.(n . 2.1.1 1.1 <a.. for k = n . Prove that .. n Solution 90. with ao = 2 and z ak_1 ak = aki + n . For k = 1. In particular. Consider the sequence ao. a1. it is easy to check that ai Suppose that _1 2 1 _ 2n+1 4n + 4n n < 2n . n. Thus our induction step is complete. a y = ak+i < 2n . n. Then ak ak+i Ti k' (n + ak) Cn + 2nn k 2n 1 k < as 2nk1' n(2n .1 n ak < 2n for some positive integer k < n. . . for k = 1.1) . . We first prove the upper bound. n+1 n (1) 2nk+2 <ak < 2nk We use induction to prove both inequalities. 1..k)2 n (2nk+1)(2nk1)=(2nk)z1 <(2nk)2.k + 1) (2n ..
.k + 1 n+1 (n + 1)2 (2nk+1)(2nk+2) +n(2nk+2)2 n+1 (n+l 2nk+2)2 n _ 2nk+21 2nk+1 1 2nk+2)2  n+1 1 n . _n+1=In+2 >1n n+2 Solution 90.n. Then It follows that n+1 ak+1 . Alternative 2 Rewriting the given condition as 1 _ 1 n ak_1 ak1(n + ak1) 1 1 ak ak1 ak1 + n + ak1 n 1 1 yields 1 ak_1 ak n+ak_i (2) for k = 1.2nk+1 ) 1 > 0. .110 4. Solutions to Advanced Problems as desired.. This complete the induction step. For k = 1. for n = k ... Now we prove the upper bound.2n . It is clear that aks are increasing. it is easy to check that a1 _ 2n+1 4n n+1 > 2n+ 1 Suppose that n+1 ak> 2nk+2' for some positive integer k < n.. Thus 1 an > an1 > . we obtain n+1 anak+1> 2n(n1)+1 as desired. In particular.1.2. > ao = 2..
n.. an < 1. . not all zero. Telescoping sum gives 1 1 n n + 1 ao or 1 1 an n n+2 an < ao n+l 1 1 n+1' 1 that is.4..aixni positive real root R... . 2. an ao that is. and. Then (2) implies ak_1 ak n+ak_i > n+ for k = 1. . .n. (b) Let A = > 1 aj and B= Prove that AA < RB. Since an < 1. an > n+1 _ n+2 n+2 > l n' which is the desired lower bound.an_ix . Telescoping summation gives 1 ao or 1 1 . a2.. 2 = ao < ak < an < 1 for k=1.. 2. which gives the desired upper bound.1 <1 an >1=21=1. n... Problem 91 [IMO 1996 short list] Let a1.. . (a) Prove that xn .. Solutions to Advanced Problems 111 Thus (2) implies that 1 1 1 ak1 ak n for k = 1. . since aks are increasing. .2. an be nonnegative real numbers. .an = 0 has precisely one 1 jai.
Comment: Please compare the solution of (a) with that of the problem 15 in the last chapter. y) with real coefficients such that P(x.In x is a convex function on the interval (0. y) > 0 for all real numbers x and y. It follows that lnA+jlnR) > 0 j=1 or n n 1: cj In A < E jcj In R.+ a2 x an 2+. Problem 92 Prove that there exists a polynomial P(x. oo). Solutions to Advanced Problems Solution 91 (a) Consider the function f(x)= 1. y) > 0 for all real numbers x and y. Hence there there exists a unique positive real root R of the given polynomial. that is. Note that f decreases from oo to 0 as x increases from 0 to oo. (b) Let cj = aj/A. Solution 92 We claim that P(x. c3 l 1nRj n 1n l =ln(f(R))=0. j=1 j=1 Substituting c. we obtain the desired inequality.. Then cjs are nonnegative and E cj = 1.1)x2y2 + 1 27 is a polynomial satisfying the given conditions. which cannot be written as the sum of squares of polynomials with real coefficients. y) = (x2 + y2 . First we prove that P(x.+Xn. unique real number R such that f (R) = 1.7 = aj/A. Since ..112 4. by Jensen's inequality. .
We are left to prove that P(x.1 < 0. in P(x. Thus. if x2 + y2 . of terms x6 and y6 gives or Ai = Di = 0 for all i. Y) = i=1 Q. y)2.27* 1 27' (x2 +Y 2 1)x2y2 > It follows that P(x. Then.4. Qi(x.y) = Atix3 + Bix2y + Cxy2 + Diy3 +Eix2 + Fixy + Giy2 + Hix + Iiy + JJ. Comparing the coefficients. y) > 0. then applying the AMGM inequality gives (1x2y2)x2y2 < or 1x2y2+x2+y2 3 1 (  3 ) . comparing those of x4 and y4 gives n n Ei i=1 i=1 Gi =0. Since deg P = 6.1 > 0. or Ei = Gi = 0 for all i. comparing those of x2 and y2 gives n I2=0. then it is clear that P(x. . y) > 0. y) = Bix2y + Cixy2 + Fixy + Ji. For the sake of contradiction. deg Qi < 3. y) and En 1 Qi(x. Solutions to Advanced Problems 113 If x2 + y2 . (X. y) cannot be written as the sum of squares of polynomials with real coefficients. Thus Qi(x. y)2. or Hi=12=0 for all i. assume that n P(x. Next.
114
4. Solutions to Advanced Problems
But, finally, comparing the coefficients of the term x2y2, we have
n
F2 _ 1
which is impossible for real numbers F. Thus our assumption is wrong, and our proof is complete.
Problem 93 [IMO 1996 short list]
For each positive integer n, show that there exists a positive integer k such that
k = .f(x)(x + 1)2n +
g(x)(x2n + 1)
for some polynomials f, g with integer coefficients, and find the smallest such k as a function of n.
Solution 93
First we show that such a k exists. Note that x + 1 divides 1  x2n. Then for some polynomial a(x) with
integer coefficients, we have
(1 + x)a(x) = 1  x2n = 2  (1 + x2n)
or
2 = (1 + x)a(x) + (1 +
x2n).
Raising both sides to the (2n) th power, we obtain
22n = (1 + x)2n(a(x))2n + (1 + x2n)b(x),
where b(x) is a polynomial with integer coefficients.
This shows that a k satisfying the condition of the problem exists. Let ko be the minimum such k. Let 2n = 2' q, where r is a positive integer and q is an odd integer. We claim that ko = 29. First we prove that 29 divides ko. Let t = 2'. Note that x2n + 1 = (xt + 1)Q(x), where
Q(x) = xt(q1)
The roots of xt + 1 are
cos

xt(q2) +
...  xt + 1.
C (2m  1)7rl
J + i sin
((2m 1=
t
J,
m = 1, 2, ... , t;
4. Solutions to Advanced Problems
115
that is,
R(x) = xt + 1 = (x  wl)(x  w2)...(x  wt).
Let f (x) and g(x) be polynomials with integer coefficients such that
ko
= f(x)(x + 1)2n+ g(x)(x2n + 1)
= f (x)(x + 1)2n + g(x)Q(x)(xt + 1).
It follows that
f (w,,,)(wm, + 1)'ti = ko,
1 < m < t.
(1)
Since r is positive, t is even. So
2=R(1) =
Since f (wl) f (w2) .
(1+wi)(1+w2)...(1+wt).
f (Wt) is a symmetric polynomial in w1i w2, ... , wt with integer coefficients, it can be expressed as a polynomial with integer
coefficients in the elementary symmetric functions in W1, W2....
and therefore
F =
f(wl)f(w2)...f(wt)
I Wt
is an integer. Taking the product over m = 1, 2, ... , t, (1) gives 22n F = ko or 22' 'gF = k2' . It follows that 2g divides ko. It now suffices to prove that ko < 2g.
Note that Q(1) = 1.
It follows that
Q(x) = (x + 1)c(x) + 1,
where c(x) is a polynomial with integer coefficients.
Hence
(x + 1)2",(c(x))2, = (Q(x)  1)2n = Q(x)d(x) + 1, for some polynomial d(x) with integer coefficients. Also observe that, for any fixed m,
WM
{2j1
(2)
: j = 1 2, ... , t} = 1W1, W27 ... 7Wt
Thus
(1 + W,,,,)(1 + W3,) ... (1 +w2, t1) = R(1) = 2,
and writing
(1+W,,,,)(1Wm.+wn...
+w2ri2),
116
4. Solutions to Advanced Problems
we find that for some polynomial h(x), independent of m, with integer coefficients such that
(1 +w,)th(w,) = 2.
But then (x + 1)h(x)  2 is divisible by xt + 1 and hence we can write
(x + 1)h(x) = 2 + (xt + 1)u(x),
for some polynomial u(x) with integer coefficients. Raising both sides to the power q we obtain
(x + 1)2n(h(x))q = 2q + (xt + 1)v(x),
where v(x) is a polynomial with integer coefficients. Using (2) and (3) we obtain
(x +
1)2n(c(x))2n(xt
(3)
+ 1)v(x)
= Q(x)d(x)(xt + 1)v(x) + (xt + 1)v(x)
= Q(x)d(x)(xt + 1)v(x) + (x + 1)2n(h(x))q  2q,
that is,
gl(x)(x2n + 1),
21 = fl(x)(x + 1)2n +
where fl (x) and gl (x) are polynomials with integer coefficients. Hence ko < 2q, as desired. Our proof is thus complete.
Problem 94 [USAMO 1998 proposal, Kiran Kedlaya]
Let x be a positive real number.
(a) Prove that
°O
n(x +1) (x+n)x'
(b) Prove that
00
(n  1)!
_
1
(n  1)!
n(x + 1)...(x +n)
00
1 (x + k) 2
n=1
k=1
(x + n)' f(x) _ n= Then.1)! + 1). (x + n) _ (x + (n . x In particular.(x + n) _ Note that x 1 1 n(x+n) It follows that n!x n x+n n(x + .1)! (x + n) .f (x + k)]....1) .1) .1) 1 X 1 E (x + 1) (n ...f(x) _ 00 1 (n . Solutions to Advanced Problems 117 Solution 94 We use infinite telescoping sums to solve the problem. k=1 (1) On the other hand. f (x) converges to 0 as x approaches oo.. the result in (a) gives 00 f(x .. by (a). we have to show that E °O n!x n(x + 1). so we can write f as an infinite telescoping series f (x) _ )[f (x + k . f (x) < 1. (a) Equivalently.1)! n(x + 1). (b) Let 00 (n .4.1)! 1) n! (x + (x + n)' and this telescoping summation yields the desired result..(x + n .
a1. Problem 95 [Romania 1996] Let n > 3 be an integer. zo) in nonzero integers.118 4.. Solutions to Advanced Problems Substituting the last equation to (1) gives f(x) = as desired. and let XCS={1. 3) in X such that the system alx+bly+clz = 0 a2x + b2y + c2z = 0 a3x+b3y+c3z = 0 has a solution (xo. bi. ... The range of f.. c2 (i = 1. ..n3} be a set of 3n2 elements.bl is a solution in nonzero integers. b2. . cx) (i = 1. in which case x = b1 . 2. 3) map to the same pair.. some three triples (a2.b..b).c) = (b ..c1i y = c1 .. 2. is contained in the subset of S x S of pairs whose sum is at most n3. c . {x2n2+1.a.. and put X1 = {xl. on the other hand. xn2 }. X2 = {xn2+1 . . Prove that one can find nine distinct numbers a2. yo. The domain of f contains n6 elements.x3n2}. x2n2 }. Solution 95 Label the elements of X in increasing order x1 < . X3 = Define the function f : X1 X X2 X X3 + S x S as follows: f(a... < X3n2.. a set of cardinality n31 k=1 1= n3(n3 ..1) 2 ns 2 By the Pigeonhole Principle.2. z = a1 . .
+ 1 xn Solution 96 By symmetry. It follows that xixj > 1. x2i Suppose that .. and. We have the Lemma For l < i < j < n. . we may assume that xl < x2 < following lemma. < xn. Solutions to Advanced Problems 119 Note that ai cannot equal bj since Xl and X2 are disjoint.1+xj Proof Since n > 3. we have 1 1 1> or 1+xi + l+xj _ 2+xi+xj (1+xi)(1+xi) 1+xi+xj+xixj > 2+xi+xj. since n 1 VT > xj = 1.. 1+xi . = 1. Hence the nine numbers chosen are indeed distinct. xn be positive real numbers. cl) and (a2. b2. bl. and that al = a2 implies that the triples (al. Thus xi xj 1 + xj ( xi(1 + xj)  xj(1 + xi) 1 + xi (1 + xi) (1 + xj) xi  x3)(1  xixj) (1 + xi)(1 + xi) > 0. a contradiction. Prove that xl+ x2+ + xn>(n1) 1 xl + 1 x2 +. c2) are identical.4. Problem 96 [Xuanguo Huang] Let n > 3 be an integer and let Xi.
. By the lemma..> xn x1 > 1+x11+x2_ _1+xn and. > 1 x2 xn' it follows by the Chebyshev Inequality n 1 z=1 VT i=1 xi < 1 + xi n xi 1 i=1 xi 1 + xi i=1 1+xi = 1. Solutions to Advanced Problems as desired. we have x2 >. (1) By the CauchySchwartz Inequality. . we have xi i=1 1 + xi x=1 or 1 + xi "/x n 1 n2 n xi i=1 1 n + xi u xi '=1 + ti=1 xx >n2.. (2) Multiplying by on both sides of (2) and applying (1) gives n n x n > 1 Z which in turn implies the desired inequality.120 4.. since 1 1 x1 > .
+ n 1 Yi . . we may also assume that s1 < s2 < X2 > . yn_1 be the roots of Q.Xi + 1 Yix2 + 1 +. For the sake of contradiction.xk. By symmetry. x1 > Let sk = y1 .X2 Yi . for k = 1.x2). xj =mins si i<j i<j i#j Since P has no double roots... Y2.yjI = y2Yi < sn. . n. ( 1 1 xx1 xx2 nlyi .. setting i = 1 and i = 2 gives _ k=1 Sk  1 =0. > xn. it shares none with Q. otherwise...e. =0. Then P(yi) or 1 1 (1) yi . assume that d< minlxixjl =minx.xn) and Q(x) = P(x) Let Y1. Solutions to Advanced Problems 121 Problem 97 Let x1.(x .+ 1 Yi 'xn =Q(yl)=0.x1)(x .... we may assume that d i:xj nlya . be distinct real numbers. Define the polynomials P(x) = (x .. ... we have 1 1 Sk +d Sk . .X1 Yi .yjI L) x . (2) Sk + d k=1 We claim that there is a k such that Sk(Sk + d) < 0. ... x2.4. 2.xn . Show that inlxix31 < Solution 97 By symmetry.xn In particular. +.. i. x.
Therefore. that is. sk < 0 < sk+d. .. we obtain sk + d < Sk+j. suppose that S1 < . < Si < Si+1 < . nj k=1 Sk+j or nj k=1 Sk 1 + d' 1 (3) n nj < k=j+1 sk k1 sk + d 1 Also note that E 1 <0< E k=1 Sk k=nj+1 Sk + d n (4) Adding (3) and (4) yields n 1 k=1 Sk k=1 Sk +d which contradicts (2). Thus our assumption is wrong and our proof is complete. In fact. Then Sk+j > 0 if and only if k > i + 1. 2. A simple but critical fact is that sk + d and Sk+j have the same sign. and.. . < Sni then s1+d< <si+d<0<si+1+d< <Sn+d. n .. we obtain 1 1 Sk + d Sk+j for all k = 1. since Sk + d and Sk+j have the same sign.122 4. which in turn implies that n n 1 k=1 Sk +d k=1 Sk which contradicts (2). < Si+j < 0 < Si+j+l < . Solutions to Advanced Problems for all k. From (1). Let j be the number of ks such that sk (sk+d) < 0..j.. that is Sk + d > 0..
x)2' +1 cannot be written as the product of two nonconstant polynomials with Solution 98 Note that f(x) = g(h(x)). we can write f (x) = A(x)B(x) where A and B have degree 2n.B(x) Thus. and ( . bo are odd and all the other coefficients then a2. Since g(y+1) = (y+1)2 + 1 =yen + k=1 (2m)k) +2..(x2 + x + 1)2n (mod 2). Then g(h(r)) = f (r) = 0. so deg p > deg(Q(r)/Q) > deg(Q(s)/Q) = deg g = 2n. Next. by Eisenstein's criterion. Thus every factor of f has degree at least 2n. so s := h(r) is a root of g. b2. a2n1. we have Q(s) C Q(r). if we write (x2 + x + 1)2 ' x2 + x2 1 + 1 (mod 2). by unique factorization we must A(x) . Therefore. Since x2 + x + 1 is irreducible in Z2 [x]. + ao.. A(x) = a2 B(x) = x2" + b2.. g is irreducible. and let r be a root of p.1. Since s = r2 + r E Q(r). where h(x) = x2 + x and g(y) = y2" + 1. . +. Now let p be a nonconstant factor of f.x2n . are even.) is even for 1 < k < 2n . we may assume without loss of generality .. + bo.. if f is reducible. Since f is monic.. observe that f(x) = (x2+x)2"+1 x2ii}l + have x2n + 1 . Solutions to Advanced Problems 123 Problem 98 [Romania 1998] Show that for any positive integer n. the polynomial P X) = (x2 + integer coefficients.4. ao.
Problem 99 [Iran 1998] Let fl. . Prove that there exist c1i c2. f2. a2i a3 E R. f3 : R * R be functions such that aifi + a2f2 +a3f3 is monotonic for all ai. t be two real numbers such that f (s) f (t). so ([x2n+2n1] + [X2'']) (f(x)) =2 (mod 4). ([x2n+2"'] + [X2'' ])(g(x)h(x)) 2i1 2" E a. such that Cifl(x) + C2f2(x) + c3f3(x) = 0 for all xER. bo > 0 as f has no real roots. Alternative 1 We establish the following lemma. Therefore. Hence f is irreducible.b2n+2n1 =2n1 1 + E aib2n1i i=o +a2n1b2n + aob2n1 +a2n1bo 2(a2n1 + b2n1) . aobo = f (0) = 1. but ao > 0. Solutions to Advanced Problems that a2n = b2n = 1.0 as a2n1 + But is even. a contradiction. g : R > R be functions such that f is nonconstant and a f + bg is monotonic for all a. Then there exists c E R such that g .124 4. Solution 99. Proof Let s.c f is a constant function. so ao = bo = 1. b E R. Lemma: Let f. (mod 4) n ([x2n+2"'] n + [x2n 1])(f(x)) = ( 22 _1 =2 22 _1 _ 11) 1 and (2?n. 11) is odd by Lucas's theorem. c3 E R. also. not all zero.
If fl. Since f (s) . which is impossible. Then hl is monotonic. on the contrary. Since f (xi) 0 f (X2). Then r = h(xi) = h(x2) and the monotonicity of h1 = g . Suppose.d1 f.dl. But hi(s) . at least one of f (xi) f (X3) and f (X2) 0 f (X3) is true. Solutions to Advanced Problems Let 125 g(s) . depends only on the sign of c . Let C 9(x1) . f3 are all constant functions.d1. Therefore our assumption is false and h is a constant function.f(t)) = (f(s) .E r.g(t) f(s) .d1). We claim that h = g . . So there exists some d1 such that h1 is both strictly increasing and decreasing.cf. f2. Without loss of generality.9(x3) f(xi) f(x3)  Then the monotonicity of h1 also depends only on the sign of c' . Now we prove our main result.g(t) . the result is trivial. there exist x1i x2 E R such that f (x1) f (x2).f (t) 0 is fixed.dl.d1 0 c' .4. the monotonicity of h1 depends only on the sign of u .f(t) Let hl = g .f(t))(u .9(x2) f(xl) .di(f(s) .f(x3) hence c . Since f is nonconstant.f(x2) and h = g .d1. Since h(x3) # r = h(xi). that there exists x3 E R such that h(x3) . suppose that f (xi) 0 f(X3) Let . Without loss of generality.d1f for some dl E R. for each d1. c 54 9(xi) . We prove our claim by contradiction.9(x3) f(xi) . C 9(XI) .c f is a constant function. suppose that f1 is nonconstant.hi(t) = g(s) .
i=1 and the function cifi+c2f2+c3f3 is then not monotonic. So suppose the v(x) span all of R3. . 1. we apply the lemma to f1 and f3. We have (c'dcd')fl+d'f2df3 = (c'dcd')fl+d'(cf1+d)d(c fl+d') = 0. Then there exist x1 < x2 < X3 E R such that v(x1). we can find a vector (Cl.126 4. we apply the lemma to f1 and f2. and its columns also span R3. d' are constant. and then c1 fl (X) + c2 f2 (X) + c3 f3 (X) = 0 for all x R.cd'.f2(x). c2i C3 such that 3 Ci(ff. 0). d'. so f3 = c' fl + d'.d) and we are done. v(x3) are linearly independent.(x1).c3) = (c'dcd'. c3) orthogonal to that subspace. But then A is invertible. so f2 = cf1 +d. 0. d) j4 (0. This means we can find c1. then let (c1ic2. and so the 3 x 3 matrix A with Ai3 = fj(xi) has linearly independent rows. v(x2). Alternative 2 Define the vector v(x) = (f1(x).f3(x)) forxeR. c'. 0). If (c'd . Here c. Otherwise. fi(x2). Solutions to Advanced Problems For a3 = 0. Solution 99. Then the problem is again trivial. for a2 = 0.d'. d = d' = 0 and f2i f3 are constant multiples of fl. fi(x3)) = (0. d. If the v(x) span a proper subspace of 1183. a contradiction. c2.
Ys) 0) =Qk(Y1. we say a nonnegative integer k is bad for n if k = 2n . then y1i y2.2j for some nonnegative integer j. pl(x1) = xl is not even and k = 1 is bad for n = 1 as k=1=212°=2n2°. x2. x1 + x2 and p1 = yl + Y2 + Y3 = 2x1 + 2x2i P2 = Y1Y2 + Y2Y3 + Y3Y1 = xi + x2 + 3x1x2.. ... For any fixed positive integer n. ..Y2.. .. if n = 2.. y2. . . we say Pk is not even.. facts: 1.ys). ..4. P3 = YiY Y3 = XiX2 + xlx2 Solution 100 We say a polynomial pk is even if every coefficient of pk is even. xn+l) Let ok(y1iY2.."'.ys) = i+j=k 3. Let pk(xl. ys) be the kth elementary symmetric polynomial. (x + yq ) ik k 1: r=O sl .Y2. o"i yi.yr)Qj(yr+l... Qk(yl.ys)]i 9k(x+y1... xn) is not even if and only if k is bad for n... be variables..YS1 ys2 ... Suppose that the claim is true for a certain n. Richard Stong] Let x1i x2. ."'.. Otherwise. . Solutions to Advanced Problems 127 Problem 100 [USAMO 1999 proposal.. . We have the following useful.. y2^_1 be the sums of nonempty subsets of xi. For n = 1.. We now consider pk (x1i X2. y3 are x1. . For all1<r<s.. Srxkr Al . . For which k and n is every coefficient of pk (as a polynomial in xl. x. x2i . 2.x+y2. xn) be the kth elementary symmetric polynomial in the yj (the sum of every productof k distinct yi's).. and let y1.. xn) even? For example. but easy to prove. .x+Ys) T. .... (x + yi l) (x + yi 2) . Qk(y1.. Srl 1: S1<32< <S. We will show by induction on n that pk(xl.
2". . pk(x1.. xn)Pj (x1. kisbadforn+1: . .. x2.. For such r.x2. xl + xn+1. By the induction hypothesis. note that jr \jr/ 2t is even unless j .. . xn)x 2t .... every term appears twice except the term x2.. .. .... taking coefficients modulo 2.xn) i+j=k Qj (xn+1..r Ik r0r(y1.. x2i xn+l) is even unless k = 2n+1 . . ... By the induction hypothesis.xn+1) [pi(xl. that isk=2n+l2" Pk/2(x1) for k even.. x2. this term is even unless k/2 = 2n ...e. . xn)p2^2t (x1.. x2 xn) is even un less r = 2" .. Therefore.. Xn) i+j=k n + t=0 pk2^ (xl.r = 0 or j ..2t..r = 2t. Solutions to Advanced Problems /S . i. x2. x2.ys) x kr .2v+1 It follows that Pk (XI..128 k 4... x2. that is k = 2n+1 . k2n=2n2" forsome0<u<n. for some 0 < t < n.2' for some 0<w<n+1. .xn)2. xn)pr(x1... the terms in the first sum are even unless In the second sum.. every term of pr(xl. By the induction hypothesis. .. xn)xn+1' . x1 + x2 + .. + xn+1)1 E i+j=k r=0 (2n r r Pi(xl. xn+1 pi (x1. for some 0 < v < n. . r=0 Hence pk(xl..
x2.a2)... 2} is a group of numbers satisfying the conditions given in the problem. . Solution 101 We show that {a1. Solutions to Advanced Problems 129 Furthermore.alo) = (x + al)(x + a2). .. a2..(x . that is. then g(x2) = 0 has no real solutions..4. Our proof is complete. .. both ul and u2 are negative. .. alo} _ {7... where g(u) = 2[((7+6+.. ' . xn+1) occur for different powers of xn+1 Therefore. .+3)U2+ If g(u) = has no real solutions..) (x .. . then U1 +U2 < 0 and ulu2 > 0. the condition that k is bad for n + 1 is also sufficient for pk(x1. xn+1) to be odd... alo such that the equation (x . x2i . a2i . Our induction is complete. note that the odd coefficients in Pk (x1.a. .(x + alo) has exactly 5 different real roots. 6.1)x(x + 1)(x + 2)g(x2) = 0. It follows again that g(x2) = 0 has no real solutions. The given equality becomes (x .2)(x . If ul and u2 are real solutions of g(u) = 0. Problem 101 [Russia 2000] Prove that there exist 10 distinct real numbers a1..
.
1 (xl+x2+ +xn)(yl+y2+ +yn) < xlyl+x2y2+ +xnyn... n. . .. xn and y1.+a...... + a2b2 + ..GLOSSARY ArithmeticGeometric Mean Inequality (AMGM Inequality) If a1. x2 ... an are n nonnegative numbers. Binomial Coefficient The coefficient of xk in the expansion of (x + 1)n is n _ n! k) CauchySchwarz Inequality k!(n . Chebyshev Inequality 1. .. ..+a2+. . < yn.... + anbn)2 with equality if and only if ai and bi are proportional. Let x1.. bn (al + a2 + .a. a2.. a2. 2. yn be two sequences of real num bers. . i = 1. b2. . .. . + an)(bi + b2 + _ + bn) > (alb.. such that x1 < x2 <_ Then <_ xn and yl < Y2 < . xn and y1. then 1(a.k)! F o r any real numbers al. an.) = an. . . Let x1i x2 .. . y2... y2. 2.) n with equality if and only if a1 = a2 = (ala2.. and b1. such that x1 > x2 >_ Then (X > xn and yi > Y2 > > yn . yn be two sequences of real num bers...
2AB AC cos A.. . A2.. 1. b]. and let yo.. b] and A1. be arbitrary real numbers. Then there exists a unique polynomial P(x) of degree at most n such that P(xi) = yi. . sk is the sum of the products of the x. Elementary Symmetric Polynomials (Functions) Given indeterminates xl.. If the function is concave down. (cos a + i sin a)' = cos na + z sin no... xn be distinct real numbers. Jensen's Inequality If f is concave up on an interval [a. . It is a basic result that every symmetric polynomial in x1. then Alf (xi) + A2f (x2) + . . the elementary symmetric functions s1. xn in the interval [a... + Anf (xn) > f (A1x1 + A2x2 + .. . That is. polynomial given by (x . n. .. Fibonacci Numbers Sequence defined recursively by F1 = F2 = 1. .. . . This is the Let xo.x0) ...(x . .xn) .. x1. x2. are defined by the relation (in another indeterminate t) (t+xl) (t+xn) =to+slti1+. A.132 Glossary De Moivre's Formula For any angle a and for any integer n. sn. . . + Anxn) for any xl. for all nEN.. . Fn+2 = Fn+l + Fn..xi1)(xi  xa+1).(x . .+sn_1t+sn.. Lagrange's Interpolation Formula . ... yl. . (xi ..xn) P(x) = i=0 yi. the inequality is reversed. z = 0.(xi .. Then BC2 = AB2 + AC2 ..... xn. y. . and vice versa. .x0) .(xi Law of Cosines Let ABC be a triangle. taken k at a time.xi1)(x xi+l). xn can be (uniquely) expressed as a polynomial in the si... are nonnegative numbers with sum equal to 1..
for s < t. bip+ bo. xk }. an be any positive numbers for which a1 + + an = 1....Glossary 133 Lucas' Theorem Let p be a prime. . . . Then MO<MS<Mt<_M. .. 1. = max{xiix2..xk}.. where 0 < ai.. bi < p are integers for i = 0. a2.. . .. M... let a and b be two positive integers such that a = akpk +ak_lpki + .. . k.. Root Mean SquareArithmetic Mean Inequality (RMSAM Inequality) For positive numbers x1. a1 a2 a M = x1 x2 . b = bkpk +bk_lpk1 + . x2..+X2 n XI +X2 +''' +Xk n More generally.. x2. For positive numbers x1. xn we define a2 + M_ = min{x1.. xn Mt = (aix' + a2x2 + . . . Pigeonhole Principle If n objects are distributed among k < n boxes. Then (bk1) Cab) (aobo) \bk/ \b1) (mod p).. . .... x2. some box contains at least two objects.... xn. xi+x2+.. alp+ao. let a1. + akxk)1/t where t is a nonzero real number.
x1+x2+ X1X2 + +xn =.31. Then a + = (al + al) + (a2 + /32)i. The triangle inequality restates the fact that the length of any side of a triangle is less than the sum of the lengths of the other two sides. Define the absolute value of z to be z _ a2 + b2. . . .an1 an i +xixj +xn1xn = . Let sk be the sum of the products sk=(1)kank of the xi taken k at a time.31. a . a2i i3 . . 1. where al. a2 + /32] form a triangle with sides lengths Iah.134 Glossary Triangle Inequality Let z = a + bi be a complex number.. + a1x + a0. Vieta's Theorem Let x1. an2 an i xix2 . v = [N1.... Let a = al +a2i and 3 = Ni +132ti. /32 are real numbers. x2. /32]. Let a and 3 be two complex numbers. Then an that is. . The inequality la+01 :5 lal+101 is called the triangle inequality.. an E C. Vectors u = [ai. a2]. cot x = 1 tan a . and w = [al + X31.. an_1xn1 + . xn be the roots of polynomial P(x) = anxn + where an 0 0 and a0. and ja +. xn = (1)n a0 an Trigonometric Identities sin2 a + cos 2 a= sin a tan x = cos a 1. . .
1+tang2 2 tan 2 .sinasinb.tan a tan b cos 2a = cost a . tan 2a = 2 tan a 1 .sin 2 a = 2 cost a .tang a' tripleangle formulas: sin3a=3sina4sin3a. cos 3a = 4 cos3 a . tan a ± tan b 1T. tan(a ± b) = doubleangle formulas: sin 2a = 2 sina cos a. cosa+cosb=2cosa2bcosa2 tan a + tan b = differencetoproduct formulas: sin(a + b) cos a cos b' b sinasinb=2sina2 bcosa2b. tan 3a = halfangle formulas: 3 tan a .tan3 a 13tan2a 2 tan 2 ' sin a = cos a = 1+tang z 1 .tang 2 ' sin a + sin b = 2 sin a l b cos a 2 b.2 sine a. tan a = sumtoproduct formulas: 1 . .1 = 1 .tan2 a . cos(a±b) =cosacosbT.Glossary 135 addition and subtraction formulas: sin(a±b) =sinacosb±cosasinb.3 cos a.
sin(a . 2 sin a sin b = .tan b = producttosum formulas: 2 sin a cos b = sin(a + b) + sin(a . 2 cosa cos b = cos(a + b) + cos(a .b).cos(a + b) + cos(a .136 Glossary cosacosb=2sina2 bsina2 b tan a .b).b).b) cos a cos b' .
Steenrod. K. 1989. Random House. 8. 2000.. 5. W. J. Doob. Mathematical Contests 19971998: Olympiad Problems from around the World. E. Birkhauser. 27. 11. What to Solve?. 13. 12. Z. 1966. Andreescu. R. 3... Kirichenko. A. New Mathematical Library. E. 1998. Problem Books in Mathematics. Kedlaya. Kedlaya. M. Vol. S. New Mathematical Library. M. Vol... Vol. 1999. 1998. Gelca. New Mathematical Library. Andreescu. 4. P. Mathematical Association of America. 1997. Andreescu. Zeitz. R. G. T. Oxford Science Publications. H. S. T. Mathematical Association of America.. 2. T. An Introduction to Inequalities. with Solutions.. . T... Geometry Revisited. Mathematical Contests 19961997: Olympiad Problems from around the World.. Engel. with Solutions. Barbeau. D. K. Mathematical Olympiads: Problems and Solutions from around the World. 19981999. Chinn. Cofman. Kedlaya.. Polynomials. Feng.FURTHER READING 1.. E.. 2000.. American Mathematics Competitions. 3.. Coxeter. Mathematical Association of America.. L. 1967. Leningrad Mathematical Olympiads 19871991. Andreescu. 10.. First Concepts of Topology. University of Toronto Press. 9. Springer. 7. Andreescu. Mathematical Contests 19951996: Olympiad Problems from around the World. Bellman.. with Solutions. 19. 1994. American Mathematics Competitions. K. F. T. Mathematical Olympiad Challenges. SpringerVerlag. 1961. 6. 1990. American Mathematics Competitions. The Canadian Mathematical Olympiad 19691993. A. ProblemSolving Strategies. MathPro Press. Greitzer. N. Beckenbach. Fomin. 1993.
Kazarinoff. Random House... Kiirschak. J. Hungarian Problem Book.. 1998.. A. M. 1994. Mir. AMT Publishing. Chinese Mathematics Competitions and Olympiads 19811993.. 0. Moscow. Concrete Mathematics.. L.. W. 1963. Kuczma. 24. New Mathematical Library. 1961. 16. Groups and Their Graphs. S.. New Mathematical Library. 21. Lozansky. International Mathematical Olympiads. 29. Sharygin. Greitzer.. I. 27. Graham. Vol. Canberra. 28. Genkin. New Mathematical Library. Larson. 1996.. Random House. 26. Problems in Plane Geometry. 27. 2001. 31. Knuth. L. 1986. 33. Fomin.138 Further Reading 14. 20. D. Random House. The Asian Pacific Mathematics Olympiad 19892000. I... 25. 18. Canberra. 1988. Vols. Mathematical Association of America. M. Bosch Giral. New Mathematical Library. New Mathematical Library. Mathematical Association of America. Mathematical Association of America. Ore. 17. 1964. 23. C. 14. 1996. Klamkin.. H. Vol. The Academic Distribution Center. 19. L. 0. International Mathematical Olympiads. 1989. 15. Itenberg. SpringerVerlag.. Geometric Inequalitties. Vol. Graphs and their uses. Winning Solutions. 0. 1983... 4. N. ProblemSolving Through Problems. 19781985. Grossman. Vol. Invitation to number theory.. 1967. I. 144 Problems of the AustrianPolish Mathematics Competition 19781993. USA Mathematical Olympiads. 1988. AMT Publishing. C. Rousseau.. E. 11 & 12. Mathematical Circles. American Mathematical Society. M. 19721986. E. . Klamkin.. D.. 1978. D. S. Vol. New Mathematical Library. Volumes I & 77. Patashnik. Mathematical Association of America. 22. Lausch... Springer. AddisonWesley. 19591977. Magnus. F. Liu. Ore. C. 1967. Mathematical Association of America. R.
. 1962. Contests in Higher Mathematics. N. Geometric Transformations II. Moscow. 24. 33. 31. New Mathematical Library.. New Mathematical Library. M. 35. Center for excellence in mathematics education. C. I. 8.. J. AMT Publishing. 1994. 0. Tomescu.. 1997. 1968. P. Yaglom . A.. New Mathematical Library. AMT Publishing. I. S. Sharygin. Slinko. 1992. P.. 1994. Wilson.. 1972.Verlag. H.. 40. 1986. Wilf. A. Problems in Combinatorics and Graph Theory. Tournament of Towns 19931997. A. Vol. Wiley.Further Reading 139 30. USSR Mathematical Olympiads 19891992. 1998. AMT Publishing.. Canberra. 1962. 47. 1996.. Random House. McGrawHill. 46.. Academic Press. Random House... Yaglom.. The USSR Olympiad Problem Book. R. Vol. Szekely. 42. Elementary Number Theory. Canberra. Vanden Eynden. I. F. J. M. Tournament of Towns 19841989. Cambridge University Press. Chentzov. Taylor. J. 1997.. Canberra. P. Generatingfunctionology. Vol. Yaglom. 36. 44. Taylor. 32. C. Shklarsky. Colorado Mathematical Olympiad: The first ten years. J. Problems in Solid Geometry. AMT Publishing. Storozhev. Tournament of Towns 19801984. Zeitz. Canberra. 37. I.. Geometric Transformations. John Wiley & Sons. 1973. M. 41. 34. 1999. 38. Introduction to graph theory. Soifer. J. I.. 1987. 39. D. Geometric Transformations III. Freeman. I. Yaglom. The Art and Craft of Problem Solving. P. 1985. 1994. P. AMT Publishing. N. P. Random House. . R. Mir. Enumerative Combinatorics. Tournament of Towns 19891993. Stanley. Academic Press. Canberra. 43. 45. Springer. 1993. Taylor. 21. Taylor. M...
.
Originally from Romania. and is an assistant director of the USA Mathematical Olympiad Summer Program. l le also serves as a coach of the USA International Mathematical Olympiad (IMO) Team. is Chair of the USA Mathematical Olympiad Committee. ISBN on THE AUSTRALIAN MATHEMATICS TRUST EN R I CHMENT SE R I E S 1 876420 12 X . In addition. is a member of the USA Mathematical Olympiad Committee. and is Director of the USA Mathematical Olympiad Summer Program. Prof.Titu Andreescu is Director of the America n Mathematics Competitions. He received the Edyth May Sliffe Award for Distinguished High School Mathematics Teaching from the MAA in 1996. Andreescu received the Distinguished Professor Award from the Romanian Ministry of Education in 1983. he received a Certificate of Appreciation presented by the President of the MAA for "his outstanding service as coach of the USA Mathematical Olympiad Program in preparing the USA team for its perfect performance in Hong Kong at the 1994 IMO". then after moving to the USA was awarded the Edyth May Sliffe Award for Distinguished High School Mathematics Teaching from the MAA in 1994. serves as Head Coach of the USA International Mathematical Olympiad (IMO) Team. Zuming Feng graduated with a PhD from Johns Hopkins University with an emphasis Algebraic Number Theory Elliptic and Curves. He teaches at Phillips Exeter Academy.
This action might not be possible to undo. Are you sure you want to continue?