¿Está seguro?
This action might not be possible to undo. Are you sure you want to continue?
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
Canberra AUSTRALIA WARREN J ATKINS. the problems have occurred in either national or international contests at the secondary school level. Moscow RUSSIA ANDY Liu. Lincoln USA NIKOLAY KONSTANT1NOV. be interesting and sometimes challenging to the undergraduate and the more advanced mathematician. . Typically. They are intended to be sufficiently detailed at an elementary level for the mathematically inclined or interested to understand but. Sofia BULGARIA JOHN WEBB. Edmonton CANADA JORDAN B TABOV. Canberra AUSTRALIA ED J BARBEAU. Cape Town SOUTH AFRICA The books in this series are selected for their motivating. Terra Haute USA RON DUNKLEY. Canberra AUSTRALIA PETER J TAYLOR. It is believed that these mathematics competition problems are a positive influence on the learning and enrichment of mathematics. with a lucid expository style in their solutions. Waterloo CANADA WALTER E MIENTKA. at the same time.THE AUSTRALIAN MATHEMATICS TRUST ENRICHMENT S E R I E S EDITORIAL COMMITTEE Chairman Editor GRAHAM H POLLARD. Toronto CANADA GEORGE BERZSENYI. interesting and stimulating sets of quality problems.
J Dowsey.THE AUSTRALIAN MATHEMATICS TRUST ENRICHMENT BooKs IN THE SERIES 1 SERIES AUSTRALIAN MATHEMATICS COMPETITION BOOK 1 19781984 JD Edwards. 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 . 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. AR Edwards. U Mottershead. 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.
114 POLISH Et AUSTRIAN MATHEMATICAL OLYMPIADS 1981.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. JE Munro Et PJ Taylor 17 SEEKING SOLUTIONS JC Burns 18 101 PROBLEMS IN ALGEBRA T Andreescu Et Z Feng .
.
It is not a collection of one hundred very difficult. . Instead. the book gradually builds students' algebraic skills and techniques. This work aims to broaden students' view of mathematics and better prepare them for possible participation in various mathematical competitions. impenetrable questions. It provides indepth enrichment in important areas of algebra by reorganizing and enhancing students' problemsolving tac tics and strategies. The book further stimulates students' interest for future study of mathematics.PREFACE This book contains one hundred highly rated problems used in the training and testing of the USA International Mathematical Olympiad (IMO) team.
.
do read the solutions. working backward from the desired result is helpful. polynomials. These topics include combinatorial arguments and identities. full days of classes and extensive problem sets give students thorough preparation in several important areas of mathematics. Even if you can solve a problem. 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. Olympiadstyle exams consist of several challenging essay problems. Be patient. Cor rect solutions often require deep analysis and careful argument. cleverly applied. combinatorial and advanced geometry. theory of equations. generating functions. and the United States of America Mathematical Olympiad (USAMO). 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). the American Mathematics Contest 12 (AMC 12). telescoping sums and products.INTRODUCTION In the United States of America. Experiment with simple cases. Try different approaches. The Mathematical Olympiad Summer Program (MOSP) is a fourweek. intense training of 2430 very promising students who have risen to the top of the American Mathematics Competitions. Olympiad questions can seem impenetrable to the novice. graph theory. functional equations and classical inequalities. Take your time! Very few contestants can solve all the given problems. the American Invitational Mathematics Examination(AIME). They may contain some ideas that did not occur in your solutions. recursive relations. probability. algorithmic proofs. based on performance in the preceding exams of the sequence. Throughout MOSP. complex numbers in geometry. yet most can be solved with elementary high school mathematics techniques. and they . number theory. 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. Participation in the AIME and the USAMO is by invitation only. In some cases. Try to make connections between problems.
use the books on the reading list. All terms in boldface are defined in the Glossary. try to reconstruct the thinking that went into them. Meaningful problem solving takes practice.viii Introduction may discuss strategic and tactical approaches that can be used elsewhere. When you read the solutions. . Many of the problems have multiple solutions. Don't get discouraged if you have trouble at first. For additional practice. but not all are outlined here. "What were the key ideas?" "How can I apply these ideas further?" Go back to the original problem later. inspiration and attention to detail that led to them. Ask yourself. false starts. but they often obscure the torturous process of investigation. and see if you can solve it in a different way. The formal solutions are also models of elegant presentation that you should emulate. Use the glossary and the reading list to further your mathematical education.
China Revista Matematica Timi§oara. Romania Kvant. Many problems are either inspired by or fixed from mathematical contests in different countries and from the following journals: HighSchool Mathematics.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. 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 . 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.ABBREVIATIONS AND NOTATIONS Abbreviations AHSME AIME AMC10 AMC12 ARML IMO USAMO MOSP Putnam St.
.
INTRODUCTORY PROBLEMS xiii 1 2. ADVANCED PROBLEMS 13 3.CONTENTS PREFACE vii ix xi INTRODUCTION ACKNOWLEDGEMENTS ABBREVIATIONS AND NOTATIONS 1. SOLUTIONS TO INTRODUCTORY PROBLEMS 27 4. SOLUTIONS TO ADVANCED PROBLEMS GLOSSARY 65 131 FURTHER READING 137 .
.
INTRODUCTORY PROBLEMS .
.
. a Problem 3 Let x1. x1 = 4 and xn+1 = xn_1 . . d c and f (f (x)) = x. X. be a sequence of integers such that (i) 1 < x. INTRODUCTORY PROBLEMS Problem 1 Let a. . (ii) x1 + x2 + (iii) + xn 19.. and d are nonzero real numbers. for z = 1. Determine the minimum and maximum possible values of xi+x2+ +xn... defined by f(x) = ax+b cx+d' where a. Problem 4 The function f. f (97) = 97. b. < 2. Solve the equation a+bx+ b+cx+ c+ax= b ax+ cbx+ acx. c. Problem 2 Find the general term of the sequence defined by x0 = 3. b. n... for all values of x. 2. has the properties f (19) = 19. x2i .nxn for all' n E N.1. and c be real and positive parameters. except  Find the range of f.
. say a and b. Problem 7 The polynomial 1x+x2x3+. and c be distinct nonzero real numbers such that a+b=b+. + a16y16 + a17y17.=c+. Problem 8 Let a. and h(x). where y = x + 1 and as are constants.I g(x) I + h(x) = ifx<1 if 1 < x < 0 3x + 2 2x+2 ifx>0. after any number of the preceding operations. such that for all x. c 1 1 1 Prove that Iabcl = 1. Find a2. 1 1 If (x) I .. g(x).a instead. 2 Prove that the set of numbers on the board. b. cannot coincide with the initial set.. Problem 9 Find polynomials f (x)..2 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. if they exist.+x16_x17 may be written in the form ao + a1y + a2y2 + . One may erase any two numbers. and then write the numbers a + 2 and b .
c. e}. c. . d. 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.1. and e be positive integers such that abcde = a + b + c + d + e. Find the maximum possible value of max{a. d. Problem 15 Find all real numbers x for which 10x + 1lx + 12x = 13x + 14x. Problem 12 Let a. b. a ER. Find all possible values of x. 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. b.
bI. 1] such that f (O) =f(l) = 1 and I f (a) . 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.n+1)= f(m. y) such that 2 x3 + y3 = (x + y)2. 1) = 2.n) +m and f(m. q) = 2001.N be a function such that f (1.n)n for all m. 1].4 1.nEN.n)= f(m. If(a)f(b)I < Problem 18 Find all pairs of integers (x. f(m+1.f (b)I < I a . Problem 19 Let f (x) = Evaluate 2 4x 2 for real numbers x.. q) such that f (p. for all a Prove that b in the interval [0. Problem 21 Find all pairs of integers (a. f Problem 20 (2001I ) +f (20012 ) + +f (20001) Prove that for n > 6 the equation 1 + 1 2 x2 +. Find all pairs (p. b) such that the polynomial ax17 + bxls + 1 is divisible by x2 .x .1.
then p(n) is equal to that digit. }.1. . a3 .) Let S = p(1) + p(2) + What is the largest prime factor of S? + p(999). Problem 25 For any sequence of real numbers A = {a1. Establish necessary and sufficient conditions on x1 and x2 for x.a3.. Suppose that all of the terms of the sequence A(AA) are 1.. Problem 24 Solve the equation x33x= x+2. a3.xn_1 for n = 3. Introductory Problems 5 Problem 22 Given a positive integer n. Problem 23 Let xn be a sequence of nonzero real numbers such that xi_2xn_1 xn 2xn_2 . Problem 26 Find all real numbers x satisfying the equation 2x+3x4x+6x9x=1. a4 . n) for which mn > 0 and m3 + n3 + 99mn = 333. let p(n) be the product of the nonzero digits of n. define DA to be the sequence {a2 . Problem 27 Prove that 80 16<Ev1 k=1 <17. . (If n has only one digit. 4. to be an integer for infinitely many values of n... Find a1. a2..a1.}. and that a19 = a92 = 0.a2.. . k Problem 28 Determine the number of ordered pairs of integers (m.
Problem 30 Evaluate n k=O E (n . 1 Problem 32 What is the coefficient of x2 when (1 + x)(1 + 2x)(1 + 4x). i. Ic .. Solve for positive numbers x.6 1. Find the maximum value of Ix' . lb .. Introductory Problems Problem 29 Let a.a2).xnl where x is a real number in the interval (0. Problem 34 Prove that the polynomial (x .. . an are distinct integers.bi < 2.an) .(x . cannot be written as the product of two nonconstant polynomials with integer coefficients. and c be positive real numbers such that a + b + c < 4 and ab+bc+ca > 4.e. Prove that at least two of the inequalities la . 1). .cl < 2.al)(x . b. where al.(1+2 nX) is expanded? Problem 33 Let m and n be distinct positive integers. a2. it is irreducible..al < 2 are true..1.k)!(n + k)! Problem 31 Let 0 < a < 1.
1)x2 + (2x2 .x3) = x4(x1 + x2 . Problem 39 Let x.xl) for real numbers x1. and z be complex numbers such that x + y + z = 2.x5) = xl(x3 + x4 . x5.x4 + x5)2 (x4 . y.x2) = x3(x5 + x1 . Prove that (a+ is an irrational number.1. x2+y2+z2=3 and xyz = 4.x2 + x3)2 (x2 .x4) = x5(x2 + x3 . x3.x3 + x4)2 (x3 .2)x = 2x+1 . a21) +(a .x1 + x2)2 = x2(x4 + x5 . Problem 36 Solve the equation 2(2x . Evaluate 1 1 1 xy+zl+yz+xl+zx+y1 . y) for which: (1+x)(1+x2)(1+x4) = l+y7 and (1 + y)(1 + y2)(1 + y4) = 1 + x7.x5 + x1)2 (x5 . x4. Introductory Problems 7 Problem 35 Find all ordered pairs of real numbers (x.2 for real numbers x. Problem 37 Let a be an irrational number and let n be an integer greater than 1.a21) Problem 38 Solve the system of equations (x1 . x2.
Problem 42 Find the real zeros of the polynomial Pa(x) = (x2 + 1)(x .. determine the maximum and the minimum value of a. Prove that ak < s for some k. d. Introductory Problems Problem 40 Mr. Mr. Problem 44 Let P(x) = aoxn + al xn1 + .8 1. Find all complex numbers x such that (X) 2 x 2 2 .. 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..ax 2. Problem 45 Let m be a given real number. Who has a winning strategy? Problem 41 Given that the real numbers a.1)2 . with 0 < r < s. and e satisfy simultaneously the relations a+b+c+d+e=8 and a2+b2+c2 +d2+e2=16. b. Fat is going to pick three nonzero real numbers and Mr.1 2n 1 2 737 for all positive integers n. where a is a given real number. c. Taf is going to arrange the three numbers as the coefficients of a quadratic equation x2+ x+ =0. Problem 43 Prove that 1 3 4 2n . + a.
1 (Xn1 + 2 1 I .. . is periodic. .n>2. Solve the system of equations x . and xn+1 . Prove that ab = 1. Problem 48 Find all complex numbers z such that (3z + 1)(4z + 1)(6z + 1)(12z + 1) = 2. Problem 47 Let a.x x2y2 = b 1x2+y2 for real numbers x and y.. and d be real numbers such that (a2+b21)(c2+d21) > (ac+bd1)2. y . Prove that a2 + b2 > 1 and c2 + d2 > 1.+ 1 n1 2 1xn_1 Let a and b be given real numbers. b.1. Problem 49 Let x1i x2. c. xn_1i be the zeros different from 1 of the polynomial 1x1 + 1x2 Problem 50 +. Introductory Problems 9 Problem 46 The sequence given by xo = a.yx 2yz 1x2+y2 a. Prove that 1 1 P(x)=xn1. x1 = b.
.
ADVANCED PROBLEMS .
.
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. z be positive real numbers such that x4 + y4 + z4 = 1. Problem 53 Find all real solutions to the equation 2X + 32: + 6X = x2. and z be positive real numbers. Find an explicit formula for an. Determine with proof the minimum value of x3 1x8+1y8+1z8. y. Prove that x + y x+ (x+y)(x+z) y+ (y+z)(y+x) + z + z (z +X) (z + y) < .2. + (2000) Problem 52 Let x. y. ADVANCED PROBLEMS Problem 51 Evaluate 0200 0) 2 + (2000) + 5 (20800) + .. Problem 55 Let x..
Advanced Problems Problem 56 Find. Evaluate f (2001). 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..14 2.. with proof. Prove that f(f(x)) = x. Problem 57 Let f : N * N be a function such that f (n + 1) > f (n) and f (f (n)) = 3n for all n. 22".yER+. < 1 + 1 +. Problem 59 Let x1 = 2 and x'+1 for n > 1. f(x + y) +N(X) + f(y)) = f(f(x + f(y)) + f(y + f(x))). all nonzero polynomials f (z) such that f(z2) + f(z)f(z + 1) = 0. Prove that 1 2 =xnx.+ 1 <122.. xn x1 x2 Problem 60 Suppose that f : R+ > 1[8+ is a decreasing function such that for all x. . For each integer k > 1. find mk. 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. + 1.
satisfying the following properties: f(x. f(x. Problem 65 Consider n complex numbers zk. n. y E Q. . Problem 62 Let2<a<1. for any m < n. en E {1. Problem 66 Find a triple of rational numbers (a.y) = yf(x. Prove that a+b+l+b+c+l+c+a+l C1 Problem 64 Find all functions f. <2...y) = 2f(x) + 2f(y) for all x. (x+y)f(x.2. Problem 63 Let a. .y) = f(y. 1} such that. Prove that there exist e1.x).x+y)..Q such that f(x + y) + f(x .x) = x. k = 1. defined on the set of ordered pairs of positive integers. c) such that 9 321= 3a+ 3b+ yc.. b. b. Prove that the equation x3(x + 1) = (x + a)(2x + a) has four distinct real solutions and find these solutions in explicit form. and c be positive real numbers such that abc = 1.2. Advanced Problems 15 Problem 61 Find all functions f : Q . . e2. .. such that zk < 1.
. xn..4 where x1i x2. Problem 68 Determine x2 + y2 + z2 + w2 if x2 y2 .. one obtains exactly one number c on the board. 1001.52 + 62l 32 . a2. not all zero. . Advanced Problems Problem 67 Find the minimum of logxl (X2 1 4 + logX2 X3 = 4) + .. Prove that c < 1. one is allowed to erase two numbers. Prove that the equation 1 +a1x+ has at most one nonzero real root. and replace them by the number 2 min(a. be real numbers.72 = 1.Y + 62 . After 1999 such operations. x2 y 2 z2 w2 8212 +8232 +8252 +8272 Problem 69 Find all functions f : R > R such that 1. b).Z2 w2 2212 +2232 +2252 +2272 x2 2 .2 + 62 . 1+a. . . say. . y E R.x=n .Z2 w2 4212 +4232 +4252 +4272 x2 2 z2 w2 _ 62 . 2999 have been written on a board.. are real numbers in the interval (4. Problem 71 Let al.. a.. f(xf(x) +f(y)) = (f(x))2 +y for all x. 1)....16 2. Each time. a and b. Problem 70 The numbers 1000. + logy 1 1 xl .
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. b and c be positive real numbers such that abc = 1. a3a7 + a4a8. Prove that ab be ca as+b5+ab+b5+c5+bc+c5+a5+ca l . an > blb2 . 0 < bl < b2 n . ala2 .. b. < bn be real numbers such that n E ai > E bi. ala7 + a2a8. alas + a2a6. Problem 76 Let a.. as.. prove that at least one of the following six numbers: alai + a2a4.2..an) forn>1.. Given eight nonzero real numbers al. Advanced Problems 17 Problem 72 Let {an} be the sequence of real numbers defined by al = t and an+i = 4an(1 . a5a7 + a6a8 is nonnegative. a2. 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. Prove that Problem 75 . . a3a5 + a4a6.
If Mr.. then F(O) = F(1) = ..1. Mr.18 2... Fat goes first. Problem 78 Solve the system of equations: 3x y x+ x2 +. Taf wins.. Mr.. for alln>2. Advanced Problems Problem 77 Find all functions f : R > R such that the equality f(f(x) + y) = f(x2 . 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. They fill in real numbers to empty spaces in turn. Problem 81 The Fibonacci sequence Fn is given by F1=F2=1. = F(k + 1). If the resulting polynomial has no real root.y2 =3 x+3y x2+y2 =0. .Fn+2=Fn+1+Fn (nEN).k+1. Fat and Mr. + _x + 1. Y Problem 79 Mr.y) + 4f(x)y holds for all pairs of real numbers (x. otherwise.. Fat wins. y). Prove that F2n = F2n3 +2 + Fen2 9 3 2F2. Taf play a game with a polynomial of degree at least 4: x2n + _x2n1 + _x2n2 +..
Problem 85 Two real sequences x1i x2.. > l such that f(x + y) = f(x)u(y) + f(y) for all x.. Yn+1 = 1 + y2 for all n > 1. y E R. .. b]) as P(b) . and xn+1 = xn + yn 1 } 1+X .. What about cubic polynomials? ([a.P(a). (a. . . 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. .. b)... for every quadratic polynomial P(x). . zn be complex numbers such that Iz1I+Iz21+. are defined in the following way: X1 = Ill = V3. Y2. b). Advanced Problems 19 Problem 82 Find all functions u : lib > R for which there exists a strictly monotonic function f :ill.. define the difference of P(x) on the interval [a. Z2. the total difference of P(x) on red intervals is equal to that of P(x) on blue intervals. Prove that 2 < xnyn < 3 for all n > 1. 1] into a finite number of intervals and color them red and blue alternately such that. . Problem 86 For a polynomial P(x).. Problem 83 Let z1i Z2. .. Find all integer roots of P(P(x)) given that 0 is a root of P(x).+znl =1.. Prove that there exists a subset S of {z1. b] (a. Prove that it is possible to dissect the interval [0.2. and y1..
. with ao = 2 and 2 ak = ak1 + ak_1 n fork=1.. ]I82 > R be a function such that for Prove that f is the zero function. Fat chooses a real number and Mr. Taf are playing the following game.2. 11<an.. Mr. Consider the sequence ao. 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. After three moves the game is over. Fat and Mr. (ii) for every positive integer n. Prove that .n. the remainder upon division of f (n) by p is either 0 or 1. an. f(A1)+f(A2)+. Mr.20 2.1. f (1) = 1. Mr. .+f(An) =0. Taf puts it in one of the empty spaces. Prove that d > p . Who has a winning strategy? Problem 88 Let n > 2 be an integer and let f : any regular ngon A1A2 .. Problem 90 Let n be a given positive integer.<1. An. n . In one move. Fat wins the game if the final equation has three distinct integer roots. a1. Advanced Problems Problem 87 Given a cubic equation x3 + _x2 + _x +  = 0.
an be nonnegative real numbers. Problem 92 Prove that there exists a polynomial P(x..anlx . (a) Prove that xn .(x + n) 00 1 n=1 ti=1(x + k)2* .an = 0 has precisely one B=yn (b) Let A= 1aj and Prove that AA < RB. y) with real coefficients such that P(x. y) > 0 for all real numbers x and y. a2.1)! (x + n) _ 1 x' (n1)! n(x + 1)...alxn1 positive real root R. . g with integer coefficients.... show that there exists a positive integer k such that k = f(x)(x + 1)2n + g(x)(x2n + 1) for some polynomials f. which cannot be written as the sum of squares of polynomials with real coefficients. Problem 93 For each positive integer n. and find the smallest such k as a function of n.2. (a) Prove that °O E (b) Prove that 00 (n . Problem 94 Let x be a positive real number. . Advanced Problems 21 Problem 91 Let a1. not all zero. 3a.
x2.x.xn Let y'. xn be positive real numbers.. Suppose that ) Prove that 1 = 1.+ x2 . Advanced Problems Problem 95 Let n > 3 be an integer.+ xn>(n1) 1 xl + 1 +.n3} be a set of 3n2 elements. ..x1)(x x2)... .... yo.. 2. xn be distinct real numbers. Show that inIxi . and let X C S= {1. x1+ x2+.j < inlyiy31..2. y2. Problem 96 Let n > 3 be an integer and let x1. yn_1 be the roots of Q. X2. bz.. (i = 1.22 2. c. . n .. Define the polynomials P(x) = (x .... z0) in nonzero integers. . 3) in X such that the system aix + bly + c1z a2x + b2y + c2z = 0 = 0 a3x+b3y+c3z = 0 has a solution (x0..(x and Q(x) = P(x) (I + ..xn) 1 xn Problem 97 Let x1. + L) 1 xx1 + xx2 x . Prove that one can find nine distinct numbers a...
. if n = 2. For which k and n is every coefficient of pk (as a polynomial in xl. Problem 100 Let X1.al)(x .. and let yi. not all zero. .. .. the polynomial AX) = (x2 + integer coefficients. x7) be the kth elementary symmetric polynomial in the yi (the sum of every product of k distinct yis).. alo such that the equation (x ..a2) . y2i y3 are x1. a3 E R. Advanced Problems 23 Problem 98 Show that for any positive integer n. c2.. x2.. Let pk(xl. x2. a2i .. . 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. c3 E JR. xn) even? For example...alo) = (x + al)(x + a2).. .(x + alo) has exactly 5 different real roots. a2. x)2' +1 cannot be written as the product of two nonconstant polynomials with Problem 99 Let fl.. f2i f3 : JR > JR be functions such that a1f1 + a2f2 +a3f3 is monotonic for all al. y2. . Prove that there exist c1.. . such that CI fl (x) + C2f2(x) + C3f3(x) = 0 for allxEJR.2. then yl. xn be variables.. (x .. . . Y2"_1 be the sums of nonempty subsets of xi.
.
SOLUTIONS TO INTRODUCTORY PROBLEMS .
.
there is at most one solution. and c be real and positive parameters. Problem 2 Find the general term of the sequence defined by xo = 3.nxn for allnEN. Solve the equation a+bx+ vl'b c+ax=ax+ cbx+ acx. Thus x = 0 is the only solution to the equation. Solution 1 It is easy to see that x = 0 is a solution. x1 = 4 and 2 xn+1 = xn_1 .ifxk_1=k+2 =k+2andXk =k+3. SOLUTIONS TO INTRODUCTORY PROBLEMS Problem 1 [Romania 1974] Let a. The claim is evident for n=0. This completes the induction. Since the right hand side is a decreasing function of x and the left hand side is an increasing function of x.3. then Xk+1 = x2_1 .kxk = (k + 2)2 . as desired. Solution 2 We shall prove by induction that xn = n + 3.1. Fork>1. b. .k(k + 3) = k + 4.
(ax+b ) +b cx+d ax+b c (cx+d) +d a x' . Solution 3 Let a. Is.. has the properties f (19) = 19. where 0 < c < 19 (since b > 0). for i = 1. We need not consider the zeros.. Problem 4 [AIME 1997] The function f. and c denote the number of Is. c are nonnegative integers satisfying a+b+2c= 19 and a+b+4c= 99. C f (f (x)) = x. respectively. . i.c and b = 59 . and d are nonzero real numbers..3c. Solution 4. x. (ii) xl + x2 + + x2 = 99. b. f (f (x)) = x. and 2s in the sequence.. the lower bound (19) is achieved. b.d Find the range of f. Alternative 1 For all x.. It follows that a = 40 . c. Then a. except .+xn. defined by f(x) = ax+b cx+d' and where a. so xl +x2 + +xn = a+b+8c = 19+6c. When c = 0 (a = 40... for all values of x. When c = 19 (a = 21.e. f (97) = 97. . b. b = 59). 2.. Solutions to Introductory Problems Problem 3 [AHSME 1999] Let x1i X2.. b = 2).28 3. n. the upper bound (133) is achieved. Determine the minimum and maximum possible values of xi+x2+. be a sequence of integers such that (i) 1 < xti < 2.
respectively.b(a + d) = 0.1843 = 58 + 1521 x58 x58' which never has the value 58. c(a + d)x + be + d2  c(a + d)x2 + (d2 . Alternative 2 The statement implies that f is its own inverse.3. 19a+b Hence and 972c=2. which implies that c(a + d) = 0. b.{58}. i(x) _ dxb cx + a The nonzero numbers a. and the rest is the Problem 5 Prove that (ab)2 8a  a+b 2 a < (ab)2 8b for all a>b>0. Thus the range of f is R . Solutions to Introductory Problems 29 (a2 + bc)x + b(a + d) x. Solution 5.19)a.a2)x .192)c = 2(97 . it follows that a = d. This yields f same as in the first solution. and d must therefore be proportional to d. It follows that a = 58c. and a. The conditions f (19) = 19 and f (97) = 97 lead to the equations 192c=2. The inverse may be found by solving the equation ay + b cy + d for y. c. (972 . . Since c 0. b. which in turn leads to b = 1843c. Therefore Ax) = 58x . Alternative 1 Note that C 2f + / `<1< 2Vb +V1` J .97a+b. Solution 4. we must have a = d. c.
Petersburg 1989] Several (at least two) nonzero numbers are written on a board. say a and b.30 3. 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. 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. Note that S increases in the first operation and does not decrease in any successive operation. This completes the proof. and then write the numbers a + 2 and b . Problem 6 [St. Solution 5. as Ca+2 \2 J +(b2)2=4(a2+b2)>a2+b2 with equality only if a = b = 0. after any number of the preceding operations. One may erase any two numbers. Prove that the set of numbers on the board. . cannot coincide with the initial set. which is evident as a > b > 0 (which implies a > ab > b). Solution 6 Let S be the sum of the squares of the numbers on the board.2 instead.
..x18 and (1 + x)f(x) = 1 . . where y = x + 1 and as are constants.. Solution 7.1) 17 Thus a2 = (2 ) 2 + (1). Find a2.1) = 1 (y . Solutions to Introductory Problems 31 Problem 7 [AIME 1986] The polynomial 1x+x2x3++x16x17 may be written in the form ao + aly + a2y2 + . + (17) = (18). Solution 7. + a16y16 + a17y17.1)18  1 .3. Here we used the formula (n) and the fact that k+ (k+ 1) . Then xf(x)=xx2+x3.x18...(k + 1 (22) _ (33) = 1.1)2 =1+(1y)+(1y)2+. Alternative 1 Let f (x) denote the given expression.. (y ..1) = 1 .1) + (y . Alternative 2 Let f (x) denote the given expression. Then f(x) = f(y .(y .+(1y)17.+.1)18 1+(y1) y Therefore a2 is equal to the coefficient of y3 in the expansion of 1(y1)1s a2 = (18) = 816.(y . Hence f(x) = f(y ..
andca= aabb . Solution 8 From the given conditions it follows that a b= b bc c . g(x) = 5x/2.32 3. 3x + 2 Solution 9. from which the desired result follows. b. . such that for all x.(5x+I5xl)/2+3x+2 = 1(3x+3)/21 . Problem 9 [Putnam 1999] Find polynomials f (x). c = 1. 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. if F(x) is the given function. s) = r+s+Ir . 0} + 3x + 2 = (3x .Ig(x) I + h(x) = ifx<1 if 1 < x < 0 2x + 2 ifx > 0. 0} max{5x. Solution 9. which implies that a = 3/2. and d = 1/2. Prove that IabcI = 1. Multiplying the above equations gives (abc)2 = 1. b = 5/2. b c = ccaa. and h(x). then max(r.x+ 21 . g(x). Alternative 2 Note that if r(x) and s(x) are any two functions.3 + 13x + 31)/2 .sl 2 Therefore. if they exist.3. and h(x) = x + z .15x/21 . Hence f (x) = (3x + 3)/2. Solutions to Introductory Problems Problem 8 Let a. we have F(x) = max{3x . 1 If (X) I . and c be distinct nonzero real numbers such that a+=b+=c+. Alternative 1 Since x = 1 and x = 0 are the two critical values of the absolute functions.
10) (5 Thus m = 4.+\2n1 C2 n) < 2 =(1+1)2n=4n and for n = 5.13ab + 6b2 = 0. = 252 > 35 . 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.3b)(3a . Therefore 2x+1 = 3x+1 or 2x1 = 3x1.2b) = 0.. Problem 11 [Romania 1990] Find the least positive integer m such that C2nln n <m for all positive integers n..3. (2a .ab + b2 ab 7 6 _ 7 6' 6a2 . It is easy to check that both x = 1 and x = 1 satisfy the given equation. Solution 11 Note that (0)+(1)+. the equation becomes a3 + b3 a2b + b2a a2 .
x. d. (1. 2. e}. Solution 12. which leads to max{e} = 5. 5). 5) is a solution. x2. xn are positive integers such that 1112. We need to find the maximum value of e.34 3. Problem 13 Evaluate 3 4 2001 1! + 2! + 3! + 2! 3!+ 4! + + 1999! + 2000! + 200 1! . when xi. (1. 1n =X1 +X2 + . or (1. Hence (a.n}.+ 1n. d. (1. Comment: The second solution can be used to determine the maximum value of {x1i X2. If d = 1. Solution 12. 2). c. b. 1. de < 3 + d + e or (d.. 1. 1. which is impossible. 2..1) < 4. 1. b. d) = (1. b. 1. c. Alternative 1 Suppose that a < b < c < d < e.. Thus d1>lande1<4ore<5. c. suppose that a < b < c < d < e. 4).e. 1 < abcd < 5. Find the maximum possible value of max{a. i. 3). 1. Solutions to Introductory Problems Problem 12 Let a... 2). 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. .. 1.1)(e.. 1. 1. then a = b = c = 1 and 4 + e = e.. Since e<a+b+c+d+e<5e. . 1. It is easy to see that (1. and e be positive integers such that abcde=a+b+c+d+e. Alternative 2 As before.. 1. Therefore max{e} = 5. then e < abcde < 5e. .
Alternative 1 Since a2+Ial+1> Ial and x= we have 2a a2 + a + 1 + a2a+1' jxj < 12a/al = 2. .1 (k + 2)! (k + 1)! (k + 2)! By telescoping sum.3. the desired value is equal to 1 1 2 2001! Problem 14 Let x = a2+a+1. Find all possible values of x.a2a+ 1. a E R. 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) . Squaring both sides of x+ yields vla2 a2+a+1 2x a2a+1=2ax2. Solution 14.
i. a half hyperbola of all points Q such that QA . for such a d. In fact. B = (1/2. 1 < x < 1.1) Since a2 > 0.PB. In fact. Conversely.4) or a 2 = x2(22 .1) > 0.axis.PBj < IABI = 1. Alternative 2 Let A = (1/2. / The left hand side is a decreasing function of x and the right hand side is an increasing function of x. Solutions to Introductory Problems Squaring both sides of the above equation gives 4(x2 . Therefore their graphs can have at most one point of intersection. Problem 15 Find all real numbers x for which lOx + 11x + 12x = 13x + W.e.. Solution 15 It is easy to check that x = 2 is a solution. SPA .4) 4(x2 .36 3. By the Triangle Inequality.QB = d is well defined. for every x E (1. this half hyperbola intersects the x. P is well defined.) Since line AB is parallel to the xaxis. 0). 1) there exists a real number a such that x = a2+a+1. Solution 14. We claim that it is the only one. //2).a2a+1. Then P is a point on the xaxis and we are looking for all possible values of d = PA . and P = (a. dividing by 132 on both sides gives (10 ) x + (11)x+ ( 13)2 = 1+ (13)2. (Points A and B are foci of the hyperbola. Since IxI < 2. Therefore. And it is clear that all the values 1 < d < 1 are indeed obtainable. we must have 22(x2 4) (X2 . .1)a 2 = x 2 (x 2 . x2 4 < 0 which forces x2 1 < 0. //2).
1) = 2.n)+m and f(m.1 = 1999. . 2.1) 2 f(1.1)  + p(p . q) such that f (p.q)+(p2)+(p.1) 2  q(q . k E N.1999. Note that 1999 is a prime number and that p . Find all pairs (p.q < p + q . Therefore p(p . q) = 2001. +(a+2k)2 for a = k(2k + 1).1) f(l.1) 2 = 1999.1.3. Hence p = 1001 and q= 999.1 = f(p2. Solutions to Introductory Problems 37 Comment: More generally.N be a function such that f (1. Problem 16 [Korean Mathematics Competition 2001] Let f : N x N .q1)(q1)+p(p1) 2 q(q .1) 2 2001. p .1 for p.q = 2 and p + q . .q) + p(p.q) + p .1) 2 f(1. + (a + k)2 = (a + k + 1)2 + (a + k + 2)2 + .n)= f(m. p . Solution 16 We have f(p.q) = f(p . (pq)(p+q.1 = 3998. f(m+1.q = 1 and p + q . n E N.n+ 1) =f(m. We have the following two cases: 1. Hence p = 2000 and q = 1999. q E N. a2+(a+ 1)2 + .n) n for all m.1) = 2.
we may assume that a > b. Ia . q) = (200Q. Suppose that x + y 54 0. . as desired.bI . Prove that If(a) . Ia . Problem 18 Find all pairs of integers (x. 1] such that f(0)=f(1)=1andlf(a)f(b)I <IabI. all pairs of integers (n.f (b) I < I a . 2. 1]. 999).f(b)I < 2 Solution 17 We consider the following cases. i. Then I f (a) . Problem 17 [China 1983] Let f be a function defined on [0. 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. Solution 18 Since x3+y3 = (x+y)(x2xy+y2).7G. x2(y+1)x+y2y=0.bI > 1/2. By symmetry. as desired. Solutions to Introductory Problems Therefore (p. 1.e. y) such that x3 + y3 = (x + y)2. 1999) or (1001. Then the equation becomes x2xy+y2=x+y. are solutions.38 3. n c.bI < 1/2. n). for all a 54 bin the interval [0.
Therefore. (1. (2. n).1). 2). the integer solutions of the equation are (x.y. 1. which lead to the solutions (1. and (2. y) = (1. Problem 20 Prove that for n > 6 the equation 2+2+ 1 1 . 2). Indeed. Solving for 0 > 0 yields 32y . we calculate the discriminant 0=y2+2y+14y2+4y=3y2+6y+1. and (n. 0). 1/2). Solution 20 Note that 1 1 1 1 1 a2 (2a)2 + (2a)2 + (2a)2 + (2a)2' . (2.4x 4x+2' from which it follows that f (x) + f (1 .3+2y 3 3 Thus the possible values for y are 0. 2). 1). 0). and 2. 1). for all n E Z. Problem 19 [Korean Mathematics Competition 2001] Let 2 f(x) = 4x + 2 for real numbers x.3.+2=1 1 x1 x2 xn has integer solutions. 2). (0. (2. Evaluate f ( 2001) + f ( 2001) + + f ( 20001) Solution 19 Note that f has a halfturn symmetry about point (1/2. Thus the desired sum is equal to 1000. Solutions to Introductory Problems 39 Treated as a quadratic equation in x.x) = 1. (1. f(1x)= 41x+2 2 _ 24x _ 4x 4+2.1). (0.
. (2.. 2. 12) are solu tions for n = 6 and n = 8. This completes the proof.x . 2.1. By Vieta's theorem.40 3. 3. 4) is a solution for n = 7. 6) and (2. a2.2an. 2. 2.1 = 0. . 1 ) is an inte 2 1 then + 1 x2 2 +. xn. and (2. 2. the second one by p16 and using the fact that pq = 1. Solutions to Introductory Problems from which it follows that if (x. 4. xn+l. Thus ap17 + bp16 = 1 and aq 17 + bg16 = 1. Solution 21. 12. 2) is a solution for n = 4.2an. Multiplying the first of these equations by q16. p + q = 1 and pq = 1.2an. xn) _ (a. Problem 21 [AIME 1988] Find all pairs of integers (a. 2. 4. 2. Xn+2. Note that p and q must also be the roots of ax17 + bx16 + 1 = 0..q = (p8 + g8)(p4 + g4)(p2 + q2)(p + q) . an1. 4. and 8. 4. respectively. Since x1 = 1 is a solution for n = 1. we find ap + b = q16 and aq + b = Thus a = p's (1) p 1s 16 pq .) is an integer solution to 2 2 + x2 + xl 1 1 + xn+3 2 = 1. b) such that the polynomial ax17+bx16+1 is divisible by x2 . 3. It is easy to check that (2. 2. Therefore we can construct the solutions inductively if there are solutions for n = 6. 3.. x2.2an. xn+3) = (a1 a2 . 4.. . Alternative 1 Let p and q be the roots of x2 . 7.. xn1.+ 22 n (x1.. ger solution to 1 .i x2.x .
Alternative 2 The other factor is of degree 15 and we write (c15x15C14X14+.2p4g4 = 49 .2 = 47. . 7 . .123+47. + q'6 (p16 + q'6) + pq(p14 + q14) + p2g2(p12 + q12) + .q17 b = pq p16 + p15q + p14g2 + .+c1xco)(x2x1)=ax17+bx16+1.47 = 987. Then k2 = 3 and k4 = 7.843+322 .. Comparing coefficients: x0 x1: x2 : co=1.(p2 + q2) + 1. (p+q)22pq=1+2=3.. k12 = 322. (p4 + q4)2 . klo = 123.=0.c1=1 co . (p2 + q2)2 . let k2n = p2n +q2n.. c2 = 2. For n > 1. and for 3 < k < 15. Solutions to Introductory Problems Since 41 p+q = p2+q2 = p4 + q4 p8 + q8 1.p2g2(p2n + q2n) = 3k2n+2 ..3+ 1 = 1597 or (a.3.... Then k6 = 18. 1597). b) = (987.k2n for n > 3. and k2n+4 = p2n+4 + q2n+4 = (p2n+2 + q2n+2)(p2 + q2) . coc. = = it follows that a = 1 . Solution 21. Hence b = 2207. k8 = 47.3. xk: Ck2Ck1+Ck=O.2p2g2 =92=7.c1 + c2 = 0.18+7. k14 = 843. + (p16 + q16) p7g7(p2 + q2) + p8g8 _ (p14 + q14) + . Likewise. k16 = 2207.. eliminating a in (1) gives p17 .
. let p(n) be the product of the nonzero digits of n.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. Since 3F2n+3 .0. Solutions to Introductory Problems It follows that for k < 15.. However.) Let S = p(1) + p(2) + . Therefore ken = F2n_1 + F2n+i and F2n+1 = ken .) Hence S=4631=(461)(462+46+1)=33. .. Problem 22 [AIME 1994] Given a positive integer n.103... we obtain some interesting facts about sequences k2. Thus a = cl5 = F16 = 987 and b = c14 . it follows that F2. =(0+1+. then p(n) is equal to that digit. 1597).+9)30..0. and the largest prime factor is 103. + (_1)n.+1. (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. since ignoring 0's is equivalent to thinking of them as 1's in the products. ck = Fk+1 (the Fibonacci number)._1 and k2n satisfy the same recursive relation. and F2.ken2 + k2n_4 .5. (If n has only one digit. p(n) is the product of nonzero digits of n. The sum of these products can be found by replacing 0 by 1 in the above expression.F2n+2 = F2. b) = (987. Comment: Combining the two methods. The sum of the products of the digits of all such positive numbers is (0._1.7.42 3. It is easy to check that k2 = F1 + F3 and k4 = F3 + F5.. + p(999).c15 = F17 = 1597 or (a..F2n+4 = F2n+3 ...F2n+5 = 2F2n+3 ..1k2 + (1)n..
Establish necessary and sufficient conditions on x1 and x2 for xn to be an integer for infinitely many values of n. Solution 23. We consider the following cases.4. the yn's for n E S satisfy 1 < yn < 1. the equation becomes 8 cos3 a ... Alternative 2 An easy induction shows that 11x2 11x2 (x1 . Alternative 1 We have 1 21n2 . 2 cos 3a = V 4 cost a 2..Yn1 = 0 for all n. If xn is a nonzero integer when n is in an infinite set S. Solution 23. yn is an arithmetic sequence. Then Yn . i.xn_1 1n2xn1 2 1 xn 1n1 Xn2 Let yn = 1/xn.1)x1 . Setting x = 2 cos a..e. 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. which in turn implies that x1 = x2 = m..4.(n .Yn1 = Yn1 . Solution 24. Since an arithmetic sequence is unbounded unless the common difference is 0. 1.x1)' 1n (n .6 cos a = or 2(cos a + 1).3.1n1 for n = 3.. Yn . Clearly.2)x2 for n = 3... a nonzero integer. this condition is also sufficient. Problem 24 Solve the equation x33x= x+2. 2 < x < 2. .Yn2.x2)n + (2x2 . Alternative 1 It is clear that x > 2.. Solutions to Introductory Problems 43 Problem 23 [Putnam 1979] Let xn be a sequence of nonzero real numbers such that xn = 1n2xn1 2xn2 . 0 < a < 7r.
there is a real number t > 1 such that x = t 2 +t2.nEZ. Since 0 < a < 7r. 2. Hence there are no solutions in this case. and x = 2 cos 47r/7. which has no solutions for t > 1. 1 1 is+ t6 =t+ t. (t71)(t51)=0. Solution 24.or 3a+2=2n7r. Solutions to Introductory Problems from which it follows that cos 3a = cos 22' Then 3a2=2m7r. The equation becomes 1 (t2+)3 3It2+ 2)= 1t2+ 2+2. x = 2. please see the first solution. . the solution in this case is x=2cosO=2. Therefore. For 2 < x < 2.mEZ. Alternative 2 For x > 2. x > 2. Then x34x=x(x24)>0and x2x2=(x2)(x+1)>0 or It follows that x33x>x> x+2. x=2cos45 and x=2cos47 . . x = 2 cos 47r/5. Hence there are no solutions for x > 2.44 3.
+d. Solutions to Introductory Problems 45 Problem 25 [AIME 1992] }. Suppose that all of the terms of the sequence A(AA) are 1..3. so al = (1 ..92)/2 = 819. Hence A = {al.a3. . a3.1)(n .2).19)(1 .a2..b . a2.1)d + 2 (n ..} with the nth term given by an = al + (n . define AA to be the sequence {a2 .92).ab = 0.a) 2 + (a .b)2 + (b . For any sequence of real numbers A = {al. a3 .}. the equation becomes 1 + a 2 + b 2 .. Then AA={d. Multiplying both sides of the last equation by 2 and completing the squares gives (1 .1)... Find al.} with the nth term given by d + (n .1)2 = 0. This shows that an is a quadratic polynomial in n with leading coefficient 1/2. Solution 26 Setting 2x = a and 3x = b. al +d+ (d+ 1).a .d+l.al. a. a4 . and that ai9 = a92 = 0. Problem 26 [Korean Mathematics Competition 2000] Find all real numbers x satisfying the equation 2x+3x4X+6X9X=1.19)(n . Since alg = a92 = 0. al +d+ (d+ 1) + (d+2).d+2.. Solution 25 Suppose that the first term of the sequence AA is d. we must have an = 2 (n ..
which proves the upper bound. On the other hand. 2 . Hence m + n .33)[(m . and x = 0 is the only solution. Our proof is complete. Problem 28 [AHSME 1999] Determine the number of ordered pairs of integers (m. then 333 = (m + n)3 = m3 + n3 + 377in(m + n) = m3 + n3 + 99mn.33 is a factor of m3 + n3 + 99mn .mn + 33m + 33n + 332) = (m + n .333. Problem 27 [China 1992] Prove that 80 16 < ) '<17.46 3. 2 (vrk .k12 801<17.n)2 + (m + 33)2 + (n + 33)2]. 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. If m + n = 33. Solutions to Introductory Problems Therefore 1 = 2' = 3'.33)(m2 + n2 . n) for which mn > 0 and m 3 + n 3 + 99772n = 333 Solution 28 Note that (m + n)3 = m3 + n3 + 3mn(m + n).333 _ (m + n . We have m3 + n3 + 99mn .k1 \ 80 2 1 k1vfk> Therefore 80 1 1: k=1 k <1+2E( k=2 .
a)2].e. a2 + b2 + c2 < 8. are true. (33. (a . and the desired result follows. lb . Solutions to Introductory Problems 47 Hence there are 35 solutions altogether: (0. 33).e.(ab + be + ca) < 4. 32).c)2 + (c . i. a2 + b2 + c2 .cl < 2.3.bi <2. Ic .b)2 + (b . Problem 29 [Korean Mathematics Competition 2001] Let a. i. we have a3 + b3 + C3 . Prove that at least two of the inequalities la . b.b)2 + (b . i. and (33. 33).e. (1.3abc = 2(a + b + c) [(a . a2 + b2 + c2 + 2(ab + be + ca) < 16. Problem 30 Evaluate E 1 . i. 0).e.c)2 + (c . and c be positive real numbers such that a + b + c < 4 and ab+bc+ca>4.a)2 < 8. . Comment: More generally.al < 2 Solution 29 We have a+b+c)2 < 16.
Then both f and g are decreasing and h is increasing.kJ k (2k n) 2n 1 F 2n (2n\ + 2n (2n)! 2 r2zn L \2nJ n 22n1 1 (2n)! + 2(n!)2. It follows that f(x)g(x) = h(x) has unique solution x = a. Then Sn = 1 (2n)! a (n . h(x)=x'. Solutions to Introductory Problems Solution 30 Let Sn denote the desired sum. f(x)=a'.48 3. Problem 31 [Romania 1983] Let 0 < a < 1. Consider functions from W ' R.. x=x°. Solution 31 Taking logo yields a' log. Problem 32 What is the coefficient of x2 when (1 + x)(1 + 2x)(1 + 2nx) is expanded? . Solve for positive numbers x.k)! (n + k)! 1 2n 1 k=o n k=O 1 (2n)! 1 ( n . 9(x) = logo x.
2 + 22n 2 n ) x2 + we have an.1)x + an_1. fn(x) = an. Find the maximum value of I xm . Thus . Let y = xmn.xm = xn(l .2) 3 Problem 33 Let m and n be distinct positive integers.1= 1+2+ Since fn(x) (1+2 nX). we can assume that m > n.xnI = xn . 1).nxn = (1 + x)(1 + 2x) .y)mn) Applying the AMGM inequality yields Ixm .2 + (24 +2 6 ++2 2n ) .1) x + (an_1.xm<xnand0<y<1. SinceO<x<1.1) (2n+1 .2 + 22n2 2 n1 +2 2n 2 n a1. + 2n) 24(22n2 _ 1) _ 1) 2+ 4(2n1 3 22n+2 3.2 = an1.(22 + 23 + .. where x is a real number in the interval (0.n nn (m n)mn . yn(ly)'nn = (mn n n)n ((m nn)y)n(1y)mn n+mn n /n mnny+(mn)(1y) ) 1 (mn) n+m.3.o + an. Solution 33 By symmetry.xmn) = (yn(1 .2 n+1 +2 3 (2n+1 .o = 1 and a . +2=2 ' 1.2 + 22n 2 n = an2. = fn1(x)(1 + 2'Lx) = (1+(2 n . Solutions to Introductory Problems 49 Solution 32 Let + an..1x + It is easy to see that an.2x2 + ) (1+2 nX) = 1+(2 n+1 .xn I.
' . we have xn .. Solution 34 For the sake of contradiction.e. Solutions to Introductory Problems Therefore x m . an are distinct integers.) are integers. Since p(ai)q(ai) = f(ai) _ 1 and both p(ai) and q(a.. Equality holds if and only if x = n/(n + 1).(x . suppose that f(x) _ (x .(x .50 3.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. it is irreducible.an) .al)(x . i.a2).an) . cannot be written as the product of two nonconstant polynomials with integer coefficients. 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..al)(x . Then g(x) = p(x) + q(x) is a polynomial with integral coefficients having degree less than n.. jp(ai)j = q(ai)j = 1 .1.a2). where al. Problem 34 Prove that the polynomial (x .xn+l < nn (n + 1)n+l for real numbers 0 < x < 1..1 is not irreducible. a2.
x . we can assume that x < y < 0. 3. Then (1+x)(1+x2)(1+x4) > 1+x7 > 1+y7. x.y7) . x7 . p(x) = q(x) and Problem 35 Find all ordered pairs of real numbers (x. Thus there are no solutions in this case. xy = 0. 0) is a solution. which implies that the leading coefficient of f (x) must be a negative integer. y > 0 and x j4 y. Then it is clear that x = y = 0 and (x. y) for which: (1+x)(1+x2)(1+x4) = 1+y7 and (1 + y)(l + y2)(1 + y4) = 1 + x7.y8 = (x . By the symmetry. we can assume that x > 0 > y. y < 0 and x j4 y.x and 1.y8 > 0.y the first and the second equation. which is impossible. By the symmetry. we can assume that x > y > 0. and x6 . (1) Since x < y < 0. Subtracting the first equation from the second yields x8 . xy < 0. Solution 35 We consider the following cases. Solutions to Introductory Problems and p(ai) + q(ai) = 0. 2.y < 0. respectively. By the symmetry. y) = (0. the system now reads 1x8 = (1+y7)(1x)=1x+y7xy7 1y8 = (1+x7)(1y) = 1y+x7x7y. x8 .y7 < 0.y6). the lefthand side of (1) is positive while the righthand side of (1) is negative. since the leading coefficient of f (x) is 1.xy(xs .3. Therefore. Multiplying by 1. There are no solutions in this case.y) + (x7 .y6 > 0. 51 Thus g(x) has at least n roots. xy < 0. so g(x) = 0. Then (1 + x)(1 + x2)(1 + x4) > 1 and 1 + y7 < 1. x. 4. 1. . But degg < n. showing that there are no solutions in this case. Then f (x) = p(x)2.
Solutions to Introductory Problems 5. and 1.0. 1. y) = (0. / .52 3.2 for real numbers x.1) = 0. Prove that \1 (a+ a21 j +(a.2)x = 2x+1 . Solution 36 Rearranging terms by powers of 2 yields 2x2x + 2x+1(x2 . 1) are the only solutions to the system.1) + y(2x . 1. they must have the same sign.1 and dividing by 2 on the both sides.1) 2 (X2 + x . x = y. Since f (x) = 2' . (x. 0) and (1. Problem 36 Solve the equation 2(2x .1)x2 + (2x2 . which leads to solutions x=1. Problem 37 Let a be an irrational number and let n be an integer greater than 1. 0) or Therefore. which in turn implies that their sum is not equal to 0. Then solving 1x8=1x+y7xy7=lx+x7x8 leads to x = 0. Therefore (2) is true if and only if x = 0 or y = 0.a2ll is an irrational number. (1) Setting y = x2 . which implies that (x. y) = (0. (1) becomes 211x+2xy(x+y)=0 or x(2y . (2) Hence if the terms on the lefthand side of (2) are nonzero. x(2y 1) > 0.1 and x always have the same sign.1) = 0.
we obtain that bm + 1/b' is rational for all mEN.4xkxk+l + 2xkxk+2) = 1:(x2 + 2xkxk+2) k k=1 k=1 It follows that 1:(xk .X2 + x3)2 (x2 .x4 + x5)2 = x4(x1 + x2 . x5.x5) = x1(x3 + x4 . Problem 38 Solve the system of equations (xl . Solution 38 Let xk+5 = Xk.x2) = x3(x5 + x1 . in contradiction with the hypothesis.x3 + x4)2 = x2(x4 + x5 . Adding the five equations gives s 5 J(3xk .1) and let b=(a+ a21)n. bn +bn =a+ a21+a. ..1) + (a  a2 .. Then N = b + 1/b.x3) (x3 ..3. In particular.x5 + x1)2 (x5 . 2. assume that N is rational. Then by using the identity bm+1 + b +1 = (b + b / (m + b"')  (bm_ 1 +b 11 repeatedly for m = 1. x4. Solutions to Introductory Problems 53 Solution 37 Let N = (a + a2 .x1) for real numbers x1i x2.x4) (x4 .a21=2a is rational. Therefore our assumption is wrong and N is irrational.x1 + x2)2 = x5(x2 + x3 . x3.xkxk+l) = 0k=1 . For the sake of contradiction.
x2. Evaluate 1 1 1 xy+z1 Solution 39 yz+x1 zx+y. a. yz+x1=(y1)(x1) zx+y1=(z1)(x.1) x+y+z3 (x .1)(z .x5) = (a. Likewise.(xy+yz+zx)+x+y+z.1) xyz. a) for a E R. .x4.(x2 + yz + z2) = 1. Therefore S = 2/9. and xyz = 4. a. Therefore the solutions to the system are (x1.1) + (z .54 3. a.x3. Solutions to Introductory Problems Multiplying both sides by 2 and completing the squares yields from which x1 = xz = x3 = X4 = x5.1)(y .1)(z .1).1) 1 1 (x .1)(z . xz+yz+zz = 3. y. But 2(xy + yz + zx) = (x + y + z)z . and Hence S _ _ 1 (x .1 1 5(xy+yz+zx).1 Let S be the desired value.1)(x .1)(y .1) + (y . Problem 39 Let x. and z be complex numbers such that x+y+z = 2. Note that xy+z1=xy+1xy=(x1)(y1).1)(y .
b. 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 . A set of three distinct rational nonzero numbers a. c. Taf is going to arrange the three numbers as the coefficients of a quadratic equation x2+x+= 0. and c. Who has a winning strategy? Solution 40 Mr. Let b=x+bl. . B. Solutions to Introductory Problems 55 Problem 40 [USSR 1990] Mr.a)/4. which implies that 1 is a solution. Therefore 0 < a < 16/5. c.16). and c. Alternative 1 Since the total of b. will do the trick. their average is x = (8 . and let f (x) = Ax 2 + Bx + C.a. b. 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. and it is different from 1. and e is 8 . Then f (1) = A + B + C = a + b + c = 0. Mr. e=x+e1. Let A. Fat wins the game if and only if the resulting equation has two distinct rational solutions. Problem 41 [USAMO 1978] Given that the real numbers a. Fat has the winning strategy. Fat is going to pick three nonzero real numbers and Mr. and e satisfy simultaneously the relations a+b+c+d+e=8anda2+b2+c2+d2+e2=16. Since the product of the two solutions is C/A. d. and C be any arrangement of a. the other solution is C/A. such that a + b + c = 0.3. determine the maximum and the minimum value of a.16a = a(5a . d. b. c=x+c1. d=x+dl. Solution 41.
1 . .) By setting y = x + 1/x. 2n < 3n for all positive integers n.2 In addition. (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.1)2 . which in turn implies that.2x + 1) ./l+a . It follows that x+1=1f x X1.2 = l+ a. Solution 42 We have (x2 + 1)(x2 . if a > 8. Alternative 2 By the RMSAM inequality.ax 2. where a is a given real number. the last equation becomes y22ya=0. Dividing by x2 yields (+!) (x_2+.4 = 1. Solutions to Introductory Problems Solution 41. 1 2 4. then the polynomial Pa(x) has the real zeros 1+ 1+af 2 a 2.l+af a2 I+a2 2 Problem 43 Prove that 1 3 2n . if a > 0.axe = 0. Problem 42 Find the real zeros of the polynomial Pa(x) = (x2 + 1)(x .56 3. then Pa(x) also has the real zeros X3.
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,
+ 1 _n1 2 1 . Problem 48 Find all complex numbers z such that (3z + 1)(4z + 1)(6z + 1)(12z + 1) = 2.n>2.e.x1 + 1 .9) = 768. (w .2xy + y2 = (x . Setting u = 24z + 5 and w = u2 yields (u + 3)(u + 1)(u .33)(w + 23) = 0._1.10w .y)2. which is impossible. Thus our assumption is wrong and both a2 + 62 and c2 + d2 are greater than 1. Solutions to Introductory Problems or 0 > x2 . .X2 + . w2 i.= 768. be the zeros different from 1 of the polynomial 1 . Solution 48 Note that 8(3z + 1)6(4z + 1)4(6z + 1)2(12z + 1) = 768. . (u2 i.1)(u .xn_1 . xn. (24z + 8)(24z + 6)(24z + 4)(24z + 2) = 768.  1)(u2 .60 3. x2. Therefore the solutions to the given equation are z 335 and z= 24 23a5 24 Problem 49 Let x1..3). Prove that 1 1 P(x)=xn1.759 = 0..e.
.. that is. Thus the desired sum is the sum of.1 ai xn2 +...an + aia3.xi = 0.an1 and P = a1...x)n ...3. whose zeros are x1. x2. . .. + 1 X . the ratio between S = a2..X2 x .. xn_1. By the Vieta's Theorem.an + ....xi.an1 ala2..2.. + aia2. n.. let ai = 1 . 1 1 1 1x1 + 1x2 1 1 1 1xn_1 an1 a2 a1 a2a3. ....an + a1a3..e. Alternative 1 For i = 1. (n) Solution 49.ai)n . i..a.x) x (1 ... ..1 _ 1 . + (n) x _ (n) 1and as are the nonzero roots of the polynomial Q(x)..X1 X . Alternative 2 For any polynomial R(x) of degree n1..the reciprocals of the roots of polynomial Q(x).an is equal to the additive inverse of the ratio between the coefficient of x and the constant term in Q(x).an + .1 x Then Q(x) = (1)"x'1 + (1)n1 (n) (1 .xn_1 = R' (x) R(x) .. as/ Q(ai) _ xi .. + a1a2. the desired value is equal to (n S n1 12 P as desired. the following identity holds: 1 + 1 + . Solutions to Introductory Problems 61 Solution 49. Let Q(x) = P(1 .
b 1a +b2 J 2'2 ' whenever 0 < a2 .. + x + 1. Adding the two equations and subtracting the two equations in the original system yields the new system u .1 2 1xn1 R(1) Let a and b be given real numbers. Multiplying the above two equations yields uv(1 .y xz_yz 1x2+y z y .uv) = (a2 . andy=uv.b) 1 a2+b2 (a+b) 1a2+b2 u which in turn implies.62 3. .b2. R(1) = n and R'(1)=(n1)+(n2)+ It follows that 1 +1= n(n1) 2 R'(1) 1 1x1 + 1x2 Problem 50 +.b) l u v.+yandv=xy.x x2y2 = a..u uv = (a+b) 1uv v + v uv = (a . Solve the system of equations x .+ 1 n.b2 < 1. It follows that (a . Solutions to Introductory Problems For R(x) = xn 1 x1 = xn1 + xnz + ..b2)(1 . x=u2v. hence uv = a2 .azbz andv= 1+ a2b2 a+b a2b2 b+a a2b2 1a4..that (xy) = '2 1. Then 0<x2y2=uv<1. b Solution 50 Letu=x. 1x2+y2 for real numbers x and y.uv).
SOLUTIONS TO ADVANCED PROBLEMS .
.
+ (2000) Solution 51 Let 2000 f (X) = (1 + x)2000 = k=0 02000) k xk.u8).u8) . Hence 3 (2 000) + 2000) 5 +.. SOLUTIONS TO ADVANCED PROBLEMS Problem 51 Evaluate 0200 0) 2 + (2000) + 5 (20800) + .))2000 + w2 (1 + w2) 2000 = 22000 + w(w2)2000 + w2(_w)2000 = 22000 + w2 + w = 22000 . By the AMGM inequality. z be positive real numbers such that x4 + y4 + z4 = 1..u8) 1 9 IL 9 J .u8) < f Au8 +8(1 . A(f (u))8 = Au8(1 . y 3 z3 (1 . Let w = (1 + vi) /2.1. Then w3 = 1 and w2 +w+ l =0. Determine with proof the minimum value of x3 1x8+1y8+1z8 Solution 52 For 0 < u < 1. Let A be a positive real number. let f(u) = u(1 .. + (2000) 2000 2 =f(1)+wf(w)+w2f(w2) = 22 000 + w (1 + L.4.1 3 Problem 52 Let x. y.. Thus the desired value is 22000 .
x2 is increasing. 1 Comment: This is a simple application of the result of problem 33 in the previous chapter.z8) (x4+y4+24)439 8 943 8 ' with equality if and only if x=y=z= 43.. Solution 53 For x < 0. and hence [s] > 1. so the equation f (x) = 0 has the unique solution x = 1. Assume that there is a solution s > 0. the function f (x) = 2x + 3x + 6x . Then s2 = 28 + 3S + 68 > 3. which in turn implies that 6S > 4S = (28)2 > s2. .x8) 4 4 Y y(1 . 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 .66 4. But then s > lsj yields 2S > 2isJ = (1 + 1) L.] > 1 + [s] > 8.y8) + z4 z(1 . so s > f . Problem 53 [Romania 1990] Find all real solutions to the equation 2x + 3x + 6x = x2.
1 Problem 55 Let x. Note that an+1+v/'2 a2n+2vf2an+2 an+ 2 an+1vf2Therefore. + 2^1 (Vr.2+1)try anvf2and an = v/2. y.[(vf2.+1)2n+1] (V/2+ 1) 2n . Solutions to Advanced Problems 67 So 2S + 33 + 6S > s2. 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. Find an explicit formula for an. a contradiction. and z be positive real numbers. Therefore x = 1 is the only solution to the equation. 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. a22V12an+2 anv2 an+vf2 (a. . Solution 54 Solving the equation leads to x = fV12.4.
Solutions to Advanced Problems In fact. Thus f is of the form zm(z . zi 54 0 and zi 1 .zk). .1)ng(z). . 2.68 4. for i = 1. Since zi 0 1. Solution 56 Let f(z) = azm(z .(z . Dividing by z2m(z . Then z2m = zm+n. where m and n are nonnegative integers and 9(z) = (z . The given condition becomes az2m(z .. k...`' Likewise. and f is nonzero.. Thus x x < x Vrx (x+y)(x+z) y x+ + xz _ Vrx.zk) _ a2zm+n(z + 1)m(z . with proof. 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. that is..zl)(z2  z2). m = n. squaring both sides of the above inequality yields x2 + yz > 2x yz.1)mg(z). .z2). Problem 56 Find.zl)(z .zl)(z .. (z . so a = 1.1)n(z .+ f+.. 1 .1)n(z + 1)n(z2 .zk) .1)n(z + 1)n.z2) .. all nonzero polynomials f (z) such that f(z2) + f(z)f(z + 1) = 0. which is evident by the AMGM inequality. the last equation becomes 9(z2) = 9(z)9(z + 1).(z2 Thus a = a2.z2 34 0.
3n) = 3n+1 .1)2) = g(r . then rE 1+Vr3i 1Oi . all its roots must have absolute value 1. Lemma For n = 0.1)"n for mEN.1)g(r) = 0. then clearly g must have at least one complex root r 0. Since g cannot have infinitely many roots. Alternative 1 We prove the following lemma. if Iri=I(r^1)21=1. f(3n)=2. Solutions to Advanced Problems 69 We claim that g(z) . and so on. 0.1. g((r .. Now g(r2) = g(r)g(r + 1) = 0.3n.4. Therefore. Now.. Evaluate f (2001).. 1. Suppose not. so the same should be true of r2: r2 E < 1+Vi 1\i 2 2 This is absurd. g cannot have any roots. Solution 57. f (2. Hence. so I (r1)21=1. 1. Clearly.and 2.. g(r4) g(r8) = = 0. 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 g(z) __ 1. 2 2 But r2 is also a root of g. the f (z) are all the polynomials of the form z(z . 2.
let n(3) = ala2 n.. note that f (1) 54 1.3') =3n+1 Then. Since f : N 4 N. There are 3n . For n = 0.70 4. f (1) > 1. for 0 < m < 3n. which is impossible. Hence Proof: f(2) = f(f(1)) = 3. f (3n +. Solution 57. Thus 1 < f (1) < f (f (1)) = 3 or f (1) = 2.32 +23 4 +23 6 + 1 .3n). Solutions to Advanced Problems We use induction. 3n and there are 3n . f (3n+1) = f (f(2 . Alternative 2 For integer n. lag . we can prove that f (n)(3) 2a2 = at if a1 = 1. Since 2001(3) = 2202010. 3n + m) = f (f (3n + m)) = 3(3 n + m) for 0 < m < 3n. f (2001)(3 = 12020100 or f (2001) = 1 . f is increasing. Since f is an increasing function. f (3n) =2. ae0 if a1 = 2. Suppose that for some positive integer n > 1. Hence f (2001) = f (2.3' and f (2.3n+1 and f (2 3n+1) = f (f(3n+1)) = 3n+2 as desired.1 integers m' such that f(3n)=2. .36 + 543) = 3 (36 + 543) = 3816. otherwise 3 = f (f (1)) = f (1) = 1.3n<m'<3n+1=f(2.1 integers m such that 3n < m < 2 .3 n)) = 2..) =23 n + m. at denote the base 3 representation of Using similar inductions as in the first solution. Since f (n + 1) > f (n).37 = 3816. This completes the induction. Therefore f (2 .
1)(x + 1)(x .. I1mkI > Ir1r2.. 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.rk)gk(x).. 1 . Now gk(x) = Mk has exactly k distinct integer roots rl. This value of mk is attained by 9k(x) _ (.mk = (x . . find mk.. so ) Irlr2 .. and none of them is 0. r2i rk are distinct integers. For each integer k > 1.. and let a be an integer such that fk (a) = 1.rl)(x . where qk(x) is an integer polynomial... (1)k+l [k/2]1 hence Mk > [k/2]! [k/21! + 1.1) ('2')(x . rk. Thus. Since Mk > 1. 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. so the constant term of gk is 1. r 2 . Mk = [k/2]! [k/2]! + 1. Let gk be the polynomial in F such that 9k(x) = fk(x + a) for all x. (x ..mk. which equals 1 . Now 9k (0) = fk(a) = 1. Note that rlr2 rk divides the constant term of gk(x) .. .rkl Now rl.mk.4.3 .2)(x + 2) (x + (1)k [k/21) + [k/2]! [k/21 ! + 1.. rkl > 11 (1) 2 . 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.mk cannot be 0.(2).r2) .
Hence 1 1 xn+1 .1 or 1 xn(xn .+1 <121.Si + 1 = 3 and (1) becomes 2 < 3 < 4. i.. For n = 1. the lower bound of (1) follows from Xk+2 .1) > 2 2k1 2 2k1 = 2 2k . which is true. Solutions to Advanced Problems Problem 59 Let x1 = 2 and z xn+1 = xn .1 = xk+1(xk+1 .72 4.1). Prove that 1Solution 59 Since x1 = 2 and 221 x1 x2 1<1+1+..1 = Xn(Xn ..1 which implies that 1 1 1 1 x1 x2 xn xn+1 Thus it suffices to prove that.xn + 1. 22k 1 < xk+1 . Then xn100.1 < 22 (1) We use induction to prove (1). forn>1. for n E N. Now suppose that (1) is true for some positive integer n = k.1) 1 xn . 1 1 1 1 < xn+1 . x2 = xi .e.1 1 xn xn xn . xn is increasing. 2^ xn xn+1 .1 < 22k (2) Then for n = k + 1.1 xn+1 .
Solutions to Advanced Problems 73 Since xk+1 is an integer.f(2x) = f(2f(f(x) + f(f(x)))) . This finishes the induction and we are done.f(2f(x + f(x))).1 = xk+1(xk+1 .1) < 22k (22k . The solution above shows that this condition is not necessary. from which it follows that 22k+1 xk+2 . A similar contradiction occurs if f (f (x)) < x. a contradiction. Solution 60 Setting y = x gives f (2x) + f (2f (x)) = f (2f (x + f (x))). Thus f (f (x)) = x as desired. f(x + y) + f(f(x) + f(y)) = f(f(x + f(y)) + f(y + f(x))).1. If f (f (x)) > x. Comment: In the original formulation f was meant to be a continous function. the left hand side of this equation is negative. 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))) .1 < 22k .11 < as desired. Prove that f(f(x)) = x. so f(f(x) +f(f(x)) > f(x+f(x)) and f(x)+f(f(x)) <x+f(x). Problem 60 [Iran 1997] Suppose that f : R+ R+ is a decreasing function such that for all x)yER+. .4. the lower bound of (2) implies that 22 Xk+1 C and xk+1 .
1 and n .74 4.f((n .2kxy + ky2 = 2kx2 + 2ky2 = 2f (x) + 2f (y). y e Q.1)2f(z) + 2f(z) . We will prove by induction that f (nz) = n2f(Z) for any positive integer n and any rational number z. Then letting x = y = 0 gives 2f (0) = 4f (0). since f(x+y) +f(x .1)z. Solution 61 The only such functions are f (x) = kx2 for rational k.1)z) + 2f(z) .y) = 2f(x) + 2f(y) for all x. so f (0) = 0.y) = k(x+y)2 + k(x . let n > 2 and suppose the claim holds for n .4n + 2 + 2 .2)z) = f ((n . y = z in the given equation we obtain f (nz) + f ((n . .1)z . 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.(n .2.y)2 = kx2 + 2kxy + ky2 + kx2 . Now suppose f is any function satisfying f(x + y) + f(x .1)z + z) + f ((n . thus f (nz) = n2f(Z) for all integers n.z) = 2f((n . The claim holds for n = 0 and n = 1.y) = 2f (x) + 2f (y). Then letting x = (n .1)z) + 2f(z) so f(nz) = 2f((n . Solutions to Advanced Problems Problem 61 [Nordic Contest 1998] Find all functions f : Q > Q such that f(x + y) + f(x .2)2f(z) _ (2n2 .2)z) = 2(n .n 2 + 4n .4)f (z) = n2f(z) and the claim holds by induction. Any such function works.
Prove that the equation x3(x + 1) = (x + a)(2x + a) has four distinct real solutions and find these solutions in explicit form.1+4a 2 show that the four solutions are distinct.x4 = 0.x2 yields the quadratic equation x2+2x+a=0. Thus The first choice a = x+x2 yields the quadratic equation x2 xa = 0. Solution 62 Look at the given equation as a quadratic equation in a: a2 + 3xa + 2x2 .1a<1+ 1a< 1. then for any rational number x = p/q. Thus the functions f (x) = kx2.8x2 + 4x3 + 4x4 = (x + a= 3x + (x + 2x2) 2 2x2)2.x3 . are the only solutions.4. The discriminant of this equation is 9x2 . g2f(x) = f(qx) = f(p) = p2f(1) = kp2 so f(x) = kp2/q2 = kx2. 1+ 1+4a . Problem 62 [Korean Mathematics Competition 2000] Let1<a<1. k E Q. whose solutions are x _ (1 f 1 ++ 4a) 2 The second choice a = 2x . whose solutions are The inequalities 1. Solutions to Advanced Problems 75 Now let k = f (1).
x + 1' xy+xz+2x+y+z+2 < xyz+xy+xz+x. and c be positive real numbers such that abc = 1. 3 (alb + a2c + 1) > 3 a4bc = 3a. By the AMGM inequality. which is evident. Solutions to Advanced Problems Indeed 1+ 1a< 1/+4a 2 reduces to which is equivalent to 2 1a<3. y = b + c and z = c + a. Problem 63 [Tournament of Towns 19971 Let a. x+y+z+2<xyz. 2(a+b+c)+2 < (a+b)(b+c)(c+a). Prove that a+b+l+b+c+l+c+a+1 C1 Solution 63. 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) . or 3a < 4a2.76 4. .1+4a 6 1+4a<6+8a. 2(a+b+c) < a2b+ab2 +b2c+bc2 +c2a+ca2. Alternative 1 Setting x = a + b. b.
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.
3=y3+1=(y+1)(y2y+1) from which it follows that 1 y+l _ y2y+1 3 (2) Combining (1) and (2). b. Then y3=2andx= 3y1. Note that 1=y31=(y1)(y2+y+1). c) = 4 9' 9' 9 is a desired triple. c) such that V321= Solution 66 3a+ 3b+yc. b. .80 4. Let xand y = 32. (a. and y2+y+1= 3y2+3y+3 3 which implies that _ y3+3y2+3y+1 3 .(y+1)3 3 x3=y1= y2+y+1 1 3 (y+l)3 (1) or 'r3 x y+ On the other hand. we obtain x (34 V9 32+1) 2 1 Consequently. Solutions to Advanced Problems Problem 66 [ARML 1997] Find a triple of rational numbers (a.
1 log xn > 2n by the AMGM inequality.4 I + log. + logxn log XI (1 . . Problem 68 [AIME 1984] Determine x2 + y2 + z2 + w2 if x2 2212 +2232 +2252 +2272 =1.. Solutions to Advanced Problems 81 Problem 67 [Romania 1984] Find the minimum of logxl 1 1 x2  4 + logx2 x3  4 + . 1).1/4.. xn are real numbers in the interval (4. xk+1 = 21og xk+l 4 logxk It follows that logxl I x2 .... + logx (ii  1 4 where x1i x2. x is a decreasing function of x when 0 < a < 1 and. . y 2 z2 w2 +4252 +4272 =1. = xn = 1/2. since (x ." xk+i . Solution 67 Since log. (X3 . we have log.. + log x2 109X.4. 8212+8232+8252+8272 .1/2)2 > 0 implies x2 > x .4) + . 4212 +42 32 x2 y2 z2 ..w2 x2 y 2 z2 W2 6212 +6232 +6252 +6272 x2 2 z2 w2 =1.. Equalities hold if and only if x1 = x2 = ...1 > logxk xk+1 = 2 logx..4 ) >  2 log x2 log xi log xn + + log x3 + ..
e.1)(t .49) x2(t . from which it follows that x2+y2+z2+w2= 36. 25.9)(t . Solution 69 Let f (0) = a.e.16) (t .9)(t . . we find that for all values of t for which it is defined (i.25)(t . P(t) = (t . y E JR.25) (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. and 64. (1) is equivalent to the polynomial equation P(t) = 0. Since the range of a2+y consists of all real numbers. 9. and 64.82 4. Multiplying to clear fractions. 16. where P(t) = (t .25) (t . z2. i. P(t) = 0 has exactly four zeros t = 4. and 49). Solutions to Advanced Problems Solution 68 The claim that the given system of equations is satisfied by x2. y2.y2(t . 36. 36.49) z2(t1)(t9)(t49)w2(t1)(t9)(t25).49) .1)(t . for all y c R. Since deg P(t) = 4.. t 0 1..16. Problem 69 [Balkan 1997] Find all functions f : R + R such that f(xf(x) +f(y)) = (f(x))2 +y for all x.64). f must be surjective. Setting x = 0 in the given condition yields f(f(y)) = a2 + y.4) (t .36)(t . and w2 is equivalent to claiming that x2 t12+t32+t52+t72 =1 y 2 z2 w2 (1) is satisfied by t = 4.
After 1999 such operations. Setting x = b in the given condition yields f(f(y)) = f(bf(b) + f(y)) = (f (b))' + y = y. f (y) = y.4. one obtains exactly one number c on the board. say. b). Note that (f (y))2 = y2. a function which satisfies the given condition. for all x. Suppose that f (x) 54 x. Problem 70 The numbers 1000. It follows that. that is. 1001. Setting x = cf (c) + f (y) in (1) yields If (cf (c) + f (y))]2 = [cf (c) + f (y)]2 = [c2 + f (y)]2. one is allowed to erase two numbers. 2999 have been written on a board. Each time. Solutions to Advanced Problems 83 Thus there exists b E R such that f (b) = 0. y E R. Prove that c < 1. and replace them by the number 2 min(a. (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. Then there exists some nonzero real number c such that f (c) = c. (f(x))2 = x2 (1) It is clear that f (x) = x is a function satisfying the given condition. for allyeR. . setting x = c in the given condition yields f(cf(c) +f(y)) = (f(c))2 +y = c2 +y. It follows that (y)]2 [c2 + f or = (c2 + y)2. and. a and b. for all y E R. Therefore the only functions to satisfy the given condition are f (x) = x or f (x) = x. for all y E R. for all y E R. . for x E R.
1000 (1001 1 2999) 1 (1002 1 2998) (1999 2001 1. + l+a.e.. we may assume a < b. for 1 < k < 999. . Hence f(x)= 1+a. Note that. Then a min(a.k2 > 20002 100 Rearranging terms in S yields C .x++ l+a.x .k + 2000 + k 20002 . .. as desired. not all zero. be real numbers. Prove that the equation 1 +a1x+ l+a2x+ has at most one nonzero real root. Problem 71 [Bulgaria 1998] Let al.. 1 1 _ 4000 4000 1 2000 .84 4. x = n Solution 71 Notice that fi (x) = 1 + ax is concave. a. 2000 1000 + 1000 x 2000 or c < 1. Solutions to Advanced Problems Solution 70 By symmetry. a2. At the beginning this sum is S _ 1 1 1 1 1000 + 1001 + + 2999 < c' where 1/c is the sum at the end. the sum is a monovariant)...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.
x).1). 1]. For n = 1. a contradiction. f1(1) = {1/2}. Problem 72 [Turkey 1998] Let {an} be the sequence of real numbers defined by a1 = t and an+1 = 4an(1 . 1]) = [0. Observe that f1(0) = 10. 11. and I{y: f(y)=x}j =2 for allxE [0. Alternative 1 Let f (x) = 4x(1 . we have three real roots x1 < x2 < X3.an) forn> 1. we have A1= Ix GRI f(x)=0}= [0. Applying the MeanValue theorem to f (x) on intervals [x1i x2] and [x2i x3]. Then x c An+1 = f (x) E An C [0. 1]. so An+1 C [0. 1]. Now suppose n > 1 and An C [0. our assumption is wrong and there can be at most one nonzero real root for the equation f (x) = n. and IAnI = 2n1 + 1. we can find two distinct points on the curve with derivative 0.4. For how many distinct values of t do we have a1998 = 0? Solution 72. 1 E An. there can be at most one point on the curve y = f (x) with derivative 0. 1 E An. f1([0. 85 Since f'(x) exists. Suppose there is more than one nonzero root. . then An+1 = {x E 118: f n+1 (x) = 0} = {xER: fn(f(x))=0}={xER: f(x)EAn}. Solutions to Advanced Problems is concave. Let An = {x E R : fn(X) = 0}. An C [0. 1]. Therefore. Since x = 0 is also a root. 1}. and An I = 2n1 + 1. 1] = x c [0. 1]. We claim that for all n > 1. and the claims hold.
. Alternative 2 As in the previous solution.86 4.}l I{x : f (x) = all aEA.+1 Now we have jAn+1 j l{x : f (x) E A. l{x: f(x)=1}I+ aE[0.. . a1998 = 0 if and only if f 1997(t) = 0. 1]. Now choose 0 E [0.. ..sine 0) = 4 sin 2 O cost 0 = sin 2 20. 7r/2] such that sin 0 = V. Solutions to Advanced Problems Since f (0) = f (1) = 0. Solution 72. f (sine ¢) = 4 sin20(l . so there are 21996 + 1 such values of t. Therefore a1998 = 0 sin 2 19970 = 0 0= k7r 21997 for some k E Z. a1998 = sin 2 219970. observe that if f (x) E [0. Observe that for any 0 E R.. a3 = sin 2 40. 1]. Finally. we have f'+1(1) = 0 for all n > 1. it follows that a2 = sin 2 20. Thus the values of t which give a1998 = 0 are sin2(kir/21997) k E Z. since a1 = sine 0. 1] then x E [0. giving 21996 + 1 such values of t.. so 1 E A. so if a1998 = 0 we must have t E [0.1) Ifx : f (x) =all aEA Thus the claim holds by induction.
We claim that the functions f. 1} such that f (a) = f (b). Therefore. we are allowed to define f as an even function such that f (x) = y2. b E {1. 0. where y is such that g(fy) = x. g described above satisfy the conditions of the problem. 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 . Note that g is even and jai = JbI whenever g(a) = g(b). whence x E {1 0 1} x3 = x = f (X) = [ f (x)]2 = f (X) E {0. But then a3 = g(f(a)) = g(f(b)) = b3. It is clear from the definition of f that f (g(x)) = x2. 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. 11. (b) Let g(x) = Ixl'n 1x1 IxjInlyl if Jxi > 1 if 0 < JxJ < 1 0 ifx=0. a contradiction. thus. the desired functions f and g do not exist. there exist different a. Thus.4.
_ (bib2 .. bn )n'..an > b1b2... n. Then bi+b2+ +b'<nak.. let ai=ak andbi=bi+aka. .an bi + b2 + .. > 0. > Y x+c y+c x>yandc>0. Alternative 2 W e define two new sequences.ak ai ai = ak and bi = Then ai . (1) Note that.bi=ak or (a' b. let b. for 1 < i < k and bi>a.. ..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.(ai _ bi) bak = ak(aib. Solution 74.) a. Prove that a1a2. 2... bnakn aia2. <an.Y) (Y + c) > 0.ai)(ai . For i = 1 . Alternative 1 We define two new sequences. Solution 74. Solutions to Advanced Problems Problem 74 [Weichao Wu] Let0<a1 <a2 .< n + bn < ak from which the desired result follows. bn. ai = (ak .fori>k. Therefore flak Applying the AMGM inequality yields b1b2 .88 4. For z = 1.. . .) .bi) ai >0. . 2. for cy(x .... n..
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.
Then 1_ xyi z x2 + y2 Thus the last equation becomes z+3i=3 z or z23z+(3i)=0.92 4. Therefore. Let z = x + yi. It follows that y 0 and 3y + 1 2y . y) = (2. Problem 78 [Kvant] Solve the system of equations: 3xy x+ x2 + y2 =3 x+3y yx2+y2=0. and adding up yields 2xy + (3x . the second by x. y) Solution 78.y) +(x + 3y)i 3 x2 y2 or x+ya+3(xyi) . Solutions to Advanced Problems Thus. Hence Z= 3f 3+4i 2 = 3±(1+2a) 2 that is. Solution 78. Since a is nonzero.  i(x .yi) x2 + y2 x2 + y2 = 3.y)y + (x + 3y)x = 3y. Alternative 1 Multiplying the second equation by i and adding it to the first equation yields x+yi+ (3x . (x. either f(x) = x2 or f(x) = 0. 1) or (x. x2 y2 or 2xy . 4a2f(X) = 0 for all x. Alternative 2 Multiplying the first equation by y.1 = 3y. f (x) = 0 for all x.
Problem 79 [China 1995] Mr. They fill in real numbers to empty spaces in turn. Fat wins. 1) and (1. We say a blank space is odd (even) if it is the coefficient of an odd (even) power of x. there will be at least one odd space left after 2n . Since there are only n .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. Taf has a winning strategy. Fat goes first. First Mr.2y 1 12 + y2  13 2y 1 I . Solutions to Advanced Problems 93 Substituting this into the second equation of the given system gives y (. Mr. .. the given polynomial becomes p(x) = q(x) polynomial. If Mr. if there are any.3 plays. that is. Taf play a game with a polynomial of degree at least 4: x2n + _x2n1 + _x2n2 + .4. Taf wins. Taf can simply fill in a in front of xs and win the game. Taf will fill in arbitrary real numbers into one of the remaining even spaces.. or 4y43y21=0. Fat and Mr.3y = 0. Mr. + x + 1. otherwise.1 even spaces. +_xs +_x2t1 where s and 2t . If the resulting polynomial has no real root. It follows that y2 = 1 and that the solutions to the system are (2. who has a winning strategy? Solution 79 Mr. 1).
94 4.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.1. Note Now we prove our claim. 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.F(0) is a multiple of k + 1 not exceeding k in absolute value. since F(k + 1) . 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. Our proof is thus complete. 2s2t+1 + (_1)s O 0. 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 . It follows that either p(1) = p(2) = 0 or p(1. p(x) has a real root regardless of the coefficient of as claimed. . then F(0) = F(1) F(k + 1)..) and p(2) have different signs.F(0) = x(x . Consider any polynomial F(x) with integer coefficients satisfying the inequality 0 < F(c) < k for each c E 10. Note first that F(k + 1) = F(0)..1)G(x). .k . which implies that there is a real root of p(x) in between 1 and 2. In either case.. ..1. We start by proving that it does hold for each k > 4. 1. Solutions to Advanced Problems x2t1 in p(x). k + 1}... Hence F(x) .k+1.
Note that the set {2. More exactly.2)(x . (2) where H(x) is a polynomial with integer coefficients. and for any c in this set. We established that the statement in the question holds for any k > 4.4.x) F(x) = x(4 .. Fork > 4. for k = 3. for k = 2.c) > k holds for each c {2. as it is equivalent to (c .k . k}. .1)(k . .F(0). Taking this into account. k . k .. (k . IH(c)j. But the proof also provides information for the smaller values of k as well.x)(x .2)! .1)H(x).2)! > 1. it is not hard to find the following counterexamples: F(x) = x(2 .. k .k + 1)(x .c)IG(c)I for each c E { 1.2)2 for k = 1.x) F(x) = x(3 . Since G(c) is an integer.. 2. 3. Note that for c = 1 and c = k.. and if k > 3 then 2 must also be a root of F(x) .. . 3.1} is not empty if k > 3.F(0)j = (k . k > IF(c) .c) > 0.. . Solutions to Advanced Problems 95 where G(x) is a polynomial with integer coefficients. .3).. (2) implies that k > IF(c) . Thus F(x) . G(c) = 0.F(0) = x(x . Consequently. (1) implies that JG(c)j < 1. (1) The equality c(k + 1 . .F(O) I = c(k + 1 . To complete the proof of our claim.(x . Hence H(c) = 0.. 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}. it remains to show that H(1) _ H(k) = 0.
F2n) . Prove that 3 F2n  F2n3 +2 + F2n_2 9 3 ..2)F2n2 .F2n2 F2n  F6F2 .+2 2.9F2n = 9F2n(F2n+2F2n2 . 2.F3 .9F2n+2F2nF2n2 = 0. b = F2n+2.Fn+2=Fn+i+F.F2n = F2n(3F2n2 ...2F2n for alln>2. . Setting a = 3F2n.F 22n) _ 9F2n.. Solutions to Advanced Problems Problem 81 [Korean Mathematics Competition 2001] The Fibonacci sequence Fn is given by Fi=F2=1.+1 .F3 .2 .F2n2 = 0 (1) for alln>2.3F2n = F2. whence 3F2n .F2.F2n = F2n2. The desired result follows from 9F2n+2F2nF2n2 .96 4.F4 = 1. (nEN).2F2n = F2n1 . Applying (1) twice gives F2n+2F2n2 = (3F2n . and c = F2n_2 in the algebraic identity a3+b3+c33abc=(a+b+c)(a2+b2+c2abbeca) gives 27F23. Solution 81 Note that F2n+2 .F2n2 = F2nF2n4 .F2n+2 .
1) for all x. y E R. First.1.1 = (a' . Now suppose u : R .R. a E R+. Thus. It follows that there exists C E R such that u(x)1 _G f(x) for all x 0. .1 f(x) f(Y) for allxy00. this equation also holds for x = 0.u(0)) for all x.1 = f(x)u(y) + f(y) 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. That is. y E R. we have f(x)u(y) + f(y) = f(x + y) = f(x) + f(y)u(x).1 _ u(y) . which would contradict the fact that f is strictly monotonic.4. u(x) = 1+Cf (x) for x 0 0. so we must have u(0) = 1 and f (0) = 0. u(0) 1 would imply f (x) = f (0)/(1 . we obtain f (x) = f (x)u(0) + f (0) for all x E R. Thus. We must show that u is of the form u(x) = a' for some a E ][8+. y E R. or f(x)(u(y) . since u(0) = 1. take f (x) = a' . Then f (x) 0 0 for all x A 0. f (0) = 0. take f (x) = x for a = 1. letting y = 0. then f(x + y) = a"y . Solution 82 The solutions are u(x) = ax. To see that these work.1) = f(y)(u(x) . If a # 1. 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. u(x) . Next.1)ay + ay .
. and Q3 be three rays from origin that form angles of 60°. 3. then u(x) = 1 for all x. 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.. and u(x) _ 1/u(x)forallx.. zn be complex numbers such that IZiI+IZ2I+.. . we have u(x) = ax for allxER. .+IznH = 1. with the positive xaxis. z } such that I2z zES 6 Solution 83. . Alternative 1 Let fl. Problem 83 [China 1986] Let Z1. Solutions to Advanced Problems If C = 0. and 300°. For i = 1. x E R. then u(n) = a" for all n E N.. at least one of the above sums is not less than 1/3.gEN. Thus all solutions are of the form u(x) = ax. including the ray L.i Izkl + E zkl + E Izkl. Then 1= zkER. Since u(x) = 1 + C f (x) for all x. a E R+. let Ri denote the region between Li and Li+1 (here P4 = f1). Let a = u(1) > 0. ZkEIZ2 zkE7Z3 By the Pigeonhole Principle. Since u is monotonic and the rationals are dense in R. Z2.sou(x)>0forallxasu(0)=1. u is strictly monotonic. 22.. respectively. . Prove that there exists a subset S of {z1.. Otherwise.98 4. and we are done. and u(p/q) = (u(p))1/1 = aplq for allpE7L. z2. y E R. Thus u(nx) = u(x)" for all n E Z.sou(x)=ax for allxEQ. 180°. 2.
let Zk = xk + iyk.. at least one of the above sums is not less than 1/4. 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)..4. By symmetry. . Then 1 = C Iz11+Iz21+.. 1: Zk zk ER3 as desired.+lznl (Ix11+Iy11)+(ix21+1y21)+. which does not effect the magnitude of a complex number). we may assume that 4 <_ Ixkl xk>0 Consequently.. 1 E Xk > 2 Zk ER3 zk ER3 zkl>2 1 36 1 1 Solution 83. Xk = IxkI > Izkl/2. Problem 84 [CzechSlovak Match 1998] A polynomial P(x) of degree n > 5 with integer coefficients and n distinct integer roots is given.+(Ixnl +Iynl) >IxkI+1: lxkI+1: lykl+1: lyklxk>0 xk<O Yk>0 Yk<O By the Pigeonhole Principle.. . Then for Zk E R3.. E Zk xk>O 1 4 Comment: Using advanced mathematics. we apply a rotation. . Consequently. zn} such that Ez zES 4 For 1 < k < n. Let Zk = xk + iyk. Solutions to Advanced Problems 99 Say it's R3 (otherwise. the lower bound can be further improved to 1/7f.
2). so P(k)I < Irnl.x) reaches its minimum value at an endpoint x = a or x = b. ri and IkI < Irnl. Also note that P(k) = ri0 for some io. 2.(x . the function f(x) = x(c . Let P(x) = a(x .100 4.1.rn.rn)I >.r2) (X . tion.. b].)I. Since the ri are all distinct. a < b.rl.1)(x ...riI > 1 for all i.. Since n > 5. c be real numbers. a contra ..rn)I = Ikllrn .rl)(x . IkI > rnl. But then it is impossible to have k diction.kI > IkI(Irnl kI) > Irnl 1. For x E [a. that P(P(k)) = 0 for some integer k such that P(k) 0. ri = 0 < Ir2l < Ir3l < . at most two of I k . 1. Thus Ik(k .r3I I k .1)I > allkr2llkr3llkr4I > 2. or at both endpoints. Now we consider the following two cases: 1.. Suppose.rn)I > 2IkI > Irnl. Then IP(k)I > 2Ik(k . 1 < IkI < Irnl . on the contrary. this is only possible if P(x) = (x + 2)(x + 1)x(x .r2 I .. IkI < Irnl.r4I equal . < Irnl.(kr.r3). Solutions to Advanced Problems Solution 84 The roots of P(x) are clearly integer roots of P(P(x)). that is.. b.rn). We prove our claim by contradiction.. a contradicLet a..r2i..2(Irnl 1). I k . and P(k)j > 2I k(k . which implies that Irnl < 2. we claim there are no other integer roots. where a. so Ia(kr2). It follows that Irnl > IP(k)I > 2Ik(k . we must have I k . Since P(k) 54 0.rn are integers.
Since xns are increasing for n > 1.. and xn+1 = xn + yn Yn+1 = 1+ l+y2 for all n > 1. Solution 85. Xn Xn xnyn= = xn1 Zn Note that 1 +n.. V 1 + xn1' Thus 3xn_1 > xn.. which leads to the upper bound of the desired inequal 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 . and the integer roots of P(P(x)) are exactly all the integer roots of P(x). XI = y1 = V . this means that Zn = xn_1 for all n > 1. Also note that z2 = f = xi i since the xis and zis satisfy the same recursion. . are defined in the following 1 + xn..4..1 > xn1 n_ Thus Xn > 2xn_1 and XnYn > 2. Prove that 2 < XnYn < 3 for all n > 1. we have 2 2 xn_1 > x1 = 3 > 1 3' which implies that 2xn_1 > ity. Problem 85 [Belarus 19991 Two real sequences x1i x2. and y1i y2i way: . Alternative 1 Let zn = 1/yn and note that the recursion for yn is equivalent to zn+1 = Zn + 1 + zn. which is the lower bound of the desired inequality. . Thus. Solutions to Advanced Problems 101 Thus our assumption was incorrect..
It is always possible to dissect interval Ik = [0. b).P(a). (a. Lemma Let t be a positive real number. b] (a. Solution 86 For an interval i. and let k be a positive integer. b).102 4. It follows that xnyn = I . We prove a more general result. the total difference of P(x) on the red intervals is equal to that on the blue intervals. we also have tan2o n < so that xnyn < 3. Solutions to Advanced Problems Since 01 = 30°. tang On is positive and xnyn > 2. let / P denote the difference of polynomial P on i. . Prove that it is possible to dissect the interval [0. For a positive real number c and a set S C_ IR. for every quadratic polynomial P(x). Problem 86 [China 1995] For a polynomial P(x). 1 Comment: From the closed forms for xn and yn in the second solution. we have in general 0. b]) as P(b) . 2kf] into a finite number of intervals and color them red and blue alternatively such that. we can see the relationship 1 yn xn1 used in the first solution. the total difference of P(x) on red intervals is equal to that of P(x) on blue intervals. 1] into a finite number of intervals and color them red and blue alternately such that. let S + c denote the set obtained by shifting S in the positive direction by c. And since for n > 1 we have Bn < 30°. for every polynomial P(x) with deg P < k. What about cubic polynomials? ([a. = 2 0 1. define the difference of P(x) on the interval [a. Similar calculation shows that yn = tan(2Bn) _ 2 tan 0n 1 .tang On Since tan On 54 0.tan 2 Bn 2 .
Then deg h < n. for any polynomials P(x) with deg P < n. Suppose that the statement is true for k = n. c1] are in the same color. It is easy to see that a linear or constant polynomial has the same difference on the two intervals. Orh. But note that if intervals i1 = [a1i b1] and i2 = [b1. > rERn Abf + E Or9 _ E Arf + E Obg bEBn rER. then Ai1f + 22f = 23f7 where i3 = [a1i c1]. Now consider polynomial f (x) with deg f < n + 1. Define g(x) = f(x + 2n1) and h(x) = f(x) . U Bn = In. For k = 1. 1] and (2. .4. for any polynomial f with deg f < n + 1. we can just use intervals [0. Solutions to Advanced Problems 103 Proof We induct on k. 21]. = 0.g(x). where n is a positive integer. the total differences of P on Rn is equal to that of P on B. that is. and Bn+1 = Bn U (Rn + 2n1). R. and. rEBn It follows that obf = bEBn+l rER'ri}1 where Rn+1 = Rn U (Bn + 2n1). that number may be removed from one of them. By the induction hypothesis.) It is clear that Bn+1 and R'+1 form a dissection of In+1 and. there exists a set Rn of red disjoint intervals and a set Bn of blue disjoint intervals such that Rn f1 B. or =rER. Obh bEB. (If R'+1 and both contain the number 2n1. 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).
where m. The given polynomial becomes x(x . it is clear that the answer to each of the given questions is "yes.104 4. Fat then picks the number (mnp)2.+i This completes the induction and the proof of the lemma. Fat can pick 0 first. Taf are playing the following game. Let the polynomial be x3 + axe + bx + c. In one move. bEB. obf = > orf. Taf chooses a = 0. Mr. Mr. Fat chooses a real number and Mr. Who has a winning strategy? Solution 87 Mr.+l rER. in Bn+1 URn+1. Thus. there exists a dissection In+1 = Bn+1 U Rn+1 such that.mnp) (x + mnp). Solutions to Advanced Problems Thus. If Mr. Taf puts it in one of the empty spaces. . We consider the following cases: (a) Mr. Mr. Mr. Setting first f = a and then f = a in the lemma. Fat wins the game if the final equation has three distinct integer roots. Fat will choose c = 0. yielding the polynomial equation x3+bx+c=0. and p are three positive integers such that m2 + n2 = p2. Fat has a winning strategy. Fat and Mr." Problem 87 [USSR 1990] Given a cubic equation x3+x2+x+_=0. After three moves the game is over.. n. Taf chooses b = (mnp)2.. Mr. we can simply put consecutive same color intervals into one bigger interval of the same color. for every polynomial f (x) with deg f < n + 1. then Mr.
yielding the equation x3+ax2+c=0. where m is an integer greater than 1. The given polynomial becomes (x + m2)(x + n2)(x . Solutions to Advanced Problems 105 If Mr. The polynomial becomes (x + mq) [x . Taf chooses b = 0. Fat can choose a=(m2+m+1)2. Mr. Taf chooses c=m2(m+1)2(m2+m+1)3. The polynomial becomes (x . where q=m2+m+1.p2m2.4.mp) [x + (m + 1)P1 [x + m(m + 1)p]. then Mr.(m + 1)q] [x . then Mr.n2p2 . Fat will choose b = m2n2 .m(m + 1)q]. where p = m2(m + 1)2(m2 +m+ 1)2. Taf chooses c = (mnp)2. If Mr.p2). If Mr. . Fat then picks the number m2(m+ 1)2(m2 +m+ 1)3. Fat can choose c = m8(m + 1)8(m2 + m + 1)6. Taf chooses a = m2(m + 1)2(m2 + in + 1)3. (b) Mr. then Mr.
1)(b . for each of k = 1.21.. The polynomial becomes either x(x .0. Fat needs only to pick two integers a and b such that ab(a . a b 3. .42 c .49. Mr..106 4.1)(x .1 0.1)(x . 8..rz/n. j=1 .60 c " 4.49 14. n. Fat and Mr. Then the problem reduces to problem 40 of the previous chapter.7 49 3 3 481 16. j=1 In particular.a) or x(x .9. n f(z + W) = 0.9. 42749.25 8.0 and a + b = 1. Then the condition is that for any z E C and any positive real t.9. 1.0.. . . Prove that f is the zero function. An... Solution 88 We identify 1182 with the complex plane and let ( = e2.7 a 2 3 . we obtain f(z_(k+(')=0. Our proof is complete.b). Taf could do: F 0 T a b F T b F 0 3600 " Roots 60. Taf chooses c = 0. .1) yc. c 2 . 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 . f(A1)+f(A2)+.27.) =0. Below is an example of what Mr. Solutions to Advanced Problems (c) Mr.+f(A.
.1)(p  2).2.0 (mode).2. we have n n EEf(z(1(m)(k)=0. assume that d < p .. 1. . m=1 k=1 For m = n the inner sum is n f (z). for other in.1.k ... that is. p . .2)! Setting x = p . Solution 89. Alternative 1 For the sake of the contradiction.. 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 . f (k) p2 k=0 k!(1)pk (p ..1) . S(f) := f (0) + f (1) + . Thus f (z) = 0 for all z c C. Prove that d > p . p2 f(x) f(k)x. hence is 0. (ii) for every positive integer n. Then by Lagrange's interpolation formula the polynomial f (x) is determined by its values at 0.(p .k . the remainder upon division of f (n) by p is either 0 or 1..k + 1)(x .1). the inner sum again runs over a regular polygon... Solutions to Advanced Problems 107 Summing over k.(x .. f (1) = 1. + f (p . (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).4.(x .p + 2) k=0 k.
and let f (x) = ap_2xp2 + . Solution 89. p ... + alx + a0.. So S(f) A 0 (mod p). Therefore. it follows that Si . The statement is true for i = 0 as So = p.0 (mod p). Thus our original assumption was wrong.2. Then P1 p1 p2 p2 P1 p2 S(f) _ k=o P1 1 a k=0 i=0 i=0 k=0 aiSi.1..0 p . This completes the induction and the proof of the claim.0 (mod p) for some 1 < i < We claim that Si .2. p2 S(f) = i=o aiSi . .Si1 . . where j denotes the number of those k E {0.. (ii) implies that S(f) . p . . Now suppose that So . . 1. 1. We use strong induction on i to prove our claim. The rest is the same as in the first solution.1} for which f (k) . . But (i) implies that 1 < 7 < p . 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..2. Solutions to Advanced Problems On the other hand. Alternative 2 Again. Assume that d < p . and our proof is complete.1 (mod p).108 4. we approach the problem indirectly. which contradicts M.0 (mod p).7 (mod p). i0 where Si = k=0 (mod p) for all i = 0.Si .
(n . a1. Solutions to Advanced Problems 109 Problem 90 Let n be a given positive integer. n+1 n (1) 2nk+2 <ak < 2nk We use induction to prove both inequalities.k)2 n (2nk+1)(2nk1)=(2nk)z1 <(2nk)2.. a y = ak+i < 2n . n. n. . .. Consider the sequence ao. for k = n .. Alternative 1 W e prove a stronger statement: For k = 1 .1 n ak < 2n for some positive integer k < n.. Prove that . n Solution 90.1 1. Thus our induction step is complete. 2.1) . with ao = 2 and z ak_1 ak = aki + n .4. 2. In particular.1. a. for k = 1.1 <a. We first prove the upper bound.. 1. Then ak ak+i Ti k' (n + ak) Cn + 2nn k 2n 1 k < as 2nk1' n(2n .k + 1) (2n . For k = 1. .<1.. . it is easy to check that ai Suppose that _1 2 1 _ 2n+1 4n + 4n n < 2n .
2.110 4. we obtain n+1 anak+1> 2n(n1)+1 as desired... This complete the induction step.2n . Thus 1 an > an1 > .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 . In particular. It is clear that aks are increasing.1.. Now we prove the upper bound. Solutions to Advanced Problems as desired.. 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..n. . 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. Then It follows that n+1 ak+1 . _n+1=In+2 >1n n+2 Solution 90. for n = k . > ao = 2..2nk+1 ) 1 > 0. For k = 1.
Then (2) implies ak_1 ak n+ak_i > n+ for k = 1. Telescoping summation gives 1 ao or 1 1 . since aks are increasing. and. 2.an = 0 has precisely one 1 jai. 2 = ao < ak < an < 1 for k=1.2. (a) Prove that xn ... an < 1.. . Solutions to Advanced Problems 111 Thus (2) implies that 1 1 1 ak1 ak n for k = 1. n.n.aixni positive real root R. . . Problem 91 [IMO 1996 short list] Let a1.. .... (b) Let A = > 1 aj and B= Prove that AA < RB.. an ao that is. . Since an < 1.1 <1 an >1=21=1. which gives the desired upper bound. n. . an be nonnegative real numbers.an_ix . a2.. .. 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. 2. . not all zero.4. an > n+1 _ n+2 n+2 > l n' which is the desired lower bound.
c3 l 1nRj n 1n l =ln(f(R))=0. Since . Then cjs are nonnegative and E cj = 1. we obtain the desired inequality. Solutions to Advanced Problems Solution 91 (a) Consider the function f(x)= 1.+ a2 x an 2+. First we prove that P(x. y) with real coefficients such that P(x. Problem 92 Prove that there exists a polynomial P(x. by Jensen's inequality. Comment: Please compare the solution of (a) with that of the problem 15 in the last chapter.112 4.+Xn.In x is a convex function on the interval (0. Solution 92 We claim that P(x. Hence there there exists a unique positive real root R of the given polynomial. .7 = aj/A.. that is. It follows that lnA+jlnR) > 0 j=1 or n n 1: cj In A < E jcj In R. y) > 0 for all real numbers x and y. oo). (b) Let cj = aj/A. y) > 0 for all real numbers x and y. j=1 j=1 Substituting c. unique real number R such that f (R) = 1. which cannot be written as the sum of squares of polynomials with real coefficients.1)x2y2 + 1 27 is a polynomial satisfying the given conditions. y) = (x2 + y2 . Note that f decreases from oo to 0 as x increases from 0 to oo..
1 < 0.y) = Atix3 + Bix2y + Cxy2 + Diy3 +Eix2 + Fixy + Giy2 + Hix + Iiy + JJ. y)2. .1 > 0. Then. For the sake of contradiction. y)2. Comparing the coefficients. We are left to prove that P(x. of terms x6 and y6 gives or Ai = Di = 0 for all i. y) cannot be written as the sum of squares of polynomials with real coefficients. Thus. if x2 + y2 . y) = Bix2y + Cixy2 + Fixy + Ji. Y) = i=1 Q. then applying the AMGM inequality gives (1x2y2)x2y2 < or 1x2y2+x2+y2 3 1 (  3 ) . Thus Qi(x. assume that n P(x. then it is clear that P(x. or Hi=12=0 for all i. deg Qi < 3. in P(x. y) > 0. Since deg P = 6. comparing those of x4 and y4 gives n n Ei i=1 i=1 Gi =0. or Ei = Gi = 0 for all i. y) > 0.27* 1 27' (x2 +Y 2 1)x2y2 > It follows that P(x. y) and En 1 Qi(x.4. Next. (X. Qi(x. comparing those of x2 and y2 gives n I2=0. Solutions to Advanced Problems 113 If x2 + y2 .
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)! n(x + 1).(x + n) _ Note that x 1 1 n(x+n) It follows that n!x n x+n n(x + ..1)! (x + n) .1)! + 1)..4..1) .f(x) _ 00 1 (n . (b) Let 00 (n .1)! 1) n! (x + (x + n)' and this telescoping summation yields the desired result. (x + n) _ (x + (n .. x In particular. by (a). f (x) < 1. f (x) converges to 0 as x approaches oo....1) . we have to show that E °O n!x n(x + 1).1) 1 X 1 E (x + 1) (n . (a) Equivalently.. Solutions to Advanced Problems 117 Solution 94 We use infinite telescoping sums to solve the problem. the result in (a) gives 00 f(x .f (x + k)].(x + n . k=1 (1) On the other hand. so we can write f as an infinite telescoping series f (x) _ )[f (x + k .
< X3n2.n3} be a set of 3n2 elements. a set of cardinality n31 k=1 1= n3(n3 .a1. The domain of f contains n6 elements... 2. {x2n2+1. cx) (i = 1... zo) in nonzero integers. yo. z = a1 .. ... and let XCS={1.. xn2 }.c1i y = c1 .b).. . . 3) map to the same pair. is contained in the subset of S x S of pairs whose sum is at most n3.x3n2}.bl is a solution in nonzero integers. The range of f. some three triples (a2. 3) in X such that the system alx+bly+clz = 0 a2x + b2y + c2z = 0 a3x+b3y+c3z = 0 has a solution (xo.. on the other hand. x2n2 }. and put X1 = {xl.c) = (b . Solutions to Advanced Problems Substituting the last equation to (1) gives f(x) = as desired. X3 = Define the function f : X1 X X2 X X3 + S x S as follows: f(a. Solution 95 Label the elements of X in increasing order x1 < ...1) 2 ns 2 By the Pigeonhole Principle. c . . in which case x = b1 . b2. X2 = {xn2+1 . .2. bi. Prove that one can find nine distinct numbers a2. 2.b.. Problem 95 [Romania 1996] Let n > 3 be an integer.118 4.a. c2 (i = 1..
Hence the nine numbers chosen are indeed distinct. 1+xi . < xn. 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. = 1. c2) are identical. since n 1 VT > xj = 1. b2. and.+ 1 xn Solution 96 By symmetry. we may assume that xl < x2 < following lemma. we have 1 1 1> or 1+xi + l+xj _ 2+xi+xj (1+xi)(1+xi) 1+xi+xj+xixj > 2+xi+xj. We have the Lemma For l < i < j < n. cl) and (a2.1+xj Proof Since n > 3. xn be positive real numbers. bl. Problem 96 [Xuanguo Huang] Let n > 3 be an integer and let Xi. a contradiction. It follows that xixj > 1. x2i Suppose that .4. and that al = a2 implies that the triples (al. . Prove that xl+ x2+ + xn>(n1) 1 xl + 1 x2 +... Solutions to Advanced Problems 119 Note that ai cannot equal bj since Xl and X2 are disjoint.
. > 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.> xn x1 > 1+x11+x2_ _1+xn and. (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. since 1 1 x1 > . Solutions to Advanced Problems as desired.120 4.. .. By the lemma. we have x2 >.
assume that d< minlxixjl =minx.. 2.yjI = y2Yi < sn. =0.xn) and Q(x) = P(x) Let Y1. Then P(yi) or 1 1 (1) yi ...+ 1 Yi 'xn =Q(yl)=0.x2). . .Xi + 1 Yix2 + 1 +. x2. yn_1 be the roots of Q. Solutions to Advanced Problems 121 Problem 97 Let x1.X1 Yi .. ( 1 1 xx1 xx2 nlyi .(x . Show that inlxix31 < Solution 97 By symmetry....4. Define the polynomials P(x) = (x .e.xn . > xn. By symmetry. it shares none with Q. xj =mins si i<j i<j i#j Since P has no double roots. setting i = 1 and i = 2 gives _ k=1 Sk  1 =0..yjI L) x . (2) Sk + d k=1 We claim that there is a k such that Sk(Sk + d) < 0..xn In particular.. .xk. . for k = 1. we may also assume that s1 < s2 < X2 > .. we have 1 1 Sk +d Sk . .. we may assume that d i:xj nlya . +.+ n 1 Yi . n. be distinct real numbers.. x1 > Let sk = y1 . otherwise. For the sake of contradiction. Y2.. x.X2 Yi . i.x1)(x .
we obtain sk + d < Sk+j. In fact. < Si < Si+1 < .. Therefore.122 4. that is Sk + d > 0. . A simple but critical fact is that sk + d and Sk+j have the same sign. Solutions to Advanced Problems for all k.. 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). . we obtain 1 1 Sk + d Sk+j for all k = 1.. since Sk + d and Sk+j have the same sign. that is.j.. 2. Then Sk+j > 0 if and only if k > i + 1. and. < Sni then s1+d< <si+d<0<si+1+d< <Sn+d. suppose that S1 < .. sk < 0 < sk+d. From (1). n . < Si+j < 0 < Si+j+l < . Let j be the number of ks such that sk (sk+d) < 0.. Thus our assumption is wrong and our proof is complete. which in turn implies that n n 1 k=1 Sk +d k=1 Sk which contradicts (2).
if we write (x2 + x + 1)2 ' x2 + x2 1 + 1 (mod 2). + bo.4. so s := h(r) is a root of g. Since x2 + x + 1 is irreducible in Z2 [x]. and ( . where h(x) = x2 + x and g(y) = y2" + 1. and let r be a root of p. the polynomial P X) = (x2 + integer coefficients. observe that f(x) = (x2+x)2"+1 x2ii}l + have x2n + 1 ..) is even for 1 < k < 2n . Since f is monic. +.. . Next. a2n1. g is irreducible. Therefore. Since s = r2 + r E Q(r). Thus every factor of f has degree at least 2n.. A(x) = a2 B(x) = x2" + b2. Then g(h(r)) = f (r) = 0. Now let p be a nonconstant factor of f. we have Q(s) C Q(r).. by unique factorization we must A(x) . + ao. we can write f (x) = A(x)B(x) where A and B have degree 2n. Since g(y+1) = (y+1)2 + 1 =yen + k=1 (2m)k) +2.B(x) Thus. we may assume without loss of generality . ao.(x2 + x + 1)2n (mod 2). by Eisenstein's criterion.. b2. Solutions to Advanced Problems 123 Problem 98 [Romania 1998] Show that for any positive integer n. if f is reducible.1. bo are odd and all the other coefficients then a2. are even.x2n .. so deg p > deg(Q(r)/Q) > deg(Q(s)/Q) = deg g = 2n. x)2' +1 cannot be written as the product of two nonconstant polynomials with Solution 98 Note that f(x) = g(h(x)).
0 as a2n1 + But is even. Hence f is irreducible. f2. Solutions to Advanced Problems that a2n = b2n = 1. f3 : R * R be functions such that aifi + a2f2 +a3f3 is monotonic for all ai. Alternative 1 We establish the following lemma. so ([x2n+2n1] + [X2'']) (f(x)) =2 (mod 4). 11) is odd by Lucas's theorem. c3 E R. such that Cifl(x) + C2f2(x) + c3f3(x) = 0 for all xER. so ao = bo = 1. Proof Let s. t be two real numbers such that f (s) f (t). not all zero. but ao > 0. Problem 99 [Iran 1998] Let fl. Then there exists c E R such that g . a2i a3 E R. also. g : R > R be functions such that f is nonconstant and a f + bg is monotonic for all a. Therefore. bo > 0 as f has no real roots. Solution 99.c f is a constant function. ([x2n+2"'] + [X2'' ])(g(x)h(x)) 2i1 2" E a.124 4. b E R. . (mod 4) n ([x2n+2"'] n + [x2n 1])(f(x)) = ( 22 _1 =2 22 _1 _ 11) 1 and (2?n. Lemma: Let f.b2n+2n1 =2n1 1 + E aib2n1i i=o +a2n1b2n + aob2n1 +a2n1bo 2(a2n1 + b2n1) . aobo = f (0) = 1. Prove that there exist c1i c2. a contradiction.
Therefore our assumption is false and h is a constant function. the monotonicity of h1 depends only on the sign of u . So there exists some d1 such that h1 is both strictly increasing and decreasing. Since f (s) . at least one of f (xi) f (X3) and f (X2) 0 f (X3) is true. Without loss of generality. c 54 9(xi) . Solutions to Advanced Problems Let 125 g(s) . Now we prove our main result.hi(t) = g(s) . there exist x1i x2 E R such that f (x1) f (x2). that there exists x3 E R such that h(x3) .d1). on the contrary. Since f (xi) 0 f (X2).d1 0 c' . for each d1.9(x2) f(xl) .f(t) Let hl = g . f2.E r.4.d1. Then r = h(xi) = h(x2) and the monotonicity of h1 = g . If fl. .f(t))(u .f(x3) hence c . But hi(s) .dl.g(t) f(s) . Then hl is monotonic. Without loss of generality. suppose that f (xi) 0 f(X3) Let .c f is a constant function.g(t) .dl.d1 f.cf. suppose that f1 is nonconstant.di(f(s) . Since h(x3) # r = h(xi).f(x2) and h = g .9(x3) f(xi) . We prove our claim by contradiction. Since f is nonconstant. C 9(XI) . Let C 9(x1) . Suppose. depends only on the sign of c .d1.d1f for some dl E R.f(t)) = (f(s) . f3 are all constant functions.9(x3) f(xi) f(x3)  Then the monotonicity of h1 also depends only on the sign of c' . the result is trivial. We claim that h = g .f (t) 0 is fixed. which is impossible.
then let (c1ic2. But then A is invertible. Here c. Then there exist x1 < x2 < X3 E R such that v(x1). so f2 = cf1 +d. Otherwise.cd'. d = d' = 0 and f2i f3 are constant multiples of fl.f3(x)) forxeR. If the v(x) span a proper subspace of 1183.c3) = (c'dcd'. c3) orthogonal to that subspace.126 4. for a2 = 0. If (c'd .d'. and then c1 fl (X) + c2 f2 (X) + c3 f3 (X) = 0 for all x R. 0). c'. 1. so f3 = c' fl + d'. So suppose the v(x) span all of R3. d. 0. v(x2). fi(x2). v(x3) are linearly independent. Then the problem is again trivial. 0). We have (c'dcd')fl+d'f2df3 = (c'dcd')fl+d'(cf1+d)d(c fl+d') = 0. . i=1 and the function cifi+c2f2+c3f3 is then not monotonic. and so the 3 x 3 matrix A with Ai3 = fj(xi) has linearly independent rows. fi(x3)) = (0. c2i C3 such that 3 Ci(ff.d) and we are done. Alternative 2 Define the vector v(x) = (f1(x). we apply the lemma to f1 and f3. This means we can find c1.f2(x). d' are constant. d'. and its columns also span R3. c2.(x1). Solutions to Advanced Problems For a3 = 0. we can find a vector (Cl. we apply the lemma to f1 and f2. Solution 99. a contradiction. d) j4 (0.
.YS1 ys2 . o"i yi. Let pk(xl... Srl 1: S1<32< <S..ys). x. Suppose that the claim is true for a certain n.. we say Pk is not even. y2^_1 be the sums of nonempty subsets of xi... .. Srxkr Al . We will show by induction on n that pk(xl. x2. . y2.yr)Qj(yr+l..2j for some nonnegative integer j..4.. x1 + x2 and p1 = yl + Y2 + Y3 = 2x1 + 2x2i P2 = Y1Y2 + Y2Y3 + Y3Y1 = xi + x2 + 3x1x2. xn) is not even if and only if k is bad for n. P3 = YiY Y3 = XiX2 + xlx2 Solution 100 We say a polynomial pk is even if every coefficient of pk is even. Qk(y1.x+y2. be variables. . x2i ... pl(x1) = xl is not even and k = 1 is bad for n = 1 as k=1=212°=2n2°. Solutions to Advanced Problems 127 Problem 100 [USAMO 1999 proposal. we say a nonnegative integer k is bad for n if k = 2n .ys) = i+j=k 3. and let y1. For any fixed positive integer n.. facts: 1.. xn) even? For example. 2. ys) be the kth elementary symmetric polynomial."'.Y2. if n = 2.. then y1i y2.. Otherwise.... .Y2. ... .. We have the following useful. xn+l) Let ok(y1iY2.x+Ys) T. For which k and n is every coefficient of pk (as a polynomial in xl. . Qk(yl. We now consider pk (x1i X2. For all1<r<s... For n = 1.. (x + yq ) ik k 1: r=O sl ."'. but easy to prove. . (x + yi l) (x + yi 2) . . . y3 are x1.. Richard Stong] Let x1i x2. .ys)]i 9k(x+y1.. .. . xn) be the kth elementary symmetric polynomial in the yj (the sum of every productof k distinct yi's).Ys) 0) =Qk(Y1..
r = 0 or j . x2...2v+1 It follows that Pk (XI. Xn) i+j=k n + t=0 pk2^ (xl.. x2 xn) is even un less r = 2" . x2. xn)xn+1' .. pk(x1. note that jr \jr/ 2t is even unless j .... + xn+1)1 E i+j=k r=0 (2n r r Pi(xl... xn+1 pi (x1..... ....2t. i. k2n=2n2" forsome0<u<n. x2.x2.ys) x kr .xn)2.. xl + xn+1.r = 2t.r Ik r0r(y1.xn+1) [pi(xl. . . this term is even unless k/2 = 2n .. By the induction hypothesis... xn)x 2t .. . . .. xn)pr(x1.. that isk=2n+l2" Pk/2(x1) for k even. x2. for some 0 < v < n..128 k 4. .xn) i+j=k Qj (xn+1. xn)p2^2t (x1.2".e... ... By the induction hypothesis.. that is k = 2n+1 . the terms in the first sum are even unless In the second sum. x2... x1 + x2 + . Solutions to Advanced Problems /S . x2i xn+l) is even unless k = 2n+1 . every term appears twice except the term x2. For such r. every term of pr(xl. for some 0 < t < n. taking coefficients modulo 2.2' for some 0<w<n+1. Therefore.. xn)Pj (x1. By the induction hypothesis. kisbadforn+1: . r=0 Hence pk(xl.. . . .
(x . Our induction is complete.. alo such that the equation (x ... . note that the odd coefficients in Pk (x1.) (x . If ul and u2 are real solutions of g(u) = 0. It follows again that g(x2) = 0 has no real solutions.. ' . .a2). then U1 +U2 < 0 and ulu2 > 0..1)x(x + 1)(x + 2)g(x2) = 0.(x + alo) has exactly 5 different real roots.a. The given equality becomes (x . xn+1) to be odd. xn+1) occur for different powers of xn+1 Therefore. . 6.. then g(x2) = 0 has no real solutions.. . both ul and u2 are negative. . Solution 101 We show that {a1...+3)U2+ If g(u) = has no real solutions.2)(x . x2i . where g(u) = 2[((7+6+. Our proof is complete. alo} _ {7.. x2. a2.. Solutions to Advanced Problems 129 Furthermore.4.. a2i . Problem 101 [Russia 2000] Prove that there exist 10 distinct real numbers a1.. that is.. .alo) = (x + al)(x + a2). 2} is a group of numbers satisfying the conditions given in the problem. .. the condition that k is bad for n + 1 is also sufficient for pk(x1.
.
n.. 1 (xl+x2+ +xn)(yl+y2+ +yn) < xlyl+x2y2+ +xnyn. . a2..a. . an are n nonnegative numbers. x2 .) n with equality if and only if a1 = a2 = (ala2.. .. y2. Let x1i x2 . Binomial Coefficient The coefficient of xk in the expansion of (x + 1)n is n _ n! k) CauchySchwarz Inequality k!(n .. + a2b2 + ... . such that x1 < x2 <_ Then <_ xn and yl < Y2 < ... ... then 1(a. xn and y1. 2... i = 1..k)! F o r any real numbers al.+a.+a2+.. an. a2. 2. . Chebyshev Inequality 1.. . . bn (al + a2 + . ... + an)(bi + b2 + _ + bn) > (alb.. + anbn)2 with equality if and only if ai and bi are proportional.... . < yn. such that x1 > x2 >_ Then (X > xn and yi > Y2 > > yn ... yn be two sequences of real num bers. b2.GLOSSARY ArithmeticGeometric Mean Inequality (AMGM Inequality) If a1.) = an. and b1. y2. xn and y1. Let x1.. . . yn be two sequences of real num bers..
. Elementary Symmetric Polynomials (Functions) Given indeterminates xl. Lagrange's Interpolation Formula . .. .. xn can be (uniquely) expressed as a polynomial in the si...x0) ... Jensen's Inequality If f is concave up on an interval [a.. b] and A1. . sn. sk is the sum of the products of the x.+sn_1t+sn. Fibonacci Numbers Sequence defined recursively by F1 = F2 = 1.. be arbitrary real numbers. . . taken k at a time. . and vice versa.. . 1.x0) . . Fn+2 = Fn+l + Fn... then Alf (xi) + A2f (x2) + . + Anxn) for any xl. are nonnegative numbers with sum equal to 1. .. It is a basic result that every symmetric polynomial in x1... n.. xn be distinct real numbers. Then there exists a unique polynomial P(x) of degree at most n such that P(xi) = yi. . .. and let yo. y.(x .xi1)(x xi+l).. are defined by the relation (in another indeterminate t) (t+xl) (t+xn) =to+slti1+. Then BC2 = AB2 + AC2 .. for all nEN. (xi . + Anf (xn) > f (A1x1 + A2x2 + ..132 Glossary De Moivre's Formula For any angle a and for any integer n. This is the Let xo.2AB AC cos A. .. yl. the inequality is reversed.. .(xi Law of Cosines Let ABC be a triangle. x1. the elementary symmetric functions s1. z = 0.. (cos a + i sin a)' = cos na + z sin no. A2. xn. That is. x2.. xn in the interval [a. polynomial given by (x . . . If the function is concave down. .(xi . .xi1)(xi  xa+1). A....xn) .. .xn) P(x) = i=0 yi.(x . b].
Root Mean SquareArithmetic Mean Inequality (RMSAM Inequality) For positive numbers x1. ... a2. .. where 0 < ai... .+X2 n XI +X2 +''' +Xk n More generally. .xk}. . alp+ao. x2. bi < p are integers for i = 0.Glossary 133 Lucas' Theorem Let p be a prime.. for s < t. Then (bk1) Cab) (aobo) \bk/ \b1) (mod p). k.... . xk }.... xi+x2+. Pigeonhole Principle If n objects are distributed among k < n boxes.. Then MO<MS<Mt<_M.. .. 1. x2.. . = max{xiix2.... For positive numbers x1. xn Mt = (aix' + a2x2 + . some box contains at least two objects. b = bkpk +bk_lpk1 + ... xn we define a2 + M_ = min{x1. x2. + akxk)1/t where t is a nonzero real number. xn. a1 a2 a M = x1 x2 . M... . let a and b be two positive integers such that a = akpk +ak_lpki + . let a1. bip+ bo. an be any positive numbers for which a1 + + an = 1. .. .
v = [N1. where al..31.an1 an i +xixj +xn1xn = . /32]. . and ja +. . a . xn be the roots of polynomial P(x) = anxn + where an 0 0 and a0. Then an that is. 1. /32 are real numbers. . + a1x + a0. an2 an i xix2 . Let a = al +a2i and 3 = Ni +132ti.31. a2 + /32] form a triangle with sides lengths Iah. Let a and 3 be two complex numbers. xn = (1)n a0 an Trigonometric Identities sin2 a + cos 2 a= sin a tan x = cos a 1. Define the absolute value of z to be z _ a2 + b2. and w = [al + X31..134 Glossary Triangle Inequality Let z = a + bi be a complex number. . an E C. 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. an_1xn1 + . Then a + = (al + al) + (a2 + /32)i. x2. x1+x2+ X1X2 + +xn =. cot x = 1 tan a .. a2i i3 . The inequality la+01 :5 lal+101 is called the triangle inequality. Vectors u = [ai. . a2]. . Vieta's Theorem Let x1.... Let sk be the sum of the products sk=(1)kank of the xi taken k at a time. .
3 cos a. tan 3a = halfangle formulas: 3 tan a .tang a' tripleangle formulas: sin3a=3sina4sin3a. tan a ± tan b 1T.tan2 a .sin 2 a = 2 cost a . cos(a±b) =cosacosbT.tang 2 ' sin a + sin b = 2 sin a l b cos a 2 b.sinasinb. tan a = sumtoproduct formulas: 1 . tan 2a = 2 tan a 1 .1 = 1 .Glossary 135 addition and subtraction formulas: sin(a±b) =sinacosb±cosasinb.tan3 a 13tan2a 2 tan 2 ' sin a = cos a = 1+tang z 1 . cos 3a = 4 cos3 a .2 sine a. 1+tang2 2 tan 2 . tan(a ± b) = doubleangle formulas: sin 2a = 2 sina cos a.tan a tan b cos 2a = cost a . . cosa+cosb=2cosa2bcosa2 tan a + tan b = differencetoproduct formulas: sin(a + b) cos a cos b' b sinasinb=2sina2 bcosa2b.
2 sin a sin b = .b).b).tan b = producttosum formulas: 2 sin a cos b = sin(a + b) + sin(a .b).136 Glossary cosacosb=2sina2 bsina2 b tan a .b) cos a cos b' . sin(a .cos(a + b) + cos(a . 2 cosa cos b = cos(a + b) + cos(a .
Kedlaya. 3. Mathematical Contests 19961997: Olympiad Problems from around the World. 12. T. Coxeter. Cofman.. MathPro Press.. 1967. . Chinn. 5. N. Problem Books in Mathematics. 11. Feng. American Mathematics Competitions. Doob. Oxford Science Publications. Mathematical Olympiads: Problems and Solutions from around the World. Steenrod... Mathematical Contests 19951996: Olympiad Problems from around the World. 4. Polynomials. S. New Mathematical Library. An Introduction to Inequalities. Birkhauser. Geometry Revisited. Springer. Z.. Mathematical Contests 19971998: Olympiad Problems from around the World. J. Mathematical Association of America.. K. 1999. Mathematical Association of America. with Solutions. 13. 10. Barbeau.. with Solutions.. P. New Mathematical Library.. Andreescu.. T. 6. Andreescu. R. E. Vol. 1997. Fomin. Random House.. 1998. Mathematical Association of America. 1994. Engel.. T.. Mathematical Olympiad Challenges. Leningrad Mathematical Olympiads 19871991.. Bellman. 2000. 1989. Kedlaya. R. First Concepts of Topology.. H. with Solutions. University of Toronto Press. A. F. American Mathematics Competitions. Vol. 19981999. New Mathematical Library. Zeitz. 1998. 1966. 2. K. K. L. ProblemSolving Strategies. Andreescu. W. 19. SpringerVerlag. 7. 1990. 8. A. T.. 27. 1961. Gelca. Kedlaya. 9. 1993.. M.. E. M. E. T. The Canadian Mathematical Olympiad 19691993. D. 3. What to Solve?. G. Beckenbach. S. Kirichenko. Andreescu. Andreescu. Greitzer. 2000. Vol. American Mathematics Competitions.FURTHER READING 1.
. 22. D. S. Vol. SpringerVerlag. 0. AddisonWesley. 1994. Kazarinoff. N. 11 & 12. AMT Publishing. C. R. L. Sharygin. Graham. Mir.138 Further Reading 14. Graphs and their uses. Genkin. Fomin. Mathematical Association of America. 19781985. Springer. Moscow. 20. Problems in Plane Geometry. 18. New Mathematical Library. Groups and Their Graphs. 19721986. Kiirschak. Random House. New Mathematical Library.. International Mathematical Olympiads. Canberra. 144 Problems of the AustrianPolish Mathematics Competition 19781993. Random House. 27. Grossman. 1978. The Academic Distribution Center. USA Mathematical Olympiads. 29. C. H. I. Ore.. AMT Publishing.. D. J. E. 1967. Lausch. M. Rousseau. 1961.. F. 1989.. 31. S. 26.. Vols. D.. American Mathematical Society. 27.. M.. Volumes I & 77. New Mathematical Library. International Mathematical Olympiads. Bosch Giral. Winning Solutions. 15. 28. Mathematical Circles. Klamkin. L.. C. New Mathematical Library. 1998. 19591977. 25. 14. 1967. M. 1988.. Magnus. Mathematical Association of America. Patashnik. 24. 21. 1963. 4. New Mathematical Library. 23. Concrete Mathematics. I. Vol. 17. Vol. Kuczma. 0. Mathematical Association of America. 1964. Itenberg. Mathematical Association of America. Larson.. Geometric Inequalitties. 33. 1986. The Asian Pacific Mathematics Olympiad 19892000.. 0. I. 1996... L. ProblemSolving Through Problems. Mathematical Association of America. Canberra. 1988. Lozansky. Vol. 1996.. Hungarian Problem Book. .. Liu. New Mathematical Library. A. Random House. Chinese Mathematics Competitions and Olympiads 19811993.. 1983. E. Vol. Greitzer.. W. Ore. 2001.. 16. Knuth. Invitation to number theory. Klamkin.. 19.
P.. 1993. Academic Press. 1962.. Colorado Mathematical Olympiad: The first ten years. Sharygin. AMT Publishing. 1997.. Springer. . 41. R. 40. 1972. 1987. 42. 1994. Stanley. Canberra. Slinko.. A. Taylor. 1996. 31. I. Szekely. Taylor. I. A. Yaglom. C. A.. 39. Random House. Wilson.. 1973.. R. Academic Press. New Mathematical Library..Verlag. 8. AMT Publishing. 37. Random House. I. Yaglom. Yaglom. 24. 46. 1997. 34. Tomescu. Yaglom . Tournament of Towns 19801984.. 1998. Taylor. J. New Mathematical Library. Wiley. McGrawHill. The USSR Olympiad Problem Book.. Problems in Combinatorics and Graph Theory. P. 1994. Elementary Number Theory. Chentzov. 36. Wilf. 44. P. M. Freeman. AMT Publishing. 32. I. P. H. 43. Canberra.. 38.. S. 1962. Canberra. F. Tournament of Towns 19891993. Geometric Transformations III.. Moscow. Enumerative Combinatorics. Center for excellence in mathematics education. AMT Publishing. Mir. Cambridge University Press. I. M. USSR Mathematical Olympiads 19891992..Further Reading 139 30.. 0. Generatingfunctionology.. J. 47. 1986. Storozhev. 1968. N. J. Tournament of Towns 19841989. Vol. D. 1994. Canberra. P.. M. Contests in Higher Mathematics. Vanden Eynden. Geometric Transformations. Tournament of Towns 19931997. 45. Geometric Transformations II. The Art and Craft of Problem Solving. Taylor. P. Canberra. 1985. Random House. John Wiley & Sons. 1992. 21. 1999. 35. Zeitz.. J. Vol. Shklarsky. M. C. J. N.. Vol. Introduction to graph theory. Soifer. 33. New Mathematical Library. I. AMT Publishing. Problems in Solid Geometry.
.
In addition. ISBN on THE AUSTRALIAN MATHEMATICS TRUST EN R I CHMENT SE R I E S 1 876420 12 X . Originally from Romania. is Chair of the USA Mathematical Olympiad Committee. 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". He teaches at Phillips Exeter Academy. Zuming Feng graduated with a PhD from Johns Hopkins University with an emphasis Algebraic Number Theory Elliptic and Curves. and is an assistant director of the USA Mathematical Olympiad Summer Program. and is Director of the USA Mathematical Olympiad Summer Program. serves as Head Coach of the USA International Mathematical Olympiad (IMO) Team. Prof. He received the Edyth May Sliffe Award for Distinguished High School Mathematics Teaching from the MAA in 1996. l le also serves as a coach of the USA International Mathematical Olympiad (IMO) Team. then after moving to the USA was awarded the Edyth May Sliffe Award for Distinguished High School Mathematics Teaching from the MAA in 1994. is a member of the USA Mathematical Olympiad Committee. Andreescu received the Distinguished Professor Award from the Romanian Ministry of Education in 1983.Titu Andreescu is Director of the America n Mathematics Competitions.
This action might not be possible to undo. Are you sure you want to continue?
Use one of your book credits to continue reading from where you left off, or restart the preview.