Jiri Herman Radan Kucera Jaromir Simsa v
Equations and Inequalities Elementary Problems and Theorems in Algebra and Number Theory Translated by Karl Dilcher
��'z._ � :7
Canad1an Mathematical Society
Societe mathematique du Canada
CMS Books in Mathematics Ouvrages de mathematiques de Ia SMC 1
2 3
4
HE RMAN/KutERA/SIMSA Equations and Inequalities ARNOLD Abelian Groups and Representations of Finite Partially Ordered BORWEIN/LEWIS Convex Analysis and Nonlinear Optimization LEVIN/LUBINSKY Orthogonal Polynomials for Exponential Weights
5 KANE Reflection Groups and Invariant Theory
Sets
Jifi Herman Radan Kucera Jaromir Simsa v
Equations and Inequalities Elententary Problents and Theorents in Algebra and NUinber Theory Translated by Karl Dilcher
Springer
Jiff Herman
Radan Kucera Department of Mathematics Faculty of Science, Masaryk University
Brno Grammar School tf. Kpt. Jarose 14 658 70 Brno Czech Republic
Janackovo nam. 2a 662 95 Brno Czech Republic
Translator
Jaromfr Simsa Mathematical Institute Academy of Sciences of the Czech Republic ZiZk.ova 22 616 62 Brno Czech Republic
Karl Dilcher Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia B3H 3J5 Canada
Editors-in-Chief Redacteurs-en-chef
Jonathan Borwein Peter Borwein Centre for Experimental and Constructive Mathematics Department of Mathematics and Statistics Simon Fraser University Burnaby, British Columbia VSA 1S6 Canada
Mathematics Subject Classification (2000): 16G20, 20Kxx Library of Congress Cataloging-in-Publication Data
Herman, Jiff.
[Metody resenf matematiclcych uloh I. English]
Equations and inequalities : elementary problems and theorems in algebra and number
theory I Jiff Herman, Radan Kueera, Jaromir Simsa; translated by Karl Dilcher. p. em.- (CMS books in mathematics) Includes bibliographical references and index.
ISBN 0-387-98942-0
(alk.
paper)
1. Equations-Numerical solutions.
n. SimSa, Jaromir. 2000 512.9'4--dc21
Radan.
QA218.H4713
m. Title.
2. Inequalities.
IV. Series.
3. Problem solving.
I. Kucera
99-047384
Printed on acid-free paper. © 2000 Springer-Verlag New York, Inc. All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer-Verlag New York, Inc., 175 Fifth Avenue, New York, NY 10010, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use of general descriptive names, trade names, trademarks, etc., in this publication, even if the former are not especially identified, is not to be taken as a sign that such names, as understood by the Trade Marks and Merchandise Marks Act, may accordingly be used freely by anyone. Production managed by Allan Abrams; manufacturing supervised by Jerome Basma. Photocomposed copy prepared from the translator's files.
UT:EX
Printed and bound by R.R. Donnelley and Sons, Harrisonburg, VA. Printed in the United States of America. 9 8 7 6 5 4 3 2 1
ISBN 0-387-98942-0 Springer-Verlag New York Berlin Heidelberg
SPIN 10745911
Preface
This book is intended as a text for a problem-solving course at the first or second-year university level, as a text for enrichment classes for talented high-school students, or for mathematics competition training. It can also be
used
as a source of supplementary material for any course dealing with
algebraic equations or inequalities, or to supplement a standard elementary number theory course. There are already many excellent books on the market that can be used for a problem-solving course. However, some are merely collections of prob lems from a variety of fields and lack cohesion. Others present problems according to topic, but provide little or no theoretical background. Most problem books have a limited number of rather challenging problems. While these problems tend to be quite beautiful, they can appear forbidding and discouraging to a beginning student, even with well-motivated and carefully written solutions.
As
a consequence, students may decide that problem
solving is only for the few high performers in their class, and abandon this important part of their mathematical, and indeed overall, education. One of the reasons why problem solving is often found to be difficult is
the fact that in recent decades there has been less emphasis on technical
skills in North American high-school mathematics. Furthermore, such skills
are rarely taught at university, where most courses are quite theoretical or structure-oriented.
As
a result, a lack of ''mathematical fluency" is often
evident even in upper years at university; this reduces the enjoyment of the subject and impairs progress and success. A second reason is that most students are not used to more complex or multi-layered problems. It would certainly be wrong to give the impres-
vi
Preface
sion that all mathematical problems should succumb to a straightforward approach. Indeed, much of the attractiveness of mathematics lies in the satisfaction derived from solving difficult problems after much effort and several futile attempts. On the other hand, being "stuck" too often and for too long can be very discouraging and counterproductive, and is ulti mately a waste of time that could be better spent learning and practicing new techniques. This book attempts to address these issues and offers a partial remedy. This is done by emphasizing basic algebraic operations and other techni cal skills that are reinforced in numerous examples and exercises. However, even the easiest ones require a small twist. We therefore hope that this pro cess of practicing does not become purely rote, but will retain the reader's interest, raise his or her level of confidence, and encourage attempts to solve some of the more challenging problems. Another aim of this book is to familiarize the reader with methods for solving problems in elementary mathematics, accessible to beginning uni versity and advanced high-school students. This can be done in different ways; for instance, the authors of some books introduce several general methods (e.g., induction, analogy, or the pigeonhole principle) and illus trate each one with concrete problems from different areas of mathematics and with varying degrees of difficulty. Our approach, however, is different. We present a relatively self-contained overview over some parts of elementary mathematics that do not receive much attention in high-school and university education. We give only enough theoretical background to make these topics self-contained and rig orous, and concentrate on solving particular problems in the three main areas corresponding to the first three chapters of this book. These chapters are fairly independent of each other, with only a limited number of cross-references. Within each chapter, clusters of sections and subsections are tied together either by topic, or by the methods needed to solve the examples and exercises. The problem-book character of this text is underlined by the large number of exercises; they can be solved by using a method or methods previously introduced. We suggest that the reader first carefully study any relevant examples, before attempting to solve any of the exercises. The individual problems (divided into approximately
760
330
examples and
exercises) are of varying degrees of difficulty, from completely straight
forward, where the use of a method under consideration will immediately lead to a solution, to much more difficult problems whose solutions will sometimes require considerable effort. The more demanding exercises are marked with an asterisk
(*).
Answers to
all
exercises can be found in the
final chapter, where additional hints and instructions to the more difficult ones are given as well. The problems were taken from a variety of mainly Eastern European sources, such as Mathematical Olympiads and other competitions. Many
Preface
vii
ofreader. themAnare important therefore notcriterion otherwise easily access i ble to the English-speaking for the selection of problems that their We solutions should, in principle, be access i ble to high-school students. believe that even with this limitation one can successfully stimulate creative workOneinofmathematics and illustrate its diversity and richness. our objecti v es has been to stress alternative approaches to solving aplace, givenwhile problem. Sometimes we provide several different solutions in one at other times we return to a problem in later parts of the book. This book is a translation of the second Czech edition of Metody resen-t matematick'gch uloh I ( "Methods for solvirig mathematical problems I" ) published in 1996 at Masaryk University in Brno. Apart from the correction ofshortsomesections minorwith misprints, the main material has been left unchanged. Three "competition-type" problems at the ends of the chapters were deleted, but some of these problems were incorporated into the main body of the book. alphabetical index was added. The Czech editions of this book have been used by the authors in spe cial enrichment class e s for secondary-school students and for Mathematical Olympiad training in the Czech Republic. It has also been used on a regular basis at Masaryk University in courses for future mathematics tea.C h ers at secondary schools. A preliminary English version of the first two chapters successfully tried out by the translator in a newly created problem was solving course in the Fall of 1998 at Dalhousie Uni v ersity, in Halifax, Canada. It was felt that a course partly based on this book worked qui t e well even in a class with a wide range of mathematical backgrounds and 's structure, the worked examples, and the range in level abilities. The book ofassdifficulty of the exercises make it particularly well suited as a source for iThegnedtranslator readings also and homework exercises. feels that, following the Czech example, this book may be suitable for a course in a teachers' education program for high school mathematics teachers. Finally, we hope that the reader will find this book a rich source of useful identities, equations, and inequalities. Jifi Herman Brno and Halifax Radan Kucera July 1999 Jaromir Sim8a Karl Dilcher was
An
Contents
Preface
v
Symbols
xi
1
2
1
Algebraic Identities and Equations
12 34 5 67
Formulas for Powers . . . . . . Finite S . . . . . . . . . Polynomials . . . . . . . . . . . . . . . Symmetric Polynomials Systems ofEquations Equations . .. . . . . . .. . .. . . . . Irrational Some Applications of Complex Numbers .
ums
.
.
.
.
.
.
.
.
.
.
.
.
.
1 523 38 46 607 5
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Algebraic Inequalities
12 34 56 7 8 9
. . . . . . . . . . . Definitions and Properties Basic Methods . . . . . . . . . . . . . The Use of Algebraic Formulas . . . . . . . . The Method of Squares . . . . . . . . . . The Discriminant and Cauchy's Inequali. ty. .. . The Induction Principle . . . 's Inequality . . . . . . . . . . Chebyshev Inequali t ies Between Means . . . . . Appendix on Irrational Numbers . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
89
9094 106 113 124 13145 5 150 169
Contents
x
3
4
Number Theory
.. . . . . . . . . Concepts Basic . . . . . Numbers Prime . Congruences . . . . . . . . . . . . . . . .. . . Variable One in Congruences . . . . . . . Equations Diophantine . Equations Diophantine of Solvability . . . . . Part Fractional and Part Integer . . . . . Representations Base .... . . . . Principle Dirichlet's Polynomials . . . . . Hints and Answers 1 1 . . . . Chapter to Answers and Hints 2 2 Chapter to Answers and Hints 3 Hints and Answers to Chapter 3 .
1 2 3 4 5 6 7 8 9 10
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
173
174 183 189 201 217 238 251 258 268 274 283
283 294 312
Bibliography
337
Index
341
Symbols
to
Inof numbers addition willusual mathematical notation, the foll o wing symbols for sets be used: N No Z
Q Q+ R R+ R-
JRt
IRQ
C
the set {1, 2, 3, } of all natural numbers, or positive integers the set of all nonnegative integers the set of all integers the set of all rational numbers the set of all positive rational nwnbers the set of all real numbers the set of all positive real numbers the set of all negative real numbers the set of all nonnegative real numbers the set of all nonpositive real nwnbers the set of all complex numbers .
.
.
1 Algebraic Identities and Equations
Inrestricted contrasttotoonethetopic; other rather, chaptersit ofis this book, this first chapter will not be devoted to several relatively disparate . The emphasis lies on finite sums, polynomials, and solutions of matters systems of equations. The final section deals with several types of problems that can be solved by using complex numbers. 1
Formulas for Powers
This is a short preparatory section. We introduce several identities that will be used throughout this text. 1 . 1 Combinatorial Numbers
For an arbitrary number n E No we define the number n! read factorial ) as follows: O! 1 , and for n > 0 let n! be the product of natural numbers not exceeding the number n: Definition. ( n
=
all
n! =
1 · 2 · · · (n- 1) · n.
we
Factorials help us define combinatorial numbers (�) (read n choose k) by the relation (nk) - k!(nn!- k)!' where n, k E No, k < n.
2
1 . Algebraic Identities and Equations
From this definition we obtain directly the identities
< k < n; where 0 -
(1)
-
in the case where 0 < k < n, we have furthermore
( )+( )= n k
n k- 1
=
+
n! n! (k - 1)!(n - k 1)! k!(n - k)! n! [(n k + 1) k ] = k!(n - k 1)f -
+ + (n+k 1)
+
(2)
·
These identities enable us to show that combinatorial numbers are the coefficients in the expansion of the nth power of a binomial expression. Therefore they are often called binomial coefficients. In the following theo + 2A B = we rem, which generalizes the known formula can take A, to be numbers or expressions.
( A + B ) 2 A2
B
+ B2 ,
1. 2 The Binomial Theorem Theorem. For an arbitmry natuml number n we have
(A + B) n = (�) An + (�) An- l B + (;) An-2B2 + . . . + (:) Bn . PROOF. Since (�) = G) 1, the theorem is certainly true for n = 1. We assume that it is true for some fixed n > 1; we will prove that it holds for n + 1. If we add the two identities A · (A + B)nn (�) An+l + (�) AnB + · · . + (:)ABn , B · (A + B) (�)AnB · · · + (n �1)ABn + (:) Bn+l , we obtain on the left-hand side the power (A + B ) n+l , while the sum on the right is, according to (2 ) , equal to (�) An+l + (n il) AnB + (n �l)An- 1 B2 + . . . + (n �l) ABn + (:) Bn+l . Since (�) = 1 (n 61 ) and (:) = 1 = (:tD , the statement of the theorem 0 holds also for n + 1, which completes the proof by induction. =
=
=
+
=
1. 3 Examples
B = 1, resp. A = 1, B -1, we obtain interesting A = identities between combinatorial numbers, valid for all n E N: {i) If we set
=
(3)
1 Formulas for Powers
3
+ v2) 100•
(ii) We will determine the largest summand in the expansion of (1 To do this, we determine the quotient of the (i 1 )th and the ith summand (0 < i < 100) of the expansion, namely
+
- i)! . h C�0)( ( vi2)i 1 = i! (100100!- i)! . (i - 1)!(101 100! (J��) vf2)i= 101 . - i . h. �
This quotient is bigger than 1 exactly when ( 101 - i ) v'2 > i, that is, exactly when 101 i< 101(2 - J2)
""59.1644, + �2 = and for i < 59 the ( i + 1 )th summand is bigger than the ith. Similarly, we convince ourselves that for i > 60 the (i + 1 )th summand is less than the ith. Therefore, the largest summand is (�09°) . ( v'2) 59 1
so
_
1.4 l?xercises Show that (i)-(iii) hold for arbitrary natural numbers n:
(�) + (�) + (�) + . . . = 2n-1. (�) + (;) + (:) + . . . = 2n-1 (the sums in (i), (ii) end with ( :) or ( �1) ). n (iii) en:1) + ( 2n i 1 ) + en:1) + . . . + en:1) = 4n . {i) {ii)
(iv) Find the largest summand in the expansion of ( v'2 (v) Determine all natural numbers m, n satisfying
n+11) = (nm+1) = §.3 (mn+1 ( m+ -1)
+ vf3) 50.
·
The binomial theorem is going to be used extensively in what follows, in particular in Sections 2.9 and 2.10, where we find identities similar to (3) and Also, in Section 3 . 7 of Chapter 2 we show how the binomial theorem can be used to prove ip.equalities. Now, however, we introduce a generalization of the known identity As in may denote numbers or expressions. 1.2, the letters
(4).
A, B
A2 - B2 = (A - B) · (A + B).
1. 5 A Factorization Theorem. For an arbitrary natural number n we have
An - Bn = (A - B)· (An-1 + An-2B + · · · + ABn-2 + Bn- 1 ). (5)
1 . Algebraic Identities and Equations
4
PROOF.
By direct calculation: If we subtract the identities
A . (Ann-11 + Ann-2B + . . . + Bnn- 11 ) = An + Ann- 11 B + . . . + AABnn--11 ' Bn , B . (A - + A -2B + . . . + B - ) = A - B + . . . + B +
we
0
(5).
immediately obtain
1.6 Example Find the coefficients of the polynomial
where r, s are integers,
0 < r < s.
(1 + x)r, we obtain F(x) = (1 + xr · [1 (1 + x) + · · · + (1 + x)s-r]. 1 in (5), we get Replacing A = 1 + x, B = 1, = s (1 + x)s-r+1 - 1 = X · [(1 + x) s-r + (1 + x)s-r- 1 + · · · + (1 + x) + 1], SOLUTION.
If we factor out
+
n
r
+
hence
F(x) = -X1 · (1 + x) r [(1 + x) s-r+ I - 1] = -X1 · [(1 + x) 8+1 - (1 + x) r] . According to the binomial theorem 1.2, � 1 ) x•- l _t (:) xi- 1 , (s F(x) = E �=1 �=1 and therefore the coefficient of xi in F(x) is (j!D - (i�1) for 0 < j < and
(;!D
for
r
< j < s.
r
o
1. 7 Exercises Show that for an arbitrary natural number
(i) (ii)
m
we have
A2m_B2m = (A+ B)(A2m- 1 _A2m-2B + . . . _B2m- 1 ), A2m- 1 + B2m- 1 = (A + B)(A2m-2 _A2m-3B + . . . + B2m-2 ) .
(6) (7)
2 Finite Sums
2
5
Finite Sums
In this section we give several methods for obtaining formulas for some interesting finite sums, that is, sums with finitely many summands. We point out that we avoid on purpose the use of mathematical induction, since in many cases it is quite difficult to obtain the necessary hypothesis on how the result should look. This does not mean, however, that this method could not be used for certain problems·. Indeed, the many examples in this section would be very useful for practicing this important method of proof. For the remainder of this sectiqn, let k, m, n be natural numbers.
2. 1
Example
Determine
S1 (n) = 1 + 2 + 3 + · · · + n.
We write out the sum S1 ( n) twice, with the second one written in opposite order; then we add the two expressions: SOLUTION.
S1 (n) = 1 + 2 + 3 + · · · + (n - 1) + n S1 (n) = n + (n - 1) + (n - 2) + · · + 2 + 1 2S1 (n) = (n + 1) + (n + 1) + (n + 1) + · · · + (n + 1) + (n + 1). ·
That is,
2S1 (n) = n(n + 1), and therefore sl ( n)
= 1 + 2 + 3 + . . . + n = n(n2+ 1) .
(8)
We were able to determin� this sum very easily, simply by changing the order of the summands. It is now clear that this method can be used for summing finitely many terms of any arithmetic progression. If an arithmetic progression is determined by its first term a 1 and difference d, then we get for the sum SA of its first n terms,
+ · · · + [a 1 + ( n - 1 ) d] + a1 SA = [a 1 + d] a1 SA = [a 1 + (n - 1) d] + [a 1 + (n - 2) d] + · . . + 2SA = [2a1 + (n - 1) d] + [2a 1 + (n - 1) d] + · · · + [2a1 + (n - 1) d] , that is,
where we have used the fact that
an = a 1 + (n - 1) d .
D
1 . Algebraic Identities and Equations
6
2. 2 Remark If we change the above procedure a little, we can also determine the sum of the first n terms of a geometric progression. If a geometric progression is determined by its first term a 1 and quotient q 1= 1 , we obtain a formula for the sum So of its first n terms as follows:
So = a1 + a 1 q + a 1 q2 + · + a 1 qn- 1 q · So = a1 q + a 1 q2 + + a1 qn - 1 + a 1 qn q · So - So = -a 1 + Since q 1= 1, we obtain n-1 q (10) So = a 1 · q - 1 . The trick that led to the expression (10) is based on an appropriate multiplication of the original expression for So, followed by a subtmction ·
·
·
·
·
of the two equations, so that on the resulting right-hand side all but two terms disappear. We note that if we begin by factoring out a 1 in the sum So, then formula (10) can be obtained directly from (5) by setting A = 1,
B = q.
2. 3 Exercises Evaluate the following sums:
(i) S = 1 + 3 + 5 + · · · + ( 2n - 1). (ii) S = 1 - 2 + 3 - 4 + · · · + ( -1 ) n+ 1 n. (iii) S = n + (n + 3) + (n + 6) + · . . + 4n. (iv) S = ( -31) + ( -27) + ( -23) + · · · + 29 + 33. ( ) S = 2 + 22 + 23 + · · · + 2n . (vi) S = 1 -! + � - � + . . + (-1) n - 1 · 2 n':.1• (vii) S = 2 + 5 + 11 + . . · + (3 · 2n- 1 - 1). (viii) S = (x + �)2 + (x2 + �)2 + + (xn + x�)2 , where x E 1R, x 1= 0. V
·
·
2.4
·
·
Some Combinatorial Identities
The methods of changing the order of summands or appropriate multipli cation of the sum can also be applied to certain combinatorial sums, that is, sums that contain factorials or binomial coefficients. In some cases both methods can be combined in an appropriate way.
2 Finite Sums
7
2. 5 Example
Determine S = 1 · (�) + 2 (�) 3 · (�) + · + n (:) the fact that k (�) = k · ( �k) , we can (i)write the given sum in aIfdiffweeuse n rent way, S n (�) + (n - 1) (�) + (n - 2) · (�) + + 1 · (n�1). We then add both expressions of the sum 1 · (�) + 2 · (�) + . + (n - 1) · (n�1) + n · (:) S= S = n·(�) + (n - 1) · (�) + (n - 2) · (�) + . . + 1·(n�1) +
·
·
·
·
FIRST SOLUTION.
as
=
·
·
.
·
·
·
·
S:
. ·
·
Hence, according to (3) , S = �n [ (�) + (�) + (�) + · + (:)] = � n 2n = n 2n-1. 0 (ii) Each term in the sum S is of the form k (�) (for k = 1, 2, .. . , n) and we have (n)!-(1)-! k)! - n (nk-1) . k . k!( n! k)! - k . k·(kn-1 -1 n n Then S = 1 · (�) + 2 (�) + · · + (n - 1) (n�1) + n (:) = n (no1) + n (n11) + . . . + n . <:=D = n . [(n01) + (n!1) + . . . + (:=�) + (:=D] = n . 2n-1. 0 ..
·
·
·
·
SECOND SOLUTION .
·
_
_
·
·
.
·
.
·
.
2. 6 Example
Determine S = 1 (�) - 2 (�) + 3 (�) - 4 . (:) + . . . + (-1)n+ 1 . n . (:) If we try the method of 2. 5 .(i), we notice that it works only for even n, in which case according to (4) we obtainS = 0. Let instead rewrite each term in the sumS exactly in 2.5. (ii); then we get S = 1 · (�) - 2 (�) + 3 (;) - 4 · (:) + · · · + ( -1)n+ 1 . n . (:) = n . [(n 1) (n!1) + (n;:1) (n31) + . . . + ( -1)n+1 (:=D] , and according to (4),S = 0 for n > 2 and alsoS = 1 for n = 1. ·
·
·
.
SOLUTION .
as
·
0
so,
_
us
·
_
o
8
1. Algebraic Identities and Equations
2. 7 Example
Determine
= f(�) + �(�) + !(;) + · · · + n�1 (:). immediatelbyy ). We ( Here each summand is of the form � · k.,!. 1 reach our goal if we multiply each summand (and thus the whole sum) the number n + 1 , since +1). 1 (nk) = k+1 . k!(nn-! k)! - (k+(1n)!+1(n)!-k)! - (kn+1 ( n + 1) k+1 Then we have (n + 1) . S = nt1 (�) + nt1 (�) + nt1 (;) + . . . + nt1 (n�1) + :t� (:) = (nt1) + (nt1) + (nt1) + . . . + (n�1) + (:!D = [(nt1) + (nt1) + (nt1) + . . . + (:!D J (nt1) = 2n+1 1. 0 From this we obtain S = 2:�11 . S
SOLUTION.
!!:±!
.
_
_
_
_
2. 8 Exercises
Determine the following sums: (i) S = 1 · (�) + 2 (�) + 3 · (;) + · · · + (n + 1) · (:). (ii) S = 1 · (;) 2 · (;) + 3 · (:) - 4 (�) + · · + ( 1 )n (n- 1 ) · (:) for n > 2. (iii) S = 2 · (;) + 6 · (;) + 12 (:) + · · + n( n- 1) (:) for n > 2. *(iv) S = 12 · (�) + 22 . (;) + 32 . (;) + . . . + n2 (:). (v) S = �(�)- �(;) + i(;)- �(:) + . . . + ( -��n1+1 (:). (vi) S = �(�) + i(�) + i(;) + · · · + n..!-2 (:) . *(vii) S = 222 (n1) + 233 (n2 ) + 244 (n3) + . . . + 2nn++1l (nn) · ( ...) 1!(2n1-1)1 + 3!(2n1-3)! + 51(2n1-5)! + · · + (2n-11 )!1! ·
-
·
·
-
·
·
·
•
Vlll
s-
·
·
2. 9 Applications of the Binomial Theorem
The binomial theorem 1 . 2 can be used successfully for deriving sev eral combinatorial identities We consider the binomial expansion of the . expression
9
2 Finite Sums
which is a polynomial of degree k in the variable x. If we succeed in express ing this polynomial in a different form for certain k, then by equating the coefficients of equal powers xi we can obtain interesting formulas between binomial coefficients. For example, let us prove the identity Here then appropriate exponent is k = 2n since clearly (1 + x)2n (1 + x) (1 + x)n . After expanding both sides of this equation accord ing to the binomial theorem, we obtain the required identity by equating the coefficients of xn: (1 + x)2n = e;) + ef) x + ...+ (�) xn + ... + (�:) x2n, (1 + x)n · (1 + x)n = ((�) + ( �) x + · · · + (n�1) xn-1 + (:) xn) ·
X
((�) + ( �)x + · · · + (n�1) xn-1 + (:) xn)
= (�) (�) + [(�)(�) + (�)(�)]X+ ...
+ [(�)(:) + (�)(n�1) + ...+ (:) (�)J xn + . . .
+ (:) (:) . x2n.
Therefore, we have e:) = (�)(:) + (�)(n�1) + ...+ (n�1) (�) + (:) (�) = (�)2 + (�)2 + ...+ (n�1)2 + (:)2, where in the last equality we have again used (1). In general, the two expressions of this polynomial form the basis of the method of genemting functions. With the help of this method one can obtain a large number of interesting identities. The interested reader is encouraged to consult, e.g., the books [9] and [6]. 2. 1 0 Exercises
Using the method of 2.9, prove ( i) and (ii), where and < n: r
p, r
E N,
p
<
m, p
<
n,
(i) (�)(';) + (�) (p��\) + (�) (p�2 ) + ...+ (;) (';{) ( m;n) , (ii) (�) (�) + (�)(r�1) + (�) (r�2) + · · · + (n�r) (:) (n-g��+r)l" 1 · (�)2 + 2 . (�)2 + 3 . (;)2 + ...+ n . (:) 2. (iii)
= =
Determine the sumS =
10
2.1 1
1. Algebraic Identities and Equations
Example
Let us determine the sum (�) + (m{ l) + (mt2) + . . . + (m��� l ). Using (1), we rewrite this sum as G:) + (m� l) + (m �2) + . . . + (m+�- 1) , and we see that it is the coefficient of xm in the polynomial +n 1 (1 + x)m + (1 + x) m+l + (1 + x) m+2 + . . . + (1 + x) m - ' + which, according to E ple 1. 6 with and s n 1, is equal to G:t�). This solves the problem. For later use, we write the result as (11) G:) + (m� l ) + (m�2) + . . . + (m+ �- 1) G:t�). xam
r
=
= m
m
=
2.12 Remark
We can convince ourselves that the sum in Example 2.11 in its original n form can be found as the coefficient of x in the polynomial xn (1 + x) m + xn- 1 (1 + x) m+l + xn-2 (1 + x) m+2 + . . . + x1 (1 + x)m+n- 1 . This polynomial is equal to x(1 + x) m+n -xn+ 1 (1 + x) m. Formula (11), by the way, is easy to prove by induction with respect to n; itpretation, suffices tobutuseweformulas (1 and (2). It also has a nice combinatorial inter ) will not pursue this further in this book. In Section 7 of this chapter we will return to some problems concerning sums that involve binomial coefficients. 2. 1 3
The Sums B(k, n)
With the help of relation (11) we now derive a formula for the sum B(k, n) 1 2 3 k + 2 3 4 (k + 1) + + n(n + 1)(n + 2) (n + k- 1) , we put k in (11), then which will be used in Sections 2.14 and 2.15. upon multiplying by k! we obtain B (k' n) - k'. (kk+n+1 ) - n(n+l)(n+k+21) · . (n+k) . (12) Let us note that according to the definition we have B(l, n) S1 (n) n(n: l) . Therefore, the derivation of (12) for k 1 constitutes another proof of formula (8). =
·
·
·
·
·
·
·
·
·
·
·
_
=
=
=
·
·
If
_
·
m=
·
·
2 Finite Sums
2. 14
11
The Sums Sk(n)
Now we turn our attention to the sum Sk (n) of kth powers of the first n natural numbers: where k E No. This notation is consistent with that in Section 2.1, where we showed that Furthermore, it is clear that Let now determine S2 (n) = 1 2 we have for k = 2, us
+
22 + 32 + · · · + n2 •
According to ( 12)
B (2, n) = 1 · 2 + 2 3 + 3 · 4 + · · · + n(n + 1) (1 · 1 + 1) + (2 2 + 2) + (3 · 3 + 3) + · · · + (n · n + n) (1 2 + 22 + 32 + · · · + n2 ) + (1 + 2 + 3 + · · · + n) + + 2) S2 (n) + Sl (n) n(n 1)(n ' 3 ·
= = = from which we get
·
=
2. 15 Exercises
Using the method in 2.14, show: 2 2 ). n3 = n (n+1 (i) S3 (n) = 1 3 23 33 4 2 (ii} s4 (n) 14 2 4 3 4 n 4 = n(n+1)(2n+ib(3n +3n-1). 111} S ( n ) = 1 5 25 35 · · · n5 - n2(n+1)2(2n2+2n-1) . (••• 12 5 =
+
+
+
+
+
+
+ ... +
+ ... +
+
+
_
(14) (15) (16)
2. 1 6 Alternative Derivation of Expressions for Sk(n)
Expressions for Sk (nk)+can also be obtained by using a binomial expansion l for the term (i 1) , where we replace i successively by 1, 2, 3, . . . , n. +
12
1. Algebraic Identities and Equations
Thus, for computing 82 (n) we add the following n equations: 23 33 43
(1 + 1) 3 = (2 + 1) 3 = (3 + 1) 3 = (n + 1) 3 =
1 3 + 3 ·1 2 + 3 · 1 + 2 3 + 3 . 22 + 3 · 2 + 33 + 3 . 32 + 3 · 3 +
1
1 1
n3 + 3 n2 + 3 · n + 1 (n + 1) 3 S3 (n + 1) - 1 3 = S3 (n) + 3 · S2 (n) + 3 · S1 (n) + So(n), S3 (n + 1) - S3 (n) = (n + 1) 3 , ·
it follows
from which, in view of the equation that
3 · S2 (n) = (n + 1) 3 - 1 3 - 381 (n) - So(n) 3 (n + 1) - n. = n3 + 3n2 + 3n + 1 - 1 - -n 2
From this we easily obtain formula (13) for the sum S2 (n). 2. 1 7 Exercise
Use the method of 2.16 to determine S3 (n) and S (n). 4
2. 18 Remark
Both methods for determining Sk (n) that we have used in 2.14 and 2.16 are recursive: The sum Sk (n) can be found if we have already determined So (n), 81 (n) , . . . , Bk - 1 (n). In general, one can use the method of paragraph 2.16 to show that the recurrence relation (k! 1 )Sk (n) + (k! 1)Bk - 1 (n) + · · · + (kt 1)81 (n) + (:tD Bo(n) =
(n + 1) k+ 1 - 1
holds. Looking at formulas (8) and (13)-(16) one might expect that Sk (n) for each k is a polynomial in the variable n of degree k + 1. That this is indeed true foll o ws from the above recurrence relation by induction on k. state without Finall y , we have the following theorem, which we proof (see, e.g., [2J, Section 5.8, Theorem 3). 2. 1 9 Bernoulli 's Formula Theorem. If k > 2, then for the sum Sk (n)
following formula holds:
=
1 k + 2k + . . . + nk the
2 Finite Sums
13
where Bi is the so-called i th Bernoulli number. 2. 20 Remark on Bernoulli Numbers Bernoulli numbers are rational numbers; they occur in many fields of mathematics. The first few Bernoulli numbers are
Bl = --21 , B2 = -61 , B3 = 0, B4 = -310' Bs 0, B6 = 412' B7 = 0, Bs = -310' B9 = 0. We notice that starting with B3, all Bernoulli numbers in the above list with odd index are zero. This is no coincidence. In general, it is true that for an arbitrary natural number k we have B2k+l = 0, B4k-2 > 0, and B4k < 0. The Bernoulli numbers can be defined by the following recurrence relations:
B0 = 1, �
Bo = 1 and require that for an arbitrary natural number k we have 1 + (k!l)Bl + (k! l)B2 + . . . + (kt l)Bk = 0 (compare this with (17) for n = 1, keeping in mind that Sk (1) 1 and B1 = -�). We can use this to compute Bernoulli numbers with even index We set
=
that are not in the above list. For instance,
B10 = -111 (Bo + 11B1 + 55B2 + 330B4 + 462B6 + 165Bs) = - (..!_ -! + � - 1 + 1 - !) = � . 66 11 6 2
2
2. 21 Remark If we know the first ( k + 1) formulas for easily determine the value of the sum F ( 1 ) + F (2 ) + is an arbitrary polynomial of degree k . If = then
So(n), S1 (n),+. F.. (,nS) k where can (n), weF(x) F(x) a0 + a1x + + akxk , LF(i) = L(ao + a 1 i + + aki k ) i=l i=l 0 + a 1 L i + + ak L i k ao Li i=l i=l i=l = aoSo(n) + a 1 81 (n) + + ak Sk (n). ·
·
·
,
·
n
n
·
n
=
·
·
n
n
·
·
·
· ··
·
·
14
1. Algebraic Identities and Equations
Thus, for example,
L (2i - 1) = 2 n
·
i=l
S 1 (n) - So (n) = n(n + 1) - n = n2
(compare with 2.3.(i)). 2. 22 Exercises Following Remark 2.21, determine the following sums:
(i} S = 1 + 3 + 7 + .. · + (n2 - n + 1) . (ii) S = 1 + 15 + 6 5 + · · + (4n3 - 6n2 + 4n - 1 ). (iii) S = 5 + 35 + 1 13 + · · + (4n3 + 2n - 1). ·
·
2.23 Example Determine S = 1 2 - 22 + 3 2 - 42 + · · · + (2n - 1) 2 - (2n) 2 .
(i)
Using appropriate rules of summation, we get
FIRST SOLUTION .
S = 1 2 - 22 + 3 2 - 42 + · . .+ (2n - 1) 2 - (2n) 2 = [1 2 + 22 + 32 + · · · + (2n - 1) 2 + (2n) 2 ] - 2 [22 + 42 + · · · + (2n) 2 ] = [1 2 + 2 2 + 32 + · · · + (2n - 1 ) 2 + (2n) 2 ] - 8 · [1 2 + 2 2 + · · · + n2 ] = S2 (2n) - 8 · S2 (n) 2n( 2n + 1) (4n + 1) 8. n(n + 1) (2n + 1) 0 = = -n (2n + 1). 6 6 (ii) SECOND SOLUTION. We divide the 2n terms into n pairs. First we find the values of each of these pairs and add the results: ·
_
- (2 - 1) . (2 + 1) -(4 - 3) . (4 + 3) - (6 - 5) . (6 + 5) (2n - 1) 2 - (2n) 2
=
-3,
-7 '
-11 '
-[2n - (2n - 1)] · [2n + (2n - 1)] = -(4n- 1).
Then, adding the n equations by way of identity (9), we obtain n S = - [3 + 7 + 11 + ..· + (4n - 1)] = - 2 [4n - 1 + 3] = -n(2n + 1) . 0
2 Finite Sums
15
2. 24 Remark Both methods in the previous paragraph can be used to find expressions for n sums �� 1 with an even number of terms, where is a polynomial (in we had = In we used the fact that
alternating F(x)
( -l)2.2i+3 1F(i) F(x) x2 2 .23.(i) ). 2n 2n n 1 + . 2 ) i), ) F(i) E(-1 LF(2 LF(i i i=1 i= 1 i=1 =
2. 23.(ii) also the fact that 2n n 1 + E(-1) i F(i) EG(i), i=1 i=1 with G(i) F(2i - 1) -F(2i), where in both cases the sums on the right sides were determined according to Section 2. 2 1. and in
=
=
If the number of terms in the alternating sum is odd, we separate out the last term and thus reduce the problem to the above case.
2. 25 Exercises Find the following sums:
S 1 32 2. S S S2
(2n - 1 4 . 32 ( 1) (2n - 1 -1) + n
)2 . (i) = 2 + + 5 2 + · · · + (ii) s = 12 + 3 . 22 + + ...+ k + . k2 . (iii) = 13+ 33+ 5 3 + · · · + )3. (iv) = 13- 23+ 33- 43+ · · + ( n 1 3 � + 1 2±22 + 1 2 +22 +32 + . . . + 1 2 +22 ±32 +· · ·±n2 *( } · 1 V
·
·
3
•
n
2. 26 The Sums Rk(q, n) We now study the sums
Rk (q, n) defined by Rk (q, n) 1k q + 2k q2 + 3k q3 + + nk qn . We will further assume that q 1= 1, since for q 1 we have Rk (1, n) Sk (n); Sections 2.14-2.20 were devoted to this case. Furthermore, for k 0 we obviously have =
·
·
·
· · ·
=
·
=
=
16
1. Algebraic Identities and Equations
2. 27 Example Determine
q + 2 q2 + 3 q3 + + n · qn (q =/= 1) . (i) We use partial summation, where step by step we will sum the terms of n geometric progressions (see 2.2). Consider the following n equations: qn+l-q q + q2 + q3 + . . . + qn- 1 + qn q · qnq--111 9n+l_q ' 1 q 2 q2 + q3 + . . . + qn- 1 + qn q2 . qqn-nq-�1_ 1 qn+l_q3 ' 1 q q3 + . . . + qn- 1 + qn q3 . q---1 1 q- 1 ' R1 (q, n)
=
1·
·
· ·
·
·
FIRST SOLUTION .
=
=
=
qn- 1 + qn qn- 1 . qq2- 11 q71, qq-- 11
qn+t_9n-.l
q- 1 q- 1
=
9n+t_9n
•
'
This sum is
from which we obtain
R1 (q, n) (q !_ 1) 2 [n qn+ 1 - (n + 1) qn + 1]. =
·
·
·
(19) 0
We determine the difference between the sum and its product with (this is the same trick that led to the sum of So in Section If we write equal powers underneath each other, (ii)
SECOND SOLUTION .
R1 (q, n)
2.2). R1 (q, n) q q R1 (q, n) =
·
=
+
q
2q2 q2
+
+
qi 3q3 + + n . qn n, 2q3 + + (n - 1) q +n qn+1 , · · ·
·
·
·
·
·
then by subtracting the first equation from the second, we obtain
(q - 1) . R1 (q, n) -(q + q2 qn+3 +1 . . . + qn ) + n . qn+ 1 n . qn+1 q q - -1 q 1 + . . � [ n qn - (n + 1) . qn + 1]' q 1 =
=
=
+
_
17
2 Finite Sums
(19). R1 (q, n) q 2q2 3q3 n qn q (1 2q 3q2 n qn- 1 ), C (q, n) 1 2q 3q2 nqn- 1 Ro (q, n) q. �(q, n) (18), 1 n n+ [(n 1)q 1](q 1) (q q) C( q, n) q, n)] 2 (q 1) 1 n + n q ( n + 1) qn + 1 (q - 1)2 0 Since R1 (q, n) q C(q, n), we again obtain relation (19).
0 which leads to (iii) THIRD SOLUTION . We use differential calculus: We have = + +···+ · = + + + +···+ where the sum = is clearly the derivative + + +···+ of the sum with respect to the variable Since = 9n9+��q by we have + = �[D-( = dq .u.u ·
·
_
·
·
_
·
=
2. 28 Example Determine
R2 (q,n) 12q1 + 22q2 + 32q3 + ... + n2 . qn . =
To solve this problem, we follow the ideas of the second solution in where we derived the recurrence relation
2.27,
(q - 1) R1 (q, n) n qn+1 - �(q, n). We determine the difference between the sum R2 (q, n) and its product by q; in a similar fashion as in solution (ii) in Example 2.27 we obtain (q- 1) R2 (q, n) - [1 2 q + (22 - 1 2 )q2 (32 -22 )q3 + ... (n2 (n 1)2) qn] + n2 . qn+1 . Here each of the n s ands between the square brackets is of the form (k2 - (k - 1) 2) . qk (2k - 1). qk 2k . qk - qk . Therefore, (q- 1) R2 (q,n) -[(2q - q)n (2n 2q2 -2 q. 2 )n++1(2 3q3 - q3 ) + . . )] +n q q (2nq n2qn+1 [2(q + 2q22 + 3q3 . . nn . qn ) 3 +. )] q q q ( q n2 . qn+1 - 2R1 (q, n) + �(q, n). If we now substitute �(q , n) and R1 (q, n) according to (18) and (19), we obtain R2 (q, n) (q!1)s [n2 qn+2 - (2n2 + 2n - 1) qn+ 1 (n + 1)2 qn - q - 1]. (20) =
·
·
=
+
·
+
·
_
_
umm
=
=
·
=
=
+
+
_
_
_
+
.
·
·
+ .. +
+
.
+
=
=
·
·
·
+
·
18
1. Algebraic Identities and Equations
2. 29 Remark The method of solution in the previous example can also be used for deter mining for k > This will be a recursive method, similar to the method for finding that was explained in
Rk (q, n)
3. Sk (n)
2.18.
2. 30 Exercises In problems ( i) and ( ii) find the sums by using the method of any method to find the sums in ( iii)-( iv ) :
2.27.(iii); use
R2 (q, n). S(q) 2 + 6q + 12q2 + · · · + n(n- n1)qn-2 , where n > 2 and q 1= 1. S(t) 1 + 2t + 3t2 + · · · + (n - 1)t -2 • S(v) 1 2 + 22 · v + 32 · v2 + · · · + n2 vn- l . x 1= 0 determine S(x) (xn- l + x.}-1) + 2 · (xn-2 + xn1_2) + · · · + (n - 1) · (x + �) + n. (vi) Determine the sum R3 (q, n) 1 3 ·q 1 + 2 3. q2 + 33 . q3 + . . . +n3. qn. * (vii) Express Rk (q, n) recursively in terms of Ro(q, ) R1 (q, n), . . . , Rk- l (q, n). (i) (ii} (iii) (iv) (v) For
=
=
=
•
=
=
n ,
2. 31 The Sums S(q,n) Let us now consider the sums
S(q,n) P(1)q + P(2)q2 + P(3)q3 + · · · + P(n)qn , where q 1= 1 and P ( x) ao + a 1 x + a2x2 + · · · + amxm is a given polynomial of degree n. Clearly, n i n 2 + · · · + amim )qi i i + a + a E(ao (i)q S(q, n) E P 1 2 i=nl i=l n n n i i i 2 m qi ao Eq + · · a Eiq + a Ei q + · + a 1 Ei 2 m i= l i=l i=l i= l aoRo(q,n) + a 1R1 (q,n) + a2R2 (q,n) + · · · + am Rm (q,n). We can therefore express each sum S(q, n) as a linear combination of the sums Rk (q, n) ( k 0, 1, 2, ) which we already investigated in 2.262.30. =
=
=
=
= =
=
... ,m
19
2 Finite Sums
2. 32 Example Evaluate SOLUTION.
S = 32 + 242 + 235 + . . . + n 2+n 2 . According to 2. 3 1 we obtain
(18) and (19) with q = ! , n 1 ) [ ( ) n ( n + (!) 1 1 ] 1 1 2 S = (! - 1) 2 · n · -2 - (n + 1) · -2 + 1 + 2 · -2 -�2!;__- 1
and therefore, using !
_
0
2. 33 Exercises Determine the following sums:
S = 2 1 +1 2 · 22 + 3 · 23 + · · · + n · 2n. S = 2 · 2 + 6 22 + 12 · 23 + · · · + n(n + 1) · 2n . = 1 + � + � + . . . + ��-l- n 1 S 1 - � + �- � + · · · + ( -1) - · ��-t.
(i) {ii) (iii) s (iv)
·
=
2. 34 Remark The evaluation of by way of the sums may require some work because of the form of the expression + If, in addition, we do not have tables of the necessary formulas we can use the method of undetermined coefficients to find the for This method is based on the following theorem, which we sum of state without proof.
S(q, n)
(q, n) R k aoRo(q, n) + a1R1 (q, n) · · · +
amRm (q, n). Rk (q,S(q,n),n).
2.35
Transforming
S(q, n)
q 1
Let P(x) be a polynomial of degree m , and 1= a real number. Then there exist a polynomial of degree m and a number d E IR such that for each we have
Theorem.
Q(x) n n i = d+ n S(q,n) LP(i)q Q(n)q . i= 1 =
20
I. Algebraic Identities and Equations
2. 36 The Method of Undetermined Coefficients We assume that in Theorem we have · · · Then the polynomial ) is of degree m; we will therefore To try to determine it in the form evaluate the sum coefficients we must find the constant and First we find the coefficients bi from the following pairs of expressions for the differences
2 + x a + .3 x + a 5 (x) = a 2 o 1 P 2 + amxm . x Q ( 2 + + bm xm . x x + b + b Q(x) = b o 1 2 d m+ 1 S(q, n), bo , b1 , . . . , bm . S( q, n + 1) - S (q, n): n+1 i n (i)qi = (n + 1)qn+ 1 , S(q, n + 1) - S(q,n) = L (i)q L P P P i=1 i=n1+ 1 S(q, n + 1) - S(q, n) = d + Q(n + 1)q - n(d + Q(n)qn ) [Q (n + 1)q - Q(n)]q . Therefore, P (n + 1)q = Q(n + 1)q - Q(n). From the polynomial equation PFinally, (x + 1)q = Q(x + 1)q- Q(x) we determine the coefficients bo, b 1 , . . . , bm . we obtain the constant d from the equation S(q, 1) = d + Q(1)q. We illustrate the use of this method in the following example. ·
·
·
=
2. 37 Example Determine the sum SOLUTION.
S = � + � + � + + 2� We have n . n i S = S(�,n) = E ;i = E i(�) . i=1 i=1 · · ·
•
We will therefore attempt to find the sum in the form
Since
n
S(!2 ' n) - d + a +2nbn . S(1 n + 1 ) - S( 1 n) = n2n++ 11 ' 2'
2'
for each we must have
nn++11 _ a + bn(n+1+ 1) a +nbn ' 2 2 2 that is, n + 1 = -bn + (b- a ) . The polynomials x + 1 = -bx + (b - a ) are equal if and only if 1 = -b, 1 = b - a, that is, b = -1, a = -2 . From the formula for n = 1 , namely � = d + aib, we finally obtain d = 2 . Therefore n2 t2 . Let us add that the above can also be considered to b� S(�, n) = 2 a proof by induction. o
2 Finite Sums
21
2. 38 Exercises Use the method of undetermined coefficients to find the sums in Exer cise 2.33. For the remainder of this section we will be interested in sums of the form E: 1 ��!�, where are polynomials and has degree at least In some ( rather exceptional) cases one can write the result in the form ��:�, where and are appropriate polynomials. Such expressions, however, may not exist even for simple sums, such as E: 1 f or E� 1 -b· In the case where such an expression exists, we use the method of partial fraction decomposition to actually find it.
P(x), Q(x) F(x) G(x)
1.
Q(x)
2. 39 Example
S = / + � + � + · · · + n(n1+1) . SOLUTION. In this example we have P (x) = 1, Q(x) = x(x + 1). We decompose the fraction x ( x�1 ) into partial fractions. If 1 = -a + -b- ' -� x(x + 1) x x + 1 then 1 = (a + b)x + a, that is, a = 1 and b = -1, and therefore 1 1 1 -- --:- - - - -x(x + 1) x x + 1 (This expression is, of course, easy to ''guess'' by way of the calculation 1 = (x+ 1 )-x = 1 - 1 1 .) vve have there1ore ( x x+ x + 1) x (x+ 1 )
Find the sum
2
23
x
34
·nr.
�
In this sum of 2n summands we split off the first and the last term and pairs of neighboring collect the. remaining 2n - 2 summands into terms, with each pair adding up to zero. We obtain therefore
n-1
S = 1 - n +1 1 n n+ 1
2.4 0 Exercises Determine the following sums:
0
22
1. Algebraic Identities and Equations
S = k(k�1) + (k t 1){ k t2) + (k t2){ k t3) + · · · + n(n�1) , where k < n. (ii) s = /3 + 3�5 + 5\ + ... + ( 2n - 1 )(2nt 1 ) . (iii) S = 1�3 + 2� + 3�5 + · · + n(;+ 2 ) " 4 (iv) S = 1�4 + 4\ + 7-io + · · · + (3n -2){ 3nt 1 ) · (v) S = 1 -�-3 + 2-�- 4 + 3· � · 5 + · · · n(ntl�(nt2) · 1 (vi) S = 1·31· 5 + 3· 51 · 7 + 5· 71· + · · · ( 2n - 1 )( 2nt 1)(2n t3)· 9 (i)
·
+
+
2.41
Example
Determine the sum
S = 43 + 365 + 1447 + · · · n22n(n ++ 11) 2 · +
(i = 1, 2, . . , n), 2 + 2i + 1 - i2 = (i + 1 )2 - i2 = - 1 , 2i i +1 = i2 (i + 1)2 i2 (i + 1) 2 i2 (i + 1) 2 i2 (i + 1) 2
SOLUTION. Here each summand is of the form and we have
so that
i2�:tt)2 1
S = 3 + 365 + 1447 + · · · + n22n(n ++ 11) 2 2 2 2 ( 2 2 2 2 2 3 n 4 1) 2 1 3 2 = 1 2 . 22 + 22 . 32 + 32 . 42 + ... + n2 (n + 1) 2 = 112 - 212 + 212 - 312 + 312 - 412 + · · · + n12 - (n +1 1 ) 2 = 1 (n +1 1) 2 n((nn++1)2)2 . 4
.
n
+
--=-:------:-::-:
_
_
2.42 Exercises Evaluate:
= 1�2 + 2:3 + i.� + · · + �ct�t>1 · tn2±11) (ii) S - 1·32 + 21·33 + 337 ·4 + · · · + n3n(nt 2t2nt1 (iii) S = 1·2 + 21·33 + 325· 4 + ... + 2nn(nt 1) · (i)
s
·
_
...§_
·
2.43 Example Let us determine
12 + 22 + 32 + ··· + n2 8 =1·3 3·5 5·7 (2n - 1) (2n + 1)" �-�;-----:-
0
23
3 Polynomials
(2 i_1){2 i+ 1) = 4 i -1 . If
i2 In this sum each term is of the form we consider the sum 48, we can write each term in the form
S OLUTION .
·2
�
4i 2 4i2 - 1 + 1 1 1 + + = = 1 1 4i 2 - 1 4i 2 - 1 4i2 - 1 (2i - 1 )(2i + 1) ' Therefore, we have, by Exercise 2.40.(ii), 4S
S0 finally, 8 = 2.44
· ( (2n- 1)1(2n+1) ) = n + 2n�1 ·
= (1 + /3 ) + (1 + 3�5 ) + ·· + 1 +
n(n+ (2 2n+11))
·
Exercises
Evaluate
1
0
1
2
3
n -----(2n - 1 ) (2n + 1 ) (2n + 3) '
3 5 3 · 5 · 5·7 9 1 4 24 34 n4 . ( ) 8 = - + - + - + ·· · + 1·3 3 · 5 5 · (2n - 1) · (2n + 1)
* ( .) 8 =
1·
·
+
7
.. u
3
+
·
+ ··· +
7
Polynomials
The search for zeros of polynomials was for many centuries the basic prob lem of all of algebra. Even when algebra in its development departed to a great extent from this problem, polynomials continued to play an impor tant role in algebra as well as in a number of other areas (among the more remarkable occurrences are the Taylor polynomial for the approximate eval uation of functions, and the use of polynomials in interpolation questions). In this section we recall some basic terms connected with polynomials, and also several methods for finding their zeros . However, we are not con cerned with providing a well-rounded theory of polynomials; instead, we limit ourselves to some properties that receive relatively little attention in basic algebra courses but that are useful for solving certain problems. Although we have already used polynomials in the preceding sections, we will first recall some basic terms from their theory.
3. 1
Definitions
A polynomial in the variable form
x is an
expression that can be written in the
F(x) = anXn + an- 1 Xn- 1 + ·· · + a1 x + a , o
(21)
24
1. Algebraic Identities and Equations
No ai F(x), a0 ai
aixi
where n E and ( i = 0, 1 , . . . , n) , called coefficients, are numbers from are called terms o� some number domain (Z, Q, IR, C). The expressions the polynomial and is called the constant term. Those terms whose coefficients are zero can be disregarded in (21). A polynomial all of whose coefficients are zero = 0) is called the zero polynomial. After dropping possible zero terms, any nonzero polynomial can be written in the form 2 ) with the additional condition 1= 0. In this case the number n is called degree of the polynomial denoted by n = deg The degree of the zero polynomial will remain undefined. Polynomials of degree 1 are called linear, those of degree 2 quadratic, and of degree 3 cubic. We remark that the polynomial is uniquely determined by its coefficients, although it can be expressed in a variety of different forms.
(1
(F(x)
a F(x), n F(x)
aix�
F(x) .
3. 2 Example Show that the polynomial
F(x) = (1 - x + x2 - . . . - xgg + xioo) . (1 + x + x2 + . . . + xgg + xloo) has zero coefficients for all odd powers of x. SOLUTION. Using (5) and (7) with A = 1 and B = x, we get 1 x 1o1 1 x l O l 1 x2o2 F(x) = 1 + x 1 - x = 1 - x2 ' from which, using (5) with A = 1, B = x2 and = 10 1, we get F( x) = 1 + x2 + x4 + . . . + x19B + x2oo . Thus we have proved the statement of this example, and at the same time we also found the coefficients of the even powers of x in F(x) . Let us add that in general, the following is true: The coefficients of the odd powers of 0 x in F(x) are zero exactly when F(-x) is identical with F(x) . +
_
_
·
n
3. 3 Exercises For arbitrary k E N find the coefficients of the polynomials (i) = (1 + + + (ii) = + · + · + + . * (iii} Decide which of the two polynomials = + +
x)2k (1 - x) 2k - (1 x2 ) k , x) (1 x2) (1 x4 ) . . . (1 x2k - l ) (1 x2 x3 ) 10oo , G(x) (1 - x2 x3 ) 1ooo has the larger coefficient of x20 • (iv) For each k E N consider the polynomial Fk (x) = (x2 - x + 1)(x4 - x2 + 1) (x2k - x2,._ 1 + 1) . Determine the coefficients of all polynomials (x2 + x + 1)Fk (x). F(x) G(x) (1 F(x)
_
=
·
·
·
3 Polynomials
3.4
Zeros of Polynomials
25
x ax 1 ao
F(x) anxn an- l xn- l
We can substitute any number for the variable and carry out the required operations. If = + is a polynomial + + ···+ and a number, then the number
c
0, c F(c) . F( x)
F(x)
= is called the value of the polynomial at the number If then the number is called a zero of the polynomial (or a root of the polynomial equation = The following paragraphs will be devoted to the problem of finding zeros of polynomials, which is, as we already mentioned, one of the basic problems of algebra. Finding the (single) zero of a linear polynomial is very simple. We also have a formula for determining the zeros of a quadratic polynomial: The polynomial and discriminant + bx + with real coefficients ± .Ji5) D = has the zeros which are real if and only if D > Formulas for determining the zeros of polynomials of degree and do exist, but their application is so cumbersome that they are al most useless. For n > 5 the young Norwegian mathematician Niels Henrik Abel showed in that there does not exist a formula that would allow one to evaluate the zeros of an arbitrary polynomial of de gree n from its coefficients with the help of algebraic operations, including roots of arbitrary degree. This is why the approximate evaluation of zeros of polynomials belongs to the basic problems of numerical mathematics.
c F(x) 0).
2 ax b20.- 4ac
4 (1802-1829)
3. 5 Examples
b, c a, j2a,
c (b -
3
1823
a�, a2 , a3 , b�, b2 , b3 have to (a 1 + b1 x)2 + (a2 + b2x) 2 + (a3 + b3x) 2
(i) Which conditions will the real numbers satisfy so that the polynomial
is the square of some linear polynomial with real coefficients? SoLUTION .
that
We ass ume that there exist real numbers c, d with d
=I= 0 such
If the two polynomials are equal, then their values for any number must also be equal, in particular for 2 Therefore, -
(a 1
�
·
b1 �) 2 + (a2 b2 �) 2 + (aa •
�
•
�
ba
·
�) 2
=
0,
26
1. Algebraic Identities and Equations
from which in view of the fact that the numbers in parentheses are real, it follows that
(23) where � - Fu rthermore, if we equate the coefficients of x2 in (22) , we obtain (24) b� + b� + b� d2 1= 0. Conversely, if (24) and (23) are satisfied, then (22) holds for d. The required condition for the numbers a 1 , a2 , a3 , b1, b2 , b3 is therefore b� + b� + 0 b� f= 0 and the existence of a real number satisfying (23). q =
=
c = q
·
q
(ii) Find a real number p such that the difference between the real zeros of px + p 9 is equal to
x2 -
-
x 1 , x2
6.
x1 p+
= fD SOLUTION. The zeros of the polynomial are given by Since in this notation we have and = p-fD, where D = r - p + > the condition of the problem can be written as
4 36. 6 Xl -X2 (p + v75) -2 (p - v75) VD, which holds if and only if D 36. From the equation 2 4 + 36 36 0 and 4, and therefore obtain the polynomials we find the values 2 9 (x + 3) (x - 3) and x2 - 4x + 5 (x + 1) (x - 5) with the sets of xzeros 0 { -3, 3} and { -1, 5}. X 2 x 1 x2 ,
=
=
=
=
p =
-
p
-
=
p
p =
=
=
3. 6 Exercises (i} Find the sum S of the coefficients of the polynomial
3x + 3x2 ) 1988
3x - 3x2 ) 1989 . (ii) Show that for arbitrary real numbers a, with a f=. 0 and f=. the equation 1 1 1 + X X - a2 has two distinct real roots. * (iii) Decide whether there exist real numbers a, b, such that for each E :JR+ the polynomial ax2 has exactly two distinct F(x)
=
(1 -
·
(1 +
p, q
-
--
-p
A
positive real zeros. * (iv) Determine the numbers
a, b,
q
+ bx +
p, q
p
E
c
+A
lR such that
c
q,
27
3 Polynomials
+ a - lX - l + + + a
In analogy to Section 3.4, where we substituted a number for the variable a 1 x o , we can also substitute a x in F(x) = an xn n n polynomial G(x) for x . We thus obtain the polynomial ·
·
·
3. 7 Example Find those nonzero polynomials F(x) for which
F(x2 )
is equal to
(F(x)) 2 .
We will try to find the polynomial F(x) in the form (21), where n 1= 0. We assume that at least one of the coefficients ao is different from 0 and we denote by k < n the largest 0. Then the condition F(x2 ) = (F(x)) 2 can be written as k for which SOLUTION.
a an- b an-2 , .a. . ,=I=a�, k
n+k , we obtain 0 2anak , which x 0 contradicts the assumption. Therefore, an -1 a a 1 o and F(x) anxn . The condition F(x) (F(x)) 2 thus takes the form anx2n a;x2n , which holds if and only if an a;, that is, an 1. The required polynomials are therefore exactly the polynomials xn , where
If we compare the coefficients of
=
=
=
=
=
=
=
=
n
· · ·
=
=
D
E No .
3. 8 Exercises Find all polynomials F(x) that satisfy:
+
(i} (ii) (iii) *(iv) *{v)
F(x + 3) x2 + 7x 12. F(x2 1) x 1 1 - 8x7 6x5 - 4 . F(x - 1 ) + 2F(x + 1) 3x2 - 7x. F(x2 - 2x) (F(x - 2)) 2 • F(F(x)) (F(x)) n for a given n E N (deg F(x) > 0).
3. 9
Polynomial Division with Remainder
+
=
=
+
=
=
=
Let F(x), G(x) be polynomials, with G(x) nonzero. Then there exists a unique pair of polynomials H(x), R(x) such that F(x) = H(x) G(x) + R(x), (25) where R(x) 0 or deg R(x) deg G(x). The coefficients of the polyno mials H(x) , R(x) belong to the same number domain , or C as the Q coefficients of F(x), G(x). Theorem.
·
=
<
lit,
1. Algebraic Identities and Equations
28
A proof can be found in [4] ; the polynomials H(x), R(x) can be deter
mined by way of the well-known division algorithm, which we will not introduce here. We remark that the polynomial H(x) is called the (incomplete) and R(x) the from the division of the polynom.lal F(x) by the polynomial G(x). If R(x) = in (25), we say that the polynomial G(x) the polyno mial F(x), which we denote by G(x) l F(x). If furthermore F(x) is nonzero, then the inequality deg G(x) < deg F(x) is true. If, using Theorem 3.9, we divide F(x) by (x - c) with remainder, then R(x) = or deg R(x) = hence R(x) = for some real number If in (25) we substitute the number c for x, then
0
quotient
remainder
0
divides
0;
r
F(c) = H(c) (c - c) ·
hence F(c) =
r.
+ r;
r. We have thus derived the following theorem.
3. 1 0 Bezout 's Theorem
polynomial F(x) by (x- c) The remainder in the division of the istheequal to F(c) . The polynomial F(x) is divisible by (x - c) if and only if number c is a zero of F(x) .
Theorem.
3. 11 Multiple Roots It can happen that the number c is a zero not only of the nonzero polyno mial F(x), but also of the polynomial F(x)/(x - c). Then (x - c) 2 l F(x), and the number c is called a of the polynomial F(x). Obvi ously, there exists a largest < deg F(x) such that (x - c) k l F(x); the number c is then called a (or of the polynomial F(x). In the case where (x - c) k l F(x) , it is appropriate to call the number c an of the polynomial F(x). We also remark that a zero that is not multiple, that is, a zero with multiplicity 1, is called a
multiple zero kk-fold zero zero with multiplicity k) at least k-fold zero simple zero.
3. 1 2 Example
a,
a,
Determine the values b, n with b E lR, is at least a double zero of the polynomial
n
E
N, for which the number 1
a l + bx - 1.
F(x) = xn - xn =
a = >0, hence
F(x) has 1 as a zero if and only if F( 1 ) = b b. For F(x) to have a double zero, we need deg F(x) =
SoLUTION.
a
-
n
2. For
3 Polynomials
29
F(x) So,xlet2 -n1> 3.(xBy- (51)(xwe+ have 1), and therefore 1 is only a F(x). ) F(x) xn - 1 - ax(x1 n-2 - 1) (x - l)[(xn- + xn-2 + · · + x + 1) - ax(xn-3 + · · · + x + 1)], which means that 1 is at least a double zero if and only if it is a zero of the polynomial in square brackets, that is, if and only if n - a(n - 2) 0, and thus, a b n/(n - 2). We have shown that there exists for each 0 n > 3 a unique polynomial F(x) with the required properties. n
2 we have simple zero of =
=
=
=
=
·
=
=
=
3. 13 Exercises (i} Find the remainder of division of the polynomial
x + x3 + xg + x27 + xs1 + x243 by (a) x - 1. ( b ) x2 - 1. (ii) For which natural numbers n is 0 a zero of (x + 1) n + (x - 1) n - 2? For which n is it a multiple zero? (iii) Determine for which natural numbers n the polynomial 1 + x2 x4 + . . + x2n is divisible by 1 + x + x2 + · · · + xn . (iv) Determine the polynomial F(x) of smallest possible degree that upon division by (x - 1) 2 and (x - 2 ) 3 leaves remainder 2x, resp. 3x. (v) Let F(x) 1 + x + x2 + · · · + x 1999 . Find the remainder when F( x5 ) is divided by 1 + x + x2 + x 3 + x4 . Certain polynomials (for instance, 2x2 + 1, x4 + x2 + 1, x2 -x + 1) have no zeros in the field of real numbers. The situation changes if we extend the +
.
=
domain in which we look for zeros to include the field of complex numbers. 3. 14
The Fundamental Theorem of Algebra
Each nonzero polynomial F(x) of degree n has exactly n complex zeros x 1 , x2 , , Xn if we count their multiplicities, and we have F(x) anxn + an-1Xn- 1 + · · · + a1x + ao an (x - x1 )(x - x2 ) · · · (x - Xn ) · (26) A proof can be found in [8], p . 184.
Theorem.
•
•
=
=
•
30
1. Algebraic Identities and Equations
3. 15 Consequences (i) If F(x), G(x) are polynomials of degree not exceeding n and su<;h G(Ci ) that for n + 1 distinct numbers eo , c1 , . . . , Cn we have F (Ci) 0, 1, . . . , n ) , t}len F(x) G(x).
(i =
=
=
If we assume that the polynomials F(x) and G(x) are distinct, then F(x) - G(x) is a nonzero polynomial of degree not exceeding n and D has n + 1 zeros eo , c1 , . . . , Cn ; this is a contradiction. PROOF.
(ii) Each (complex) zero of F( x) is a zero of G (x) of the same or of higher multiplicity if and only if F(x) divides G(x). PROOF .
This follows by writing F(x) and G(x) in the form (26).
D
3. 16 Examples (i) Determine the natural number n for which the polynomial
F(x) = xn + (x - 1) n + (2x - 1) n - (3n + 2n + 1) is divisible by G($) = x2 - x - 2. SoLUTION . Since G(x) = x2 - x - 2 = (x + 1)(x - 2) , by 3.15.(ii) the polynomial F(x) is divisible by G(x) if and only if F( -1) = F(2) = 0. Now F(-1) = (-1) n + (-2) n + (-3) n - (3n + 2n + 1 n ) 0 if n is even, - -2(3n + 2n + 1 n ) :;f 0 if n is odd, and F(2) = 2n + 1 n + 3n - (3n + 2n + l n ) = 0. Hence G(x) divides F(x) if
{
D
and only if n is even.
(ii) Let a, b, c �e distinct real numbers. Show that
(a + b) (a + c) + (b + c)(b + a) (c + a) (c + b) (a - b) (a - c) (b - c) (b - a) + (c - a) (c - b)
SOLUTION .
equation
= 1.
By multiplying with the common denominator we obtain the
(a + b) (a + c) (b - c) + (b + c) (b + a) (c - a) + (c + a) (c + b) (a - b) = (a - b) (a - c)(b - c) , (27)
which can be verified by multiplying out all the parentheses on both sides. Instead of this laborious approach, a different method of proof can be used for identities of this kind: We substitute one of the given numbers (a, for
3 Polynomials
example) by the variable x, and rather than verifying the help of 3.15. (i) that the polynomials
31
(27), we show with
F(x) = (x + b) (x + c) (b - c) + (b + c)(b + x) (c - x) + (c + x)(c + b) (x - b), G(x) = (x - b)(x - c) (b - c) are equal. Since we are dealing with polynomials of degree at most 2, it suffices to verify the equation F(t) = G(t) for three distinct values of t, which we choose such that the evaluation of F(t), G(t) will be as easy as possible. Since G(b) = G(c) = 0, we determine the values F(b) and F(c):
F(b) = 2b(b2 - c2 ) - 2b(b2 - c2 ) + (b + c) 2 · 0 = 0,
and similarly
F( c) = 0. The third appropriate value is x = 0:
F(O) = bc(b - c) + bc(b + c) - bc(b + c) = bc(b - c) = G(O). Thus the proof is almost complete, but we must not forget that the numbers b, c, 0 are distinct only when be 1= 0. However, we have already verified equation (27) for a = 0, and it is similarly easy to verify it in the cases 0 b = 0 or c = 0.
(iii) Let the numbers a, b, c E 1R be such that a #= b and e = a3 + b3 +3abc. Show that c = a + b. SOLUTION. Set F(x) = x3 - 3abx - a3 - b3 • Clearly, F(a + b) = 0, and thus a + b is a zero of F(x). Since F(c) = 0, it suffices to show that F(x)
has a unique real zero. Since upon division we obtain
F(x) = [x - (a + b) ] [x2 + (a + b)x + a2 - ab + b2], it suffices to show that the trinomial x2 +(a+b)x+a2 -ab+IJ2 has a negative o discriminant in the case a 1= b. But this is clear, since D = -3(a- b) 2 . 3. 1 7 Exercises Show that (i)-(iv) hold for arbitrary distinct real numbers
a, b, c:
(i) a · f:�:�f:��� + b · �����:�:� + c · ���:���:�� = a + b + c. ( a+b a+c (b+c)(b+ a) + c2 . (c+a)(c+ b) 2 + b (a + b + c) 2 • (ii) a2 . (a-b (b-c)(b-a) (c-a) (c-b) (a-c) (x-a)(x-b) l (x-c)(x-a) (iii) (x-b)(x-c) (a-b) (a-c) + (b-c) (b-a) + (c-a)(c-b) bc(x-a) 2 ab(x-c) 2 ca(x-b) 2 2 (iv} (a-b) (a-c) + (b-c)(b-a) + (c-a)(c-b) .
_
-X
·
_
·
1. Algebraic Identities and Equations
32
(v)
Show that for arbitrary n
E
N the polynomial
(x + 1) 2n - x2n - 2x - 1 is divisible by 2x3 + 3x2 + x. * (vi) Determine all polynomials F(x) for which x F(x - 1) = (x - 26) F(x). ·
3. 18
·
Vieta 's Relations
By multiplying out the parentheses on the right-hand side of (26) we obtain relations between the coefficients of a polynomial and its zeros. Thus , the numbers x 1 , x2 are zeros of the quadratic trinomial a2 x 2 + a 1 x + ao exactly when
ao X X . (2B) a2 = 1 • 2 Similarly, x�, x2 , X3 are zeros of the cubic polynomial a3 x3 +a2 x 2 +a 1 x+ao a 1 = X1 + X , -2 a2
if and only if
ao = X X X . (29) a 1 X X + X X + X X , -a2 = X + X + X , 1 2 3 = 1 1 1 2 3 � 3 2 3 2 � �
- -
Analogous formulas can be written down for higher-degree polynomials. Finally, we note that in relations (2B) ( resp. (29)) we find the so-called elementary symmetric polynomials with two ( resp. three) variables. Here they are evaluated at the roots of the quadratic ( resp. cubic ) polynomials considered above. We will study these in detail in Section 4.
3. 1 9 Example Show that if the sum of any two of the zeros of the polynomial (30) F(x) = x4 + ax3 + bx2 + ex + d is equal to the sum of the remaining two, then a3 - 4ab + Be = 0. SOLUTION. We denote by x�, x 2 , x3 , x4 the zeros of the polynomial (30) and assume that x 1 + x2 = X3 + x 4 . By 3. 14 and by (2B) we have F(x) = (x - x 1 )(x - x2 )(x - x3 )(x - x4 ) = (x2 + px + q)(x2 + px + r), where p = -(x 1 + x2 ) = -(x3 + x4 ), q = x 1 x2 a r = x3x4 . Since (x2 + px + q)(x2 + px + r) = x4 + 2px3 + (p2 + q + r)x2 + p(q + r)x + qr, we obtain the following four equations from (30) by comparing coefficients:
a = 2p,
b = p2 + q + r,
e = p(q + r),
d = qr,
from which, upon substitution,
a3 - 4ab + Be = Bp3 - Bp(p2 + q + r) + Bp(q + r) = 0 .
D
3 Polynomials
33
3. 20 Exercises
(i) (ii) (iii)
3. 21
Suppose that the polynomial x2 + px + q has the following property: The sum of its zeros is equal to p + q, and the product is pq. Find the coefficients p, q. Show that if the product of two zeros of the polynomial (30) is equal to the product of the remaining two, then a2 d = r? . Let Sk be the sum of the kth powers of the two roots of the equation ax2 + bx + c = 0. Show that for each integer k > 0 the equation ask+2 + bsk+ l + csk = 0 is satisfied.
Example
Show that if the polynomial F(x) three real zeros, then p < 0. SoLUTION.
0
=
Since q 1= p < 0.
=
x3 + px + q, where p, q
E
lR, q 1= 0, has
By (29) the zeros xb x2 , X3 of the polynomial F(x) satisfy (x1 + X2 + X3 ) 2 = X� + X� + X� + 2(X 1 X2 + X 1 X 3 + X2 X3 ) = X� + X� + X� + 2p.
0,
we have X 1 X2 X3
1= 0 and therefore x� + x� + x� > 0;
hence D
3. 22 Exercises
{i)
Suppose that the sum of two zeros of the polynomial F(x)
{ ii)
=
is equal to 1. Determine A and the zeros of F(x) . Suppose that the zeros Xb x2 , X3 of the polynomial x3 +px + q satisfy
(iv} (v)
=
1
1
+ -. X 1 X2 Which condition do the coefficients p, q satisfy? Find a relation satisfied by the coefficients of the polynomial x3 + px2 qx + r .if one of its zeros is equal to the sum of the other two. Let the polynomial F(x) = x3 +px2 +qx + r have the zeros Xb x2 , X3 . Find a polynomial G(x) that has zeros x 1 x2 , x 1 x3 , x2 x3 , and a polynomial H(x) which has zeros x 1 + x 2 , x 1 + X3 , x2 + X3 . Express the coefficient r of the polynomial x3 + px2 + qx + r in terms of the remaining coefficients if it is known that one of the zeros of this polynomials is the arithmetic mean of the remaining two. X3
(iii)
2x 3 - x2 - 7x + A
+
-
1. Algebraic Identities and Equations
34
(vi) Show that for arbitrary nonzero numbers a, b E 1R the zeros X l , x 2 , X3 of the polynomial ax3 - ax 2 + bx + b satisfy the condition
(
)
1 +1 +1 = -1. (x 1 + x2 + x3 ) · X 1 X2 X3 * (vii)Let p, q, r, b, c be five different nonzero real numbers. Determine the sum x + y + z , provided that the numbers x, y, z satisfy the system y X Z + p p - b p - c 1, X + y + Z = 1, q q b q-c Z y X = 1. + -+ r r-b r-c
-+
=
-
3.23 Reduction of the Degree by Way of a Known Zero If we know a zero x 1 of a polynomial F( x), we can use this fact for finding its remaining zeros x2 , x3 , . . . , xn . By 3. 10, F(x) is divisible by the linear polynomial (x - x 1 ), and according to 3.14, F(x)j(x - x 1 ) has exactly the zeros x2 , X 3 , . . . , Xn · 3. 24 Example Show that
(31) SOLUTION. Let A denote the left-hand side of theorem 1.2 we have
(31) .
By the binomial
A3 = 16 - 3 · A · \j(3 v'2i + 8) (3 v'2i - 8) = 16 - 15A, and therefore A is a zero of the polynomial F(x) = x3 + 15x - 16. Since F(1) = 0, the number 1 is a zero of F(x). By dividing, we obtain the identity F(x)/(x - 1) = x2 + x + 16. This last trinomial has no real zeros, since its discriminant is -63. The only real zero of F(x) is therefore the D number 1. Since A is a real zero of F(x) , we have A = 1 .
3. 25 Exercises Prove: (i) (ii)
{/20 - 14v'2 + {/20 + 14J2 = 4. {//5 + 2 + \1-15 - 2 = -/5.
3 Polynomials
35
3.26 Rational Zeros of Polynomials with Integer Coefficients There exists an easy algorithm for finding rational zeros of a polynomial with integer coefficients (compare this with the general case described in 3.4) . Suppose we are given the polynomial (32) with integer coefficients ai, where an 1= 0. We wish to :find its rational zeros. If ao = 0, then one of the zeros is 0, and using the method described in 3.23, we may reduce the degree of F(x) and search for the zeros of F(x) lx. After a finite number of steps we always obtain a polynomial with nonzero constant term. We may therefore assume in addition that F(x) in (32) satisfies ao 1= 0. If a rational number a is a zero of F( x) , then we have F(a) = 0, and if we express a = rls, where r E Z, s E N and r, s are relatively prime, then n- 1 n F = an · + an - 1 + · · · + a 1 · + ao = 0,
(:)
(�)
(:)
from which upon multiplying by sn we obtain
�
1 1 an r n + an - 1 rn - s + · · · + a 1 · r · sn - + aosn = 0 . Since the integer r divides the first n terms on the left of this last equation, it also divides the last term aosn , which implies that r divides ao, since r and s are relatively prime. In complete analogy we find that s divides an . Since ao and an have only finitely many divisors, the rational zero a can take on only finitely many values. By successively substituting these values into F(x) , we find all rational zeros of F(x) . We remark that it is not necessary to substitute all possible values of a into F(x) . Indeed, for each integer k it is true that if rls is a zero of the polynomial (32) and r and s are relatively prime, then the integer F(k) has to be divisible by (r - ks) . This result will be proved in Section 10.11 in the third chapter. Using this criterion will save work with the substitutions: To begin with, it suffices to calculate F ( k) for suitably chosen k E Z (the usual choice is k = ± 1), then for each "'suspected" value a = r Is to check whether F(k) is divisible by (r - ks) . An example for this approach is given in 3.27. (ii) .
3. 27 Examples (i) Find the rational zeros of the polynomial F(x) = x4 - 4x 2 + x + 2. SOLUTION. By 3.26 we expect the rational zeros of F(x) to be of the form r Is, where r E { -2, -1, 1, 2} and s = 1 . Therefore, all rational zeros are in
1. Algebraic Identities and Equations
36
fact integers (this is true for any polynomial with integer coefficients that has 1 as leading coefficient). Substituting, we get F( -2) = 0, F( - 1) = - 2, F(1) = 0, F(2) = 4, and therefore -2 and 1 are the only ration al zeros of F(x) . We can now apply 3.23 and determine all zeros of F(x) : We divide 2 F(x) by the polynomial (x + 2) (x - 1) and get F(x) = (x + 2)(x - 1 ) (x x - 1). The quadratic polynomial x2 - x - 1 has zeros ( 1 ± .J5) /2, and from D this we have that the zeros of F(x) are -2, 1, (1 + v'5) /2, (1 - -15) /2.
(ii)
Find the rational zeros of G(x)
=
3x4 + 5x3 + x2 + 5x - 2.
SOLUTION. If the rational number rjs, with r, s relatively prime integers and s > 0, is a zero of G(x), then r E { 1, -1, 2, -2}, s E { 1, 3}, and there fore r/s E 1 , -1, }, -!, 2, -2, i, -i}- To avoid having to check whether �!loch of these eight values is a zero of G(x), we use the criterion from the end of Section 3.26: We set k = 1 (resp. k = -1 ) , so G ( 1 ) = 1 2 (resp. G( -1 ) = - 8 ); therefore, 1 and - 1 are not zeros of G(x). Now we set up a table with all six remaining triples of the values of rjs, r - s and r + s.
{
1:.
3
1
-3
1
2
-2
2
s
3
-3
r-s
-2
-4
1
-3
-1
-5
G(1 ) = 12
r+s
4
2
3
-1
5
1
G (- 1 ) = - 8
2
Since -5 is not a divisor of 12, and 3, 5 are not divisors of -8, it remains only to decide for r/s E -}, -2} whether G(r/s) 0. We verify by direct calculation that G (3) = G( -2) = 0, G( -}) = -100 / 27, which D means that G(x) has exactly two rational zeros: } and -2.
{�,
=
(iii)
Decide whether there exist rational numbers a, � such that the polynomials x2 + ax + b, x5 - x � 1 have a common zero.
SOLUTION . Then
We assume that some number a is a zero of both polynomials. a
5
= a
+1
and
a
2
=
-aa - b.
From the equation a2 -aa - b we first find an expression with coefficients c, d depending on a, b: =
a
5
=
5
= ro
2 (aa + b) = a[a2 ( -aa - b) + 2aba + b2 ] 2 ( -aa - b) (2ab - a3 ) + (b - a2 b)a (a4 - 3a2 b + b2 ) a + (a3 b - 2ab2 ) .
= a · =
( a2 ) 2
a
= a·
+d
3 Polynomials
37
From the equation a5 = a + 1 it follows that
=
(a4 - 3a2 b + b2 ) a + ( a3 b - 2ab2 )
a ( a4 - 3a2 b + b2 -
1) = -a3 b + 2ab2 + 1 .
Since the polynomial x5 - x 1 has no rational zeros (according to 3.26 the only rational zeros would be ±1 , which obviously does not occur), a is not a rational number. If a4 - 3a2 b + b2 - 1 =/:. 0, we would have -a3 b + 2ab2 + 1 E ' aa4 ...... 3a2 b + b2 - 1 which is a contradiction. Therefore, -
Q
( 33) ( 34)
a4 - 3a2 b + b2 - 1 = 0, -a3 b + 2ab2 + 1 = 0.
We will now eliminate b from equations ( 33 ) and ( 34 ) . If we subtract the identity ( 34) from ( 33 ) multiplied by 2a, we get
(35)
and thus
4a 10 - 8a6 - 4a5 + 4a2 + 4a + 1 2a5 - 2a - 1 2 . b= and b = 25a6 5a3 If we substitute these expressions for b and b2 into ( 34 ) , we obtain after simplification the following equation for the coefficient a: a 10 + 3a6 - 1 1a 5 - 4a2 - 4a - 1 0. =
This equation, however, has no rational roots (by 3.26 the only candidates would be ±1 which, however, is impossible) . This means that there are no D rational numbers a, b satisfying the required condition.
3. 28 Exercises Find the zeros of the polynomials in (i) -(iii): (i) F (x ) = x4 + 2x3 - 2x2 - 6x + 5. (ii) F (x ) = 2x4 + 7x3 - 12x2 - 38x + 2 1 . (iii) F (x ) = 3x6 + 17x5 + 22x4 - 4x3 - 23x2 - 13x - 2 . *(iv) Let a , b, p, q E and suppose that the two polynomials F (x) x3 + px + q, G( x ) = x2 + ax + b have a common irrational zero. Show that G ( x ) divides F ( x) . (v) The parentheses in the equation ( ) x4 + ( ) x3 + ( ) x2 + ( ) x + ( ) = 0 are replaced in an arbitrary order by the numbers 1 , -2, 3, 4, and -6. Show that each such equation has at least one rational root.
Q
38
4
1. Algebraic Identities and Equations
Symmetric Polynomials
For the solution of systems of algebraic equations in Section 5 we will require the concept of a polynomial in several variables. In this section we will study such polynomials and will be especially interested in symmetric polynomials and their connection with Vieta ' s relations from Section 3.18.
4 . 1 Definitions
polynomial monomials, (36) ( k 1 ' k2 , ' kn E ) a . xkl l x2k2 xnkn where a a number (depending on the n-tuple k 1 , k2 , . . . , kn), called a coefficient. If some ki is zero, we just leave out x�. Similarly, we drop
A in n variables x 1 , x2 , . . . , Xn is a sum of finitely many expressions, called of the form ·
·
·
·
·
·
·
1M .l"qQ '
i$
the terms with zero coefficients. Since monomials with the same exponent n-tuple can always be added together (by adding their coefficients) , we will for the remainder of this section assume that a given polynomial is a sum of terms (36) with distinct n-tuples of exponents k1 , k2 , . . . , kn · A polynomial all of whose coefficients are zero is called the The sum k 1 + k2 + · · · + kn is called the degree of the monomial (36). will be defined as the largest degree The of the monomials occurring in the given polynomial. If in a polynomial all monomials with nonzero coefficients have degree r , then we talk about a
degree of a nonzero polynomial homogeneous polynomial of degree is called symmetric A polynomial
zero polynomial.
r.
if for an arbitrary F(x 1 , x2 , . . . , Xn ) order Yb Y2 , . . . , Yn of the variables x 1 , x2 , . . . , Xn we have F (y�, Y2 , . . . , Yn ) = F(x�, X2 , . . . , Xn ) · It is clear that in order to check whether F(x 1 7 x2 , . . . , xn ) is symmet ric, it suffices to verify that F(x� , x2 , . . . , xn ) does not change when x 1 is interchanged with Xi for arbitrary = 2, 3, For example, the polynomial x� + 2x 1 x 2 + 3x� is homogeneous of second degree in the two variables x 1 , x2 , but is not symmetric (by interchanging x 1 and x2 we obtain 3x� + 2x1 x2 + x�, which is a different polynomial). On the other hand, the fourth-degree polynomial x� + x� x� + x� in the two variables x 1 , x2 is not homogeneous, but it is sy:rpmetric. However, this
i
. . . , n.
last polynomial can also be considered as a polynomial in three variables x 1 , x2 , X3 (where X3 occurs with exponent zero in all terms) ; then this polynomial is not symmetric (for example, by interchanging x 1 and x3 we obtain x� + x�x� + x�). Now, we could begin constructing a general theory of symmetric polyno mials in n variables. However, since in applications we most often come across polynomials in two or three variables, we will basically restrict ourselves to these cases.
4 Symmetric Polynomials
39
4 . 2 Elementary Symmetric Polynomials in Two Variables It is easy to convince ourselves that the polynomials
O'l (Xb X2 ) = X l + X2 , (37) 0'2 (x1 , X2 ) = Xl X2 are symmetric in the two variables x 1 , x2 • More generally, the following is true: If we choose an arbitrary polynomial F(y1 , Y2 ) and substitute Yl = 0'1 (x�, x2 ) and Y2 = 0'2 (x� , x2 ), then we obtain the polynomial F(x1 + x2 , x 1 x2 ), which is symmetric in the variables x 1 , x2 . The question ·
arises whether this simple method of constructing symmetric polynomi als is sufficiently general, that is, whether one can obtain any symmetric polynomial in this way.
4 . 3 Representation of Symmetric Polynomials in Two Variables Theorem. For an arbitrary symmetric polynomial F(x 1 , x2 ) in two vari ables there exists a unique polynomial H (Yl , y2 ) in two variables such that F(x�, x2 ) = H(x 1 + x2 , x 1 · x2 ). A proof of a more general statement can be found in [13] . By Theorem 4.3 it is therefore possible to use the polynomials (37) to construct arbitrary symmetric polynomials. Therefore, 0'1 and 0'2 are called elementary symmetric polynomials. We will now describe a method for expressing a given symmetric polynomial F(x 1 , x2 ) in terms of these. The terms of F(x�, x2 ) of the form aii xix� will be change4 to aii o:� , and we collect the remaining terms in pairs of the form aijXi� + a3ix{x�, where i > j. The symmetry of F(x�, x2 ) implies the equation aij = a3i, and thus we can factor out ai3 (x 1 x2 )i = aij � · It therefore remains to find j expressions for the sums of powers Si -j = xi- + x;- j . 4-4 Sums of Powers Using the binomial theorem
1.2,
we obtain the following expressions for
S k = xt + x�: S 1 = X 1 + X2 = 0'1 , S2 = X� + X� = (x 1 + X2 ) 2 - 2X 1 X2 = 0'� - 20'2 , s3 = x� + x� = (x 1 + x2 ) 3 - 3x 1 x2 (x 1 + x2 ) = 0'� - 30'10'2 , S4 = xi + x� = (x 1 + x2 ) 4 - 4x l x2 (x� + x�) - 6x�x� = O't - 40'2 S 2 - 6 0'� = O't - 40'2 (0'� - 20'2 ) - 60'� = O't - 40"� 0'2 + 20'� '
40
1. Algebraic Identities and Equations
85 = x� + x� = (x 1 + x2 ) 5 - 5x 1 x2 (x� + x�) - lOx�x�(x 1 + x 2 ) = err - 5er2 83 - 10er�er1 = err - 5er2 (er� - 3er1 er2 ) - 10er�er1 = er51 - 5er31 er2 + 5 er1 er22 .
We could continue in this way; however, in this text we will not require formulas for 8i (i > 5). Another way of deriving these formulas is based on the recurrence relation 8i+2 = er1 8i + 1 - er2 8i, of whose validity we can easily convince ourselves.
4 . 5 Examples To illustrate the method described above we will express the given poly nomials F(x�, x2 ), G(x�, x2 ) , and H(x� , x2 ) by way of the elementary symmetric polynomials er 1 and er2 introduced in (37).
(i) F(x 1 , X2 ) = X�X2 + xfx� + X� X� + X 1 X� + X�X2 + x 1 x�. SoLUTION . We divide the terms of the polynomials F(x�, x2 ) into pairs of the form xi� + x{x�, and factor out and substitute the sums of powers from Section 4.4: F(x�, x2 ) = (x�x2 + x 1 x�) + (xfx� + x�x� ) + (x�x2 + x 1 x�) = x 1 x2 (xi + x� ) + (x 1 x2 ) 2 (x� + x�) + x 1 x2 (x1 + x2 ) = er2 8 4 + er�8 2 + er2 er1 = er2 (erf - 4er�er2 + 2er�) + er�(er� - 2er2 ) + er2 er1 o = erier2 - 3er�er� + er 1 er2 . SOLUTION .
We have
G(x� , x2 ) = (x 1 - x2 ) 2ooo = [(x 1 - x2 ) 2pooo = (x� + x� - 2x 1 x2 ) 1 ooo = [(x 1 + x2 ) 2 - 4x 1 x2 pooo = (er� 40"2 ) 1000 . _
SOLUTION .
0
By combining factors in an appropriate way, we obtain
H(x�, x2 ) = (x 1 + 4x2 )(4x 1 + x 2 )(2x 1 + 3x2 )(3x 1 + 2x2 ) = [4(x� + x�) + 1 1x 1 x2] (6(x� + x�) + 13x 1 x2] = [4(er� - 2er2 ) + 1 1er2] [6(er� - 2er2 ) + 13a2] = (4er� + 9er2 )(6a� + er2 ).
o
4 Symmetric Polynomials
41
If we compare (37) and Vieta's relations (28), we notice that the right hand sides are identical. More exactly, the right-hand sides in (28) are the values of the elementary symmetric polynomials 0'1 and 0'2 evaluated at the zeros of the single-variable polynomial a2 x 2 + a 1 x + a0• Theorem 4.3 has therefore the following important consequence: An arbitrary symmetric
polynomial in two variables evaluated at the zeros of a given quadratic poly nomial F ( x) in one variable x can be expressed in terms of the coefficients of F(x). (A similar statement is true for polynomials of higher degrees. )
4 . 6 Examples (i) Compute the number c = x� + x�, where x 1 , x2 are the zeros of F(x) = x2 + x SoLUTION . One possibility would be to find the zeros of F(x) and simply
- 19.
substitute. However, it will be easier to express c in terms of the coefficients of F(x). Since by (28), 0'1 (x� , x2 ) = x 1 + x2 = and 0'2 (x� , x2 ) = x 1 x2 = we have
-1
-19,
c = s s = O'r 50'� 0'2 + 50'1 0'� = 5. +5.
-
=
(- 1)5 - ( -1)3 • (-19) -1901 .
(-1) . (-19)2
0
(ii) Determine the coefficient c in the polynomial x2 + x + c if its zeros x 1 , x2 satisfy the equation 2x� + 2x� = 2 + X2 2 + X 1 SOLUTION. We rewrite this equation into the equivalent form (x 1 =/:. -2, X2 =/:. -2) 2x� (2 + x 1 ) + 2x�(2 + x2 ) + (2 + x 1 )(2 + x2 ) = 4(x� + x�) + 2(xi + x� ) + 4 + 2(x 1 + x2 ) + x 1 x2 = Using the relations for sums of powers from the table in 4.4 we express the left-hand side of this last equation in terms of 0' 1 = x 1 + x2 and 0'2 = x 1 x 2 ,
-1.
0, 0.
and get
40'� - 120'1 0'2 + 20'{ - 80'� 0'2 + 40"� + 4 + 20'1 + 0'2 = Since by (28) we have 0' 1 = x 1 + x2 = 0'2 = x 1 x2 = c, we obtain by substitution a quadratic equation for the unknown coefficient c, namely 4c2 + 5c =
0.
-1, 0,
whose roots
c1 =
0,
C2 =
-� are the solutions to our problem.
0
42
1 . Algebraic Identities and Equations
4. 7 Exercises Let x 1 , x2 be the zeros of the polynomial x 2 + px + q. In (i),
(ii) determine
the quadratic polynomial with the zeros
( 1.) x3l , x32 .
(ii) X� + X2 , X 1 + X�. (iii) Find the real coefficient b of the polynomial x2 + bx - 1 x 1 , x2 satisfy the equation
if its zeros
4 . 8 Example Find the quadratic polynomial with zeros
X l + X2 = 1. SOLUTION. Then
x 1 , x2 , given xf + x� = 31
Let the polynomial in question be of the form
and
x 2 + px + q.
p
-
= X l + X2 = 0'1 , q = X 1 X2 = 0'2 .
By the identity for the power sum
ss
in
4.4 we have
Since p =
-0'1 = -(x 1 + x 2 ) = -1, we obtain for q the quadratic equation 2 5q - 5q - 30 = 0 which has the roots q1 = 3, q2 = -2. The problem is therefore solved by the two polynomials x2 - x + 3 and x2 - x - 2 (note 0
that one of them has complex zeros) .
4. 9 Exercises In problems (i)-(iii) find a quadratic polynomial with zeros x 1 , x 2 satisfying
(i) 4(x l + x2 ) = 3x l x2 , x 1 + x2 + x� + x� = 26. (ii) X� + X 1 X2 + X� = 49, xf + X�X� + X� = 931. ( iii) X� + X� = 7 + X 1 X2 , x¥ + X� = 6X 1 X2 - 1. *( iv) Let a, b be two distinct roots of the equation x4 +x3 = 1. Show that their product ab is a root of the equation x 6 x 4 + x3 - x 2 - 1 = o.
+
4 Symmetric Polynomials
43
4. 1 0 Elementary Symmetric Polynomials in Three Variables To express symmetric polynomials in three variables we need the three elementary symmetric polynomials
0'1 (x�, x2 , x3 ) = X 1 + x2 + x3 , 0'2 (X 1 , X2 , X3 ) = X 1 X2 + X 1X3 + X2X3 , 0'3 (X 1 , X2 , X3 ) = X 1 X2 X3 .
(38)
H we substitute them into an arbitrary (not necessarily symmetric) poly nomial in three variables 0' 1 , 0'2 , and 0'3 , we obtain a symmetric polynomial in the variables x�, x2 , and x3 •
4 . 1 1 Representation of Symmetric Polynomials in Three Variables Theorem. For an arbitrary symmetric polynomial F(x�, x 2 , x3 ) in three variables there exists a unique polynomial H(y1 , y2 , y3 ) in three variables such that F(x�, x2 , x3 ) = H(x 1 + x2 + x3 , x 1 x2 + x 1 x3 + x2x3 , x 1x2 x3 ). Once again, a proof of a �ore general result, which also includes Theorem 4.3, can be found in (13].
4 . 12 Table Finding the polynomial H ( Y1 , Y2 , Y3 ) of the previous theorem without deeper knowledge of the theory can be difficult. Therefore, we give at least a few such expressions in the following table; with its help we can continue our work in this and the following section.
S2 X� + X� + X� = 0'� - 20'2 , S3 = X� + X� + X� = 0'� - 30'1 0'2 + 30'3 , S4 = xi + X� + X� = O'i - 40'�0'2 + 20'� + 40"1 0'3 , ss = x f + x� + xg = O"f - 50'� 0'2 + 50'1 0'� + 50'�0'3 - 50'2 0'3 , sa = x� + x� + xg = 0'� - 60'{0'2 + 90'�0'� - 20'� + 60'�0'3 - 120'1 0'2 0'3 + 30'�, x�x� + x�x� + x� x� = 0'� - 20'1 0'3 , x�x� + ��x� + x�x� = 0'� + 30'� - 30'1 0'2 0'3 , X�X2 + X 1 X� + X�X3 + X 1 X� + X�X3 + X2X� = 0'1 0'2 - 30'3 , X�X2 + X 1 X� + X�X3 + X 1 X� + X�X3 + X2X� = 0'�0'2 - 20'� - 0' 1 0'3 , xix� + x�x� + x{x� + x�x� + x�x� + x�x� = 0'� 0'� - 20'� - 20'� 0'3 + 40'1 0'2 0'3 - 30"�. =
1. Algebraic Identities and Equations
44
4. 13 Examples (i) Find all values of the parameter
x3 - 6x2 + ax + a satisfy
a E 1R such that the zeros Xb x2 , X3 of
(k = 2, 3). x� 8 4.12 xt = x� + + k a, = 0' 6, , x I, = 0' X X 1 3 2 2 0'3 = -a, 81 0'1 = 6, 82 = O"� - 20'2 = 36 - 2a, 83 = 0'� - 30'10'2 + 30'3 = 216 - 21a. for SOLUTION. We use the formulas in Since are zeros of the given polynomial, we have and therefore =
Using the binomial theorem we then obtain
= (x1 - 3)3 + (x2 - 3)3 + (x3 - 3) 3 = 83 - 382 · 3 + 38 1 32 - 3 · 33 = 216 - 21a - 9(36 - 2a) + 27 · 6 - 81 = -27 0 and therefore a = -9. 0
3a,
·
(ii) Prove that the number
F(x) = x3 + �x2 - 1. SOLUTION. We set a 1 = \jf, a 2 = A, a3 {ji. Clearly, a31 + a32 + a33 = 1 2 + = 1 a1 · a2 · a3 = \j! · (- i) · ( t) = - i' a1 a2 + a1a3 + a2a3 = H_ + -\[j; + � = A ( \ff + A+ iff) = A · c.
is a zero of
=
9 - 9
9 4
3'
a� + a� + a� = (a1 + a2 + a3) 3 - 3(a 1 + a2 + a3 )(a 1 a2 + a 1a3 + a2a3 ) + 3a1 a2a3 , and therefore l = e - 3c· A · c - i , which implies that the number c is a zero of F( x) x3 + � x 2 - 1. =
o
4 Symmetric Polynomials
45
4. 1 4 Exercises (i) Construct a cubic polynomial whose zeros are squares of the zeros of x3 - 2x2 + x - 12. *(ii) Suppose that the three distinct numbers a, b, c E 1R satisfy a(a2 + p) = b(b2 + p) = c(c2 + p) E :JR. Show that in this case a + b + c = 0. (iii} Show that if a, b, c E 1R and a + b + c = 0, then for an appropriate p
(iv) (v)
Construct a cubic polynomial with zeros x 1 + x2 , x 1 where x 1 , x2 , X3 are the zeros of x3 + px2 + qx + r . Prove that
+ x3 , x 2 + x3 ,
if the numbers a, b, c E 1R satisfy
1 1 1 = + + a b c _a_+_b_+-c ' 1
then for each odd
n
E N,
Elementary symmetric polynomials can also be successfully used to find decompositions of symmetric polynomials (into symmetric factors) .
4. 15 Example Decompose the polynomial
into a product of symmetric factors. SOLUTION.
By 4.12 we have
and thus
F (x 1 7 X2 , X3 ) = (x l + X2 + X3 ) [(x 1 + X2 + X3 ) 2 - 3(X1 X2 + XtX3 + X2 X3 )) = (x 1 + X2 + X3 ) · (x� + X� + X� - X 1 X2 - X 1 X3 - X2 X3 ). 0
46
1 . Algebraic Identities and Equations
4 . 1 6 Exercises Write the polynomials ( i)-( iv) as products of symmetric factors:
(i) (x 1 + X2 )(x 1 + X3 )(x2 + X3 ) + X 1 X2X3 . (ii) 2(x� +x� + x�) + x�x2 + x1 x� + x�x3 + x1 x� + x�x3 + x2 x� - 3x1 x2 x3 . (iii) (x� + x� + x� + x 1 x2 + x1 x3 + x2 x3 ) 2 - (x 1 + x2 + x3 ) 2 (x� + x� + x� ). *(iv) (x 1 + x2 + x3 ) 3 - (x 1 + x2 - x3 ) 3 - (x 1 - x2 +x3 ) 3 - ( -x 1 + x2 + x3 ) 3 . 5
Systems of Equations
The problem of solving systems of equations belongs to the basic ques tions of classical algebra; it receives considerable attention both in secondary-school mathematics and in introductory university algebra courses. Unfortunately, attention is mainly concentrated on systems of lin ear equations, while as a rule much less attention is paid to systems of equations of higher degree, and to methods of their solutions. We will there fore try to partially fill this gap in what follows. The main emphasis in this section will be on Sections 5.7-5. 14 (especially the method of symmetric polynomials) . In the initial parts we will introduce several nonstandard approaches to solving systems of linear equations (5.1-5.6) .
5. 1 Systems of Linear Equations As we already mentioned, we assume that the reader is acquainted with algorithmic methods for solving systems of linear equations ( Gaussian elimination, Cramer's rule) . We will therefore restrict ourselves to those problems for which it may be advantageous to solve them -differently, especially by introducing new auxiliary variables. We point out that we will solve systems of equations with real coefficients and look for their real solutions.
5. 2 Example Solve the following system of n equations in n variables:
X 1 + 2x2 + 3x3 + · + ( n - 1 )xn- 1 + nxn X2 + 2x3 + 3x4 + · + (n - 1) xn + nx1 X3 + 2x4 + 3xs + + (n - 1 )x 1 + nx2 · ·
· ·
· · ·
Xn + 2x 1 + 3x2 +
· ·
·
= 1'
2, = 3' =
+ (n - 1)Xn- 2 + nxn- 1 = n.
5 Systems of Equations
47
SOLUTION.
It turns out to be very useful to introduce the new variable s = x 1 + x2 + · · · + Xn , since by adding all equations we now obtain
+
s + 2s + 3s + · · · + (n - 1 ) s + ns = 1 + 2 3 + ·
·
· + (n -
1) + n,
and thus s = 1. Next we subtract the second equation from the first, the third from the second, etc., and finally the first equation from the nth, thus obtaining the system
(1 - n )x 1 + x2 + · · · + x1 + ( 1 - n )x2 + · · · +
Xn- 1 + Xn- 1 +
Xn = -1, Xn = -1,
X2 + · · · + ( 1 - n )Xn- 1 + Xn = -1, Xn- 1 + (1 - n)xn = n - 1, X2 + · · · + which can be rewritten as
s - nx 1 s - nx2
-1, = -1, =
s - nXn- 1 = -1, s - nxn = n - 1
.
2- n . X 1 = X2 = · · · = Xn- 1 = n2 , Xn = n-
From this we get
We realize that the last two systems are only consequences of ( as opposed to being equivalent to) the original system; we convince ourselves by a test that the n-tuple obtained above is indeed a solution of that system: For k = 1, 2, . . . , n the kth equation of the original system has the form
Xk + 2 · Xk + 1 + · · · + (n - k + 1)xn + (n - k + 2)x 1 + · · · + n · Xk - 1 = k. By substituting the left-hand sides we then obtain
+ ( n - k) · ; + ( n - k + 1) . 2�n 2 2 +( n - k + 2) · -n + + n · -n = ; (1 + 2 + · · · + (n - k + 1) + · · · + n) + (n - k + 1) ( - :) l = ; . n(n+ ) - ( n - k + 1) = n + 1 - n + k - 1 = k. 2
;+2 ;+ ·
·
··
·
·
·
·
Therefore, the system has a unique solution.
·
0
48
I . Algebraic Identities and Equations
5. 3 Exercises Solve the following systems of equations:
(i) 2X 1 + X2 + X3 + · · + X 1 + 2X2 + X3 + · · + X1 + X2 + 2X3 + + ·
·
· · ·
Xn = 1, Xn = 2, Xn = 3,
X 1 + X2 + X3 + · · + 2xn n. (ii) X2 + x3 + · · · + Xn- 1 + xn = 0, + X3 + · · + Xn- 1 + Xn = 1, X1 + + Xn- 1 + Xn = 2, ·
=
·
· · ·
= n - 1. X 1 + X2 + X3 + · · · + Xn- 1 (iii} X 1 + 2x2 + 3x3 + · · · + ( n - 1 ) Xn- 1 + nxn = n, + 3x3 + · · + ( n - 1 ) Xn- 1 + nxn = n - 2, X1 + + ( n - 1 ) xn- 1 + nxn = n - 3, X 1 + 2x2 ·
· · ·
X 1 + 2x2 + 3x3 + · + ( n - 1 ) Xn- 1 ·
·
= 0.
5.4 Systems of Linear Equations with Parameters These systems actually represent a whole (normally infinite) set of systems, one each for a fixed choice of values of the parameters. For solving them, it is often necessary to discuss the form of the solutions ( possibly also their number) depending on the values of the parameters. In the following examples we will explain several methods of solution of systems of linear equations with parameters. Here, Xi are variables and ai are parameters.
(i) x 1 + x 2 + x3 = a�, + X4 = a2 , X 1 + X2 + x3 + x4 = a3 , x1 x2 + x3 + x4 = a4 .
( 39)
Introducing the auxiliary variable 8 = x 1 + x2 + X3 + X4 , we can rewrite the system ( 39) as
x 1 8 - a4 , x 2 = 8 - a3 , X 3 = 8 - a2 , X4 = 8 - a 1 . =
5 Systems of Equations
49
Summing the equations of the last system, we obtain 3s a t + a2 + a3 + a4 , hence s = (a t +a2 +a3 +a4 )/3, and the system (39) has the unique solution =
x2 = (a t + a2 - 2a3 + a4 )/3, Xt = (a t + a2 + a3 - 2a4 )/3, X4 = ( -2a t + a2 + a3 + a4 )/3, X3 = (at - 2a2 + a3 + a4 )/3, which must be verified by substituting. (ii) Xt - X2 - X3 - · · · - Xn- t Xn = 2a, -Xt + 3x2 - X3 - · · · - Xn- t Xn = 22 a, -Xt - X2 + 7X3 - · · · - Xn- t Xn = 23 a, (40) -Xt - X2 - X3 - · · · - Xn- t + (2n - 1 )Xn = 2n a . We rewrite the system ( 40) in the equivalent form 2Xt - (Xt + X2 + X3 + · · · + Xn ) = 2a, 22 x2 - (x t + X2 + X3 + · · · + Xn ) = 22 a, 23X3 - (Xt + X2 + X3 + · · + Xn ) = 23 a, ·
2n xn - (xt + X2 + X3 + · · · + Xn ) = 2n a; then, again setting s = Xt + x2 + X3 + · · · + Xn , we have Xt - � = a, x2 - -[2 = a, x3 - � = a, Xn - 2� = a, and by adding the equations of the last system we get
s - s (! + 2\ + � + · · + 2� ) = · a, from which by formula (10), s = · 2n · a. The system (40) has therefore a unique solution: Xk = a + s/2k = a ( 1 + · 2n- k ) for k = 1, 2, which n
·
n
n
. . . , n,
has to be verified by substituting.
(iii) 2xt - x2 -Xt + 2X2 - X3
= at , = 0, = 0, -Xn-2 + 2Xn - t - Xn = 0, - Xn- t + 2Xn = a2 .
(41)
50
1. Algebraic Identities and Equations
We rewrite the equations of the system ( 41) from the second to the second to-last one in the form x 1 - x2 = x2 - X3 , x2 - X3 = X3 - X4 , . · Xn - 2 Xn- 1 = Xn- 1 - Xn· The ''trick" of elimination relies on the introduction of the new variable t = x1 - x2 , and in view of the preceding equations we have .
,
t = X 1 - X2 = X2 X3 = X3 - X4 = · · = Xn- 1 - Xn· ·
-
The first and the last equations in the system (41) can also be expressed in terms of the variable t:
Thus we obtain the system
a 1 - t, a 1 - 2t, a 1 - 3t,
X1 = X2 = X 1 - t X3 = X2 - t
(42) Xn- 1 = Xn-2 - t = Xn = Xn- 1 - t = Xn =
a 1 - (n - 1)t, a 1 - nt,
From the last two equations of ( 42) we then determine t = ( a 1 -a2 ) / ( n + 1). Substituting this into the first n equations of ( 42), we find that Xk = a 1 - k · (a 1 - a2 )/(n + 1) for each k = 1, 2, . . . , n. To complete the solution it remains only to substitute into ( 41).
5. 5 Example Solve the system with parameters a 1 , a2 , . . . , an E JR.:
X 1 + X2 = a 1 , X2 + X3 = a2 , X3 + X4 = a3 , Xn- 1 + Xn an - 1 , Xn + x 1 = an . =
(43)
5 Systems of Equations
51
(i) FIRST SOLUTION. We begin with step-by-step elimination of the variables in the individual equations in ( 43):
X2 = a1 - x 1 , X3 = a2 - x2 = a2 - a 1 + x 1 , X4 = a3 - X3 = a3 - a2 + a 1 - x�,
Xn = an- 1 - Xn- 1 = an- 1 - an- 2 + · · + ( - l ) n+ l X! , X 1 = an - Xn = an - an- 1 + · · + (-l) nXl · ·
·
From the last two equations in ( 44) it is apparent that to proceed further we have to distinguish between the cases n even and n odd. (a) n = 2k. From the last equation in ( 44) it is clear that this system, and therefore also ( 43), has a solution if and only if a 1 + a3 + · · · + a2 k- 1 = a2 + a4 + · · · + a2k . In this case, ( 43) has infinitely many solutions, which can be expressed, by ( 44), in terms of the free variable x 1 . (b) n = 2k + 1 . In this case it follows from the last equation in ( 44) that 2x 1 = a2k + l - a2k + · · · + a 1 ; hence x 1 = (a 1 - a2 + · · · - a2k + a2k+ l )/2. If we write the original system as
X2 + X3 = a2 , X3 + X4 = a3 , Xn + X1 = an , X 1 + X2 = a 1 , then by repeating the above approach we obtain
a +a a X2 = a2 - 3 + 2- 2 k+ 1 1 , · · ·
and in complete analogy,
ai- 2 + ai- l a -a + Xi = i i+ l 2 · · · -
0
(ii) SECOND SOLUTION. We distinguish between the parities of n from the beginning, and introduce the auxiliary variable s = x 1 + X2 + · · · + Xn . (a) n = 2k. By adding the odd equations in the system (43) we find that 8
=
+
X 1 + X2 + · + X2k- 1 X2k = a 1 + a3 + · • · + a2k- 1 , · ·
52
1. Algebraic Identities and Equations
and adding the even ones,
therefore, a necessary condition for the solvability of the system is the equation a 1 + a3 + · · · + a2k- l = a2 + a4 + · · · + a2k . If this condition is satisfied, then ( 43) has infinitely many solutions, which can be expressed, as in 5.5.(i)(a), in terms of the free variable x 1 ; in the opposite case (43) has no solutions. (b) n = 2k + 1. H we add all the equations in ( 43), then upon dividing by 2 we get s
= x 1 + x2 +
· · ·
+ X2 k + l
= (a 1 + a2 +
· · ·
+ a2k + l )/2 .
To evaluate the variable x�, we add all odd equations in ( 43) , and obtain hence x 1 = ( a 1 - a2 + a3 - • · · a2k + a 2k + l ) /2. This method can also be used to find Xi , i = 2, 3, . . . , 2k + 1; we only have to change the order of the equations in (43) and rewrite that system in the form -
Xi + Xi+ l = ai, Xi+ l + Xi+2 = ai + l , (45) Then by adding all odd equations in ( 45) we get 0
5. 6 Exercises Solve the systems (i)-(v) , where p and ai are real parameters:
(i) X l + X2 + X3 + X4 = 2ab X 1 + X2 - X3 - X4 = 2a2 , X 1 - X2 + X3 - X4 = 2a3 , X 1 - X2 - X3 + X4 = 2a4 . (ii) (1 + p) xl + X3 = 1, X2 + X3 = 1, X 1 + ( 1 + p)x2 + X1 + X2 + (1 + p)x3 = 1.
5 Systems of Equations
(iii) x 1 + x 2 x 1 + X3 x 1 + X4 x2 + X 3 x2 + X 4 X3 + X 4
=
=
=
=
=
=
a 1 a2 , a 1 a3 , a 1 a4 , a2 a3 , a2 a4 , a3 a4 .
In (iv) and (v) , assume that a 1 + a2 + a3 1= 0: (iv) ( a2 + a3 )( x2 + x3 ) - a 1 x1 a2 - a3 , ( a 1 + a3 )( x1 + x3 ) - a2x2 a3 - a� , ( a 1 + a2 )( x 1 + x2 ) - a3x3 a 1 - a2 . (v) a 1 x 1 + a2 x2 + a3 x3 a 1 + a2 + a3 , a2x 1 + a3 x2 + a 1 x3 a1 + a2 + a3 , a3x 1 + a1 x2 + a2 x3 a 1 + a2 + a3 . (vi) Solve the following system with the parameter a E lR: 3 a, X + + X X X + + 1 3 n 2 2 2 a 5 Xn 4 , X 1 + 4 X2 + X 3 + + =
=
=
=
=
=
9 X l + X 2 + 8X 3 +
· · ·
=
· · ·
=
· · ·
+
Xn
=
a
8'
(vii) Solve the following system with parameters a�, a2 , a3 , a4 : a1 , 2x 1 - x2 a2 , -x1 + 2x2 - X3 -x2 + 2x3 - X4 = a3 , -x3 + 2x4 a4 . (viii) Show that if X 1 + X2 + X3 0, X2 + X3 + X4 0, =
=
=
=
=
Xgg + X lQQ + X1 0, X100 + X 1 + X2 0, Xgg X100 0. =
=
then X l
=
X2
=
X3
=
· · ·
=
=
=
53
54
1. Algebraic Identities and Equations
5. 7 Systems of Equations of Higher Degree As opposed to systems of linear equations, there is no universal method for solving systems of higher-degree equations. However, there are several methods that can be used in special cases. The simplest one is the elimina tion method, which with the help of one equation of the system eliminates several variables in the remaining equations. The disadvantage, however, is that if we use a nonlinear equation, then often the degree of the remaining equations will increase.
5. 8 Examples We will illustrate the advantages and shortcomings of the elimination method by solving three systems of nonlinear equations: (i) x 1 + 2x2 + x3 = 8,
x 1 + 3x2 + 2x3 = 12, X� + X� + X� = 1 9 .
SOLUTION . If we subtract the first equation from the second, we obtain x2 = 4 - X3 . Substituting this into the first and third equations, we obtain
a system of two equations in two variables:
X1 - X3 = 0 , x� + 2x� - 8x3 = 3. If we now substitute the first equation into the second, we get 3x� - 8x3 -3 = 0, which has the two solutions X3 = 3 and X3 - l Hence the system also has two solutions: x 1 = 3, x2 = 1, X3 = 3 and X1 = l , x2 = 13/3, 0 X3 = - l · =
·
-
(ii) X1 (X 1 + X2 ) = 9 ,
X2 (X 1 + X2 ) = 16.
SOLUTION. Adding the two equations, we obtain (x 1 +x2 ) 2 = 25 , and thus x 1 + x2 = ±5. The system therefore has two solutions, which we obtain by substituting x1 + x2 into the original equations: x 1 = �' x2 = 16/5 and 0 X1 = -�, X2 = -16/5.
( ) x21 + x22 = 37 ' � + x� = 3 . .1 ·11 ·
SOLUTION.
theorem,
We will try to eliminate the variable x 2 . By the binomial
4 x62 - (x22 )3 - (13 x21 ) 3 - 343 27 39 x21 + 7x41 - x61 ' x� = (x�) 2 = (3 - x� ) 2 = 9 - 6x� + x�, _
_
_
_
_
5 Systems of Equations
55
and therefore
2x� - 7xf - 6x� + � x� - �� = 0; this, however, is an equation of degree 6 that we cannot solve. The only possibility, namely reducing its degree by using 3.23, does not work, because
we have no root of this equation at all. Trying out all possibilities according to 3.26 (after multiplying by 27 so that we get a polynomial with integer coefficients) , we find that this polynomial has no rational roots. One method that leads to the solution of this problem will be described 0 in 5.10, and example 5.8.(iii) will then be solved in 5.1 1 . (ii).
5. 9 Exercises Solve the following systems of equations: (i) x� + x� + 6x 1 + 2x2 = 0, (ii) x 1 + x2 = -8.
(iii} (v) *(vii)
x� + 2x� = 9, (x 1 + 1) 2 + 2(x2 + 1) 2 = 22. X� - X 1 - 5 = 0, 1- 1 - 1 1 = 1 •
X2
X2 +
Xt
.!.1.
� X2 + X t
=
163
'
x1 + x2 = 5. (iv) 5x 1 + 5x2 + 2x1 x2 = -19, 3x 1 x2 + x 1 + x2 = -35. (vi) X� - X1 X2 = 28, X� - X1 X2 = - 1 2 . *(viii) 2x� + 3X1 X2 + X� = 1 2 , 2(X1 + X2 ) 2 - X� = 14.
X� - X 1 X2 + X� = 21, X� - 2X 1 X2 + 15 = 0. (ix) X� - X 1 X2 - X� + 3X 1 + 7X2 + 3 = 0, 2x� + x1 x2 - x� = 0. *(x) 3x� + X1 X2 - X1 + 4x2 - 7 = 0, X� + 2X 1 X2 - 2X1 - 2X2 + 1 = 0. x 1 + x2 = 2 , *(xt.} X 1 X3 + X2 X4 = - 8, X 1 X� + X2 X� = -4, XIX� + X2 X� = - 1 28 .
5. 10 The Method of Symmetric Polynomials The method of symmetric polynomials can be applied to the solution of sys tems of equations in which the unknowns occur as variables of symmetric polynomials. By the results of Section 4 we know that an arbitrary symmet ric polynomial can be expressed as a polynomial in elementary symmetric polynomials. Therefore, the whole system can be rewritten as a system in which elementary symmetric polynomials of the original variables occur as
56
1 . Algebraic Identities and Equations
new variables. The advantage of this method lies in the fact that as a rule, the new system is of lower degree than the original system. If we find the values of the elementary symmetric polynomials, then the values of the origial variables can be obtained as solutions of equations constructed with the help of Vieta's relations 3.18, which have degrees equal to the number of variables.
5. 1 1 Examples (i) Let us solve the system of equations x� + x� = 464, x 1 + x2 = 4. SOLUTION. It is true that by substituting the second equation into the first one we could obtain an equation in one variable, but we would be unable to solve it. Therefore, we use the method of symmetric polynomials, in the notation of (37) . By the power sum relationship 85
= X� + X� = O'r
-
50'� 0'2 + 50'1 0'�
from Section 4.4 we can rewrite our system as 0'� - 50'� 0'2 + 50'1 0'� = 464, 0'1 = 4, which, after simplification, gives 0'� - 160'2 + 28 = 0, and therefore 0'2 = 2 or 0'2 = 14. Thus we get two systems of equations in the original variables x1 , x2 :
x 1 + x2 = 4, X 1 X2 = 2,
x 1 + x2 = 4, X1X2 = 14, from which by 3.18 it follows that x 1 , x2 are zeros of the polynomials x2 4x + 2, resp. x2 - 4x + 14. The first one of these has the real zeros 2 ± J2, resp.
while the second one has no real zeros. Our system has therefore the two soutions x 1 = 2 + J2, x2 = 2 - J2 and x 1 = 2 - J2, x2 = 2 + J2 in real numbers. (If we wanted to solve the system in the field of complex numbers, we would obtain the additional two solutions x 1 = 2+iVTii, x2 = 2 - i VIO, resp. x 1 = 2 - iVTii, x2 2 + iVlO.) D =
(ii) Let us now solve 5.8.(iii) using the method of symmetric polynomials.
5 Systems of Equations
57
SoLUTION. Since by Section 4.4 we have the identities x� + x� = u� - 20'2 and x� + x� = 0'� - 30'1 0'2 , we can rewrite the original system as 21 - 2 2 = 7 0' 3' 0'� - 30' 1 0'2 = 3. 0'
By substituting 0'2 from the first equation into the second one, we obtain
which is an equation of degree three and has zeros 1, 2, and -3 (by 3.26). If 0'1 = 1, we get 0'2 = -�; if 0'1 = 2, then 0'2 = �' and for 0'1 = -3, we get 0'2 = 10/3. The original variables x1 , x2 are then the zeros of the polynomial x2 - x - i , resp. x2 - 2x + �' resp. x2 + 3x + 10/3. Thus we obtain the four real solutions (x1, x2 ) E { ( (3 + v'33) /6; (3 - v'33) /6) , ((3 - v'33) /6; (3 + v'33) /6), ( 1 + ¥'6/6; 1 - ¥'6/6) , ( 1 - ¥'6/6; 1 + ¥'6/6)} . If we wanted to solve the system over the complex numbers, we would obtain the additional two solutions x1 = ( -9 + iv'39) /6, x2 = ( -9 - iv'39) /6 and 0 X 1 = ( -9 - i v'39) /6, X2 = ( - 9 + iv'39) /6.
5. 12 Exercises Solve the following systems of equations; in (ix) , a E 1R is a parameter. (i)
X� + X� = 35, x1 + x2 = 5.
X� + X� + X1 + X2 = 32, 12(X 1 + X2 ) = 7X 1 X2· x21 x22 (v) - + 12 ' X2 X1 1 1 1 - + - = -. X 1 X2 3 * (iiv) X� - X� 19 (X 1 - X2 ) , X� + X� = 7 (x 1 + X2 ) · (i:x) X1 + X2 = a, x41 + x42 = a4 . (iii }
=
* (xi)
x1 + x2 - x3 = 7, X� + X� - X� = 37, X� + X� - X� = 1.
(ii)
X1 + X2 = 7, X X2 25 -1 + - = - . X2 X 1 12 (iv) X� - X 1X2 + X� = 19, x 1 - x 1 x2 + x2 = 7. x� + x� 31 * (vi) x� + x� - 7, x� + x 1 x2 + x� = 3. *(viii) (x)
x� + x2 = 5, x� + x� = 65.
X 1 + X2 = 3, x� + x� = 33.
58
1 . Algebraic Identities and Equations
5. 13 Examples Solve the following systems of equations: (i)
X l + X2 + X3 = 2, X� + X� + X� = 6, X� + X� + X� = 8.
SOLUTION. We express the polynomials on the left sides in terms of the elementary symmetric polynomials (38) , using Table 4.12, and we obtain the system
0'1 = 2, 0'� - 20'2 = 6, O"� - 30'1 0'2 + 30"a = 8, from which it follows that 0'1 = 2 , 0'2 = -1, 0'3 = -2. By 3 .1 8 , x 1 , x2 , X3 are zeros of the polynomial x3 - 2x2 - x + 2. By 3.26, the rational zeros of this polynomial can be only 1, 2, -1, -2. By substituting we find that the zeros are -1, 1, 2. The system has therefore six solutions, one of which is x1 = -1, x2 = 1, X3 = 2, and the others are obtained by changing the 0 order of the zeros. (ii)
X 1 + X2 + X3 = 6, X 1 X2 + X 1 X3 + X2 X3 = 11, (x 1 - X2 )(X2 - X3 )(X3 - X 1 ) = 2.
SOLUTION. While the first and second equations have symmetric polyno mials on the left-hand sides, the polynomial L = (x 1 -x2 )(x2 -x3 )(x3 -x 1 ) is not symmetric, since upon interchanging x 1 and x2 the sign will change. However, if we square it, it becomes symmetric, and we have
L2 = [(x 1 - x2 )(x2 - x3 )(x3 - x 1 )] 2 = (x� - 2x 1 x2 + x�)(x� - 2x2x3 + x�) (x� - 2x 1 x3 + x�) = [s2 - (2x 1 x2 + x�)] [s 2 - (2x2 x3 + x�)] [s2 - (2x 1 x3 + x�)], where 82 = x� + x� + x�, consistent with the notation in 4.12. We further set a = 2x 1 x2 + x�, b = 2x2x3 + x�, c = 2x 1 x3 + x�. Then L2 = (82 - a)(82 - b)(s2 - c) = s� - (a + b + c)s� + (ab + be + ca)s2 - abc. We express a + b + c, ab + be + ca, abc according to 4.12: a + b + C = 2X 1 X2 + x� + 2X2 X3 + X� + 2X 1 X3 + X� = 82 + 20'2 .
5 Systems of Equations
59
Since
+
ab = (2x 1 x2 + x�)(2x2x3 + x�) = x�x� 4x 1X�X3 + 2(x�x2 + x2 x�), we obtain by symmetry
ab + be + ca = (x�x� + x�x� + x� x�) + 4x 1 x2x3 (x 1 + x2 + x3 ) + 2(x�X2 + X 1 X� + X� X3 + X 1 X� + X�X3 + X2 X�) = 20'� 0'2 - 30'� ' and finally
abc = (ab)c = [x�x� + 4x1 X�X3 + 2(x�x2 + x2 x�)] (2x 1x3 + x� ) = 9x�x�x� + 2(x�x� + x�x� + x�x�) + 4x 1 x2 x3 (x� + x� + x�) = 270'� + 20'� - 180'1 0'2 0'3 + 40'r0'3 . Therefore, we have
L2 = s� - ( s2 + 2D"2 )s� + (20'�0'2 - 30"�) s2 - (270'� + 20'� - 180'1 0'2 0'3 + 40'r0'3 ) = -20'2 (0'� - 20'2 )2 + (20'�0'2 - 30'�)(0'� - 20'2 ) - 270'� - 20'� + 1 80'1 0'2 0'3 - 40'� 0'3 = 0'�0'� - 40'� - 40"r0'3 + 180'1 0'2 0'3 - 270'�. If we substitute 0' 1 = 6, 0'2 = 11 from the first two equations into the equation L2 = 4, we obtain 0'� - 120'3 + 36 = 0, and thus 0'3 = 6. The solutions of the original system are therefore the
zeros of the polynomial
x3 - 6x2 + 11x - 6 = (x - 1)(x - 2)(x - 3). Since in the course of this solution we carried out some irreversible steps (we took the square of an equation ) , not all six permutations of the numbers 1, 2, 3 may be solutions of our system. Indeed, by checking we find that the system has exactly three solutions: x 1 = 1, x2 2, X3 = 3 and x 1 = 2, 0 X2 = 3, Xa = 1 and X I = 3, X2 = 1, X3 = 2. =
5. 14 Exercises Solve the following systems of equations, where in (vi) a is a real parameter.
(i)
X 1 + X2 + X3 = 9, 1 1 1 -1 ' Xt + X2 + X3 X 1 X2 X 1 X3 + X2 X3 = 27.
+
(ii)
X 1 + X2 + X3 '-; , 13 ...!.. + ...!.. + ...!.. Xt X2 X3 = 3 . X 1 X2X3 = 1. =
·
60
1. Algebraic Identities and Equations
(x 1 +x2 )(x2 +x3 )+(x2 +x3 )(x3 +x l )+(x3 +x l )(x 1 +x2 ) = 1, X�(X2 + X3 ) + X� (X3 + Xt) + X�(Xt + X2 ) = -6, x 1 + x2 + x3 = 2. (iv) XtX2 (Xt + X2 ) + X2 X3 (X2 + X3 ) + XtX3 (X t + X3 ) = 12, XtX2 + X 1 X3 + X2X3 = 0, x1 x2 (x� + x�) + x2 x3 (x� + x�) + x 1 x3 (x� + x�) = 12. (vi) x 1 + x2 + x3 = a, (v) Xt + x2 + x3 = 0, x21 + x22 + x23 = a2 , X� + X� + X� = X� + X� + X�, X� + X� + X� = a3 • X t X2 X3 2. X� + X� + X� = 9, (vii) ..!.. + _!_ + _!_ = Xt + X2 + X3 , X l X2 X3 XtX2 + XtX3 + X2 X3 = -4. *(viii) X� + 8x� - X� = 3, 2XtX2 - X1X3 - 2X2 X3 = Xt + 2x2 - X3 , X 1 X2 X3 = - 21 · *(ix) X� + X� + xg - X� = 210, X� + X� + X� - X� = 18, x� + x� + x� - x� = 6, Xt + X2 + X3 - X4 = 0. *(x) 3XtX2X3 - X� - X� - X� = - 9, Xt + X2 + X3 = 3, X� + X� - X� = 5. (iii)
=
6
Irrational Equations
In this section we introduce several methods that can be used to solve irrational equations, namely equations that contain a variable underneath a radical sign. We will solve these equations in IR; therefore, we first recall the definition of a root of a real number: If n is an even natural number, we define the nth root of a nonnegative number a as the (unique) nonnegative number b for which bn = a (written b = y'a); for a < 0 the symbol yla is not defined. If n is an odd natural number, we define the nth root of a real number a as the (unique) real number b for which bn = a (again written b = y'a). We point out that the numbers a and y'a have the same sign.
6 Irrational Equations
61
6. 1 The Implication Method Irrational equations will be solved, as a rule, by using what we will call the implication method. ·we consider as part of this not only the usual re versible manipulations of equations (interchanging the sides of an equation, adding the same number or expression to both sides of an equation, mul tiplying both sides by the same nonzero number or expression) , but also several irreversible manipulations, especially those that are derived from the following theorem.
Theorem. Let L( x), R( x ) be expressions in the variable x defined on the set D C 1R. Then for each x E D we have
(i) L (x) R(x) ===} [L(x)] n = [R(x)] n for each (ii ) L(x) = R(x) ===} L(x) · G(x) R(x) · G(x), =
n
E N,
=
if the expression
G (x)
is defined for each x E D.
Remark. The implications (i) and Let now
(ii) can in general not be reversed.
Lo(x) = Ro(x)
(46)
be some equation in the variable x E lR, which we will solve by way of the implication method; that is, we construct the chain of implications
Lo(x) = Ro(x) ===} L 1 (x) = R1 (x) ===} • • • ===} Ln (x) = Rn (x)
(47)
such that we can easily determine the roots of the equation Ln (x) = Rn ( x); in fact, L n (x) and Rn ( x) are most often polynomials. If for i = 0, 1 , . . . , n we denote by /Ci the set of roots of the equation Li ( x) = R;, (x), then by ( 47) we obviously have /Co C /C1 C · · · C ICn , and therefore /Co C ICn· The set ICn certainly contains all the roots of the equation ( 46) (if they exist at all) and possibly also several other numbers that we drop when we carry out a check by substituting all numbers of the set ICn into ( 46). If we solve an irrational equation ( 46) by the implication method, then this check must be part of the solution. Therefore, this method is also called the method of analyzing and checking (by analyzing we mean the chain of implications (47)). Using this method for solving irrational equations therefore frees us from the necessity to keep track of whether for individual manipulations of an equation its domain of definition increases, or whether upon taking even powers the expressions on both sides of the equation have the same sign. The members of the set ICn \ /Co (which are sometimes called ''false roots" ) will be determined by checking.
1. Algebraic Identities and Equations
62
6. 2 Examples We now solve several simple irrational equations.
(i) yf1 + 3x = 1 - x. If we square both sides, we obtain the quadratic equation 1 + 3x = 1 -2x + x2 , that is, x2 - 5x = 0, which has the roots x 1 = 0, x2 = 5. Substituting these into the original equation, we obtain L(O) = 1 = R(O), L(5) = 4 1= -4 R(5). Therefore, the equation v'1 + 3x = 1 - x has exactly the one solution x = 0. (ii) yf1 + 3x = x + 1. Again by squaring we obtain the quadratic equation 1 + 3x = x2 + 2x + 1, that is, x2 - x = 0, with roots x 1 = 0, x2 = 1. Since L(O) = 1 R(O), L(1) = v'4 = 2 = R( 1) (having substituted into the original equation) , the =
=
given equation has the two roots 0 and 1 .
(iii) J2 + x2 = x - 1.
By squaring we obtain 2 + x2 = x2 - 2x + 1, thus 2x -1 and x = � By substituting we see that the original equation has no root at all, since =
-
.
L(-�) = li = J ;/= -J = R(- !).
6. 3 Exercises Solve the following equations:
Jx2 + 7 = 2x + 2 . vf31 + x - x2 = 5 - x. 2x - 6 = J6x - x2 - 5 . 2 (iv) J5x +- 1x = 1.
(i) (ii) (iii)
6. 4 Remark Even though by using the implication method one need not worry about the equivalence of the manipulations, one can sometimes significantly accelerate the solution of a problem by determining the domains of definition of the equation or checking the signs of its sides. Thus, for example, in problems (i)-(iii) below one can easily decide that the equation has no solution in lR, and in problem (iv) it is easy to "guess" the solution. (i) The domain of definition of the equation yf4 - x = v'x - 6 is the empty set, since the inequalities x < 4 and x > 6 cannot be satisfied at the same time. (ii) The equation v'x + 2 = -2 has no real root, for while its left-hand side is nonnegative, on the right we have the negative number - 2. �-
6 Irrational Equations
63
(iii) The left-hand side of the equation v'2x + 3 + Jx + 3 = 0 is a sum of a nonnegative and a positive number (indeed, for x > - � we have v'2x + 3 > 0 and Jx + 3 > 0, while for x < - � the equation makes no sense ) , and is thus a positive number. Therefore, the equation has no solution . (iv ) Let us now solve the equation
v'11x + 3 - v'2 - x - v'9x + 7 + Jx - 2 = 0. We easily convince ourselves that the domain of definition of this equation is D = { 2 } . H we substitute x = 2, we see that L(2) = v'25 - 0 - v'25+0 = 0 = R(2); the given equation therefore has exactly the one solution x = 2.
6.5 Exercises Show that the following equations have no roots in lR:
(i) (ii) (iii) (iv)
Jx - 6 + V3 - x = 4x - 3x2 + 1 . v'4x + 7 + v'3 - 4x + x2 + 2 = 0. v'x + 9 + y'x = 2. 2 · v'x3 - 4x2 + 1 + Jx2 · (x + 1) 3 = -5.
6. 6 Examples We solve now two equations in a standard way.
(i)
v'2 - x +
4 = 2. v'2 - x + 3
SOLUTION. If we multiply the whole equation by the expression 3, we obtain
v'2 - x +
2 - X + 3 · V2 - X + 4 = 2 · V2 - X + 6, which implies v'2 - x = x, and thus x2 + x - 2 = 0; this quadratic equation has roots x 1 = 1 , x 2 = -2. By trial we find that the original equation has O the unique root x = 1. v'x + 5 - v'X = 1. (ii) (48) SOLUTION .
By squaring equation
( 48) we obtain
x + 5 - 2 · .../x (x + 5) + x = 1, and thus x + 2 = .jx(x + 5). By squaring once more we get x2 + 4x + 4 = x2 + 5x, so x = 4. Since in ( 48) we have L( 4) = 1 = R( 4), the equation has O the root x = 4.
64
1. Algebraic Identities and Equations
6. 7 Remark It is often advantageous to begin solving an irrational equation by trans forming it appropriately. This can be done, for example, by separating one of the roots from the remaining terms and putting it on one side of the equation before taking powers . The necessary calculations are often sim pler this way. Let us convince ourselves of this by solving the following three equations:
( i) v'x + 5 - y'X = 1.
We have already solved this equation in 6 . 6 . ( ii ) . Here we transform it into Jx + 5 = 1 + y'X, then x + 5 = 1 + 2y'i + x, and thus y'X = 2 and x 4. This approach for solving (48) requires less work than the one used in 6.6 . (ii ) . =
(ii) 1 +
V1 - v'x4 - x2 = x.
We put the equation in the form .../1 - vx4 - x2 = x - 1, thus 1 Jx4 - x2 = x2 - 2x + 1, and by separating the root from the remain ing terms we obtain the equivalent equation 2x - x2 = vx4 - x 2 , which upon squaring gives x2 (2 - x) 2 = x2 (x2 - 1). Therefore, x 2 (5 - 4x) = 0, which means x 1 = 0, x2 = �. By checking we convince ourselves that while L (O) = 2 ;/= 0 = R(O), we have L(�) = £ = R( £ ), and the original equation has a unique root .
(iii) Jx + 1 + v'4x + 13 = ..j3x + 12.
Here we rewrite the equation as ..jr=3x-+""""1-="' 2 - Jx + 1 = v'4x + upon squaring we obtain the easiest possible consequence
13,
so that
3x + 12 - 2 V(3x + 12)(x + 1) + x + 1 = 4x + 13. J(3x + 12)(x + 1) = 0, which implies x 1 = -1, x2 = -4. While for x2 = -4 the expression v'x2 + 1 is not defined, x = -1 is a solution of the Thus
original equation.
6. 8 Exercises Solve the following equations:
(i) (ii) (iii) (iv) (v) (vi) (vii)
Jx - 1 + v2x + 6 = 6. Jx2 + 1 + Jx2 - 8 = 3. VX + 2 - V2X - 3 = VrX ----1.-.,.x2 + v'x2 + 20 = 22. v5x + 1 - v6x - 2 - vx + 6 + v'2x + 3 = 0. v2x - 4 - v3x - 11 = Jx - 3. + 3-= = 0. ..j6x + 1 + ..j4x + 2 - J8X - v'�2x---
6 Irrational Equations
65
6. 9 Multiplication by a Conjugate Expression
For solving certain irrational equations of the form ..Jf(X5 + ..j9(X} = cp(x ) , it may be useful to multiply by an expression of the form ..Jf(X5- ..j9(X}, which is called conjugate to the expression ..Jf[X5 + ..fi(X). The same is true for equations of the form ..Jf(X5 ..fi(X) = cp(x); in both cases use of the formula -
( ..Jf[X5 + v"9W) ( ..Jf[X5 - v"9W)
=
f(x) - g(x)
may simplify the equation, especially in cases where f(x) and g(x) are "similar." After this it is useful to consider the following pair of equations together:
..Jf[X5 ± v"9W cp(X ) ' =
f(x) - g(x) = cp(x) · ( J7(X) =t= v"9W) .
We illustrate the use of this method by solving the equation
.../2x2 + 3x + 5 + .../2x2 - 3x + 5 = 3x. If we multiply simplification,
( 49)
(49)
by the difference of the square roots, we obtain after
2x = x · ( .../2x2 + 3x + 5 - .../2x2 - 3x + 5), and since
x = 0 is not a solution of ( 49), we proceed to solve the system
.../2x2 + 3x + 5 + .../2x2 - 3x + 5 = 3x, .../2x2 + 3x + 5 - .../2x2 - 3x + 5 = 2. By adding the two equations we get 2 J2x2 + 3x + 5 = 3x + 2, and after squaring and simplification, x 2 - 1 6 = 0; thus x 1 = -4, x 2 = 4. Since the left-hand side of ( 49) is nonnegative, the right-hand side must also be nonnegative, and the number x 1 = -4 cannot be a root of ( 49). By substituting into (49) we verify that x = 4 is the ( unique) root of (49). ·
6. 10 Exercises Use the method of 6.9 to solve the following equations:
(i) (ii) (iii)
v3x2 + 5x + 8 - J3x 2 + 5x + 1 = 1. .Jx3 + x2 - 1 + .../x3 + x2 + 2 = 3. .../2x2 + 5x - 2 - J2x 2 + 5x - 9 = 1 .
66
1 . Algebraic Identities and Equations
6. 1 1 Method of Substitution A very efficient method for solving some irrational equations substitution. We illustrate this with several examples.
( i) In the equation
�+3
V 2+X
·
J
2+x 3-x
is
the use of
=4
we set J(3 - x)/(2 + x) t > 0; then the equation becomes t + � 1, t 2 3. If t 1 which gives a quadratic equation with roots h J(3 - x 1 )/(2 + x 1 ) 1, then x 1 !, and if t2 = J(3 - x 2 )/(2 + x2 ) 3, then x 2 - � . By checking we verify that both numbers are indeed roots of the original equation.
=
4,
=
=
=
=
=
=
(ii} x2 + Jx2 + 2x + 8 12 - 2x. We begin by writing this equation in the form x 2 +2x+8+ v'x 2 + 2x + 8 20. If we then set .../x2 + 2x + 8 z > 0, we obtain the quadratic equation z 2 + z-20 0 with roots z 1 z2 -5. In view of the condition z > 0, only the root z 1 makes sense, and the equation Jx2 + 2x + 8 which gives the numbers x 1 2 and x 2
=
= 4, = -4,
=
=
=
4 are also roots of the given equation.
=
=
=
(iii) To solve the equation
Vx - Jx - 2 + Vx + .../x - 2 = 3, in addition to the substitution Jx - 2 t 2:: 0 we use also the method of Section 6.9 . We have .../t 2 - t + 2 + v't 2 + t + 2 3, and by multiplying by the conjugate of the left-hand side of this equation we obtain the following system: =
=
v't 2 - t + 2 + v't2 + t + 2 3, 3 . ( v't2 - t + 2 - v't2 + t + 2) -2t. =
=
This implies 6 · v't2 - t + 2 9 - 2t, and thus 32t2 Since x t2 + 2, the root of the original equation is x we can convince ourselves by checking that L(73/32) 2
=
=
0, t2 9/32. 73/32, of which 9.
9
=
=
=
=
(iv) If the equation
is given, it is convenient to use the substitution y vfx + Jx + 2. We then have y2 x + 2 · Jx(x + 2) +x + 2 2(x + 1 + vx 2 + 2x), and the original equation becomes y2 /2 - 1 + y 3 , which has the number 2 as its unique nonnegative root. As solution of the equation Vx + .../x + 2 2 we find x i, which can be easily checked to be the root of the original equation.
=
=
= =
=
=
67
6 Irrational Equations
6. 12 Exercises Use an appropriate substitution to solve the following equations.
� - 2 . Iii£ = 1 . (ii) � - � = �. (iii) x2 - 4x + 6 = v'� 2x--:2::--_ : �8x-+--:1-::-2. (iv) 2x2 + 6 - 2 V2x2 - 3X + 2 = 3( X + 4). (v) Jx3 + 8 + {/x3 + 8 = 6. (vi) 3x2 + 15x + 2 Jx2 + 5x + 1 = 2. (i)
·
·
X · � - 1 - � - 1 - 4. �+ 1 �- 1 'x====l 5. 6.v x-+--=8=------=(viii) v'x + 3 + 4 . v'x - 1 + v' (ix) v'x + 2vx - 1 - v'x - 2vx - 1 = 2. 2x--:2::-: +� 2x-+ �9. (x) v'x2 + x + 4 + Jx2 + x + 1 = v'� (xi) v'x2 + x + 7 + vlx2 + x + 2 = vf3x2 + 3x + 19. (xii) v'x + v'x + ll + v'x - Jx + 11 = 4. (xiii) v'x - 1 + Jx + 3 + 2 · J(x - l)(x + 3) = 4 - 2x. ��
=
6. 13 Examples We solve now two equations that are more complicated; again it will be convenient to use substitutions.
(50)
(i) SOLUTION. If we set y of equations
= �2x - 1, then y3 = 2x-1. We obtain the system x3 + 1 = 2y, y3 + 1 = 2x.
=
By subtracting the second equation from the first, we get x3 -y3 2(y-x), thus (x -y)(x 2 +xy+y2 + 2) 0, and so either x y or x 2 +xy+y2 -2. If x y, then x3 + 1 2x, which has roots x 1 1 , x2 = -(1 + .../5) / 2, x3 -(1 - J5)/2; all three numbers also satisfy equation (50), which is easy to verify. The equation x2 + xy + y2 -2 has no real roots, since for each pair x, y of real numbers we have x2 +xy+y2 (x+y/2) 2 +3y2 /4 > 0. Equation (50) therefore has the three roots 1 , -(1 + J5)/2, -(1 - -/5)/2. D
=
(ii)
=
=
=
=
=
=
=
=
4(vfl + X - l)(vfl - X + 1) = X.
(51)
1. Algebraic Identities and Equations
68
v'1 + x, v = v'1 - x. Therefore, = 1 + x, v2 = 1 - x, and thus u2 + v 2 2 and u2 - v2 = 2x, where 0 < u, v < v'2. By substituting into (51) we obtain after simplification 8 · [uv + ( u - v) - 1 ] = u2 - v2 . In this equation we substitute the expression uv: Since (u - v) 2 = u2 - 2uv + v 2 , and using u2 + v2 = 2, we obtain 2uv = 2 - (u - v) 2 . Hence 8 - 4(u - v) 2 + 8(u - v) - 8 - (u - v)(u + v) = 0, (u - v)(8 - 5u + 3v) = 0. The condition u - v = 0 implies x = 0, which is also a solution of (51). The equation 5u - 3v = 8 has no solution, since from the conditions 0 < u, v < 0 v'2 it follows that 5u - 3v < 5u < 5v'2 < 8. SoLUTION. First we note that x E [-1, 1] , and we set u
u2
=
=
6. 14 Exercises Solve the following equations:
(i)
{1f;_- �
=
1.
y =:;:s = 1-12. y+-=2-+-=3=-vJ;r2= (n) Jy - 2 + J2y - 5 + v,.-
2 (iii) Jx + 8x + v'x + 7 = 7 Jx + 1 Jx + 1 *(iv) -x1 + 1 = 35 . v'1 - x2 12 -
6. 15 Equations of the Form y'a + cp (x) + Jb - cp (x)
= c
The method of ''paired" substitution, which we have used to solve example 6.13. ii , can be used in a standard way to solve equations of the type n a + cp(x)+ \jb - cp(x) = c, where n E N, a, b, c E lR, cp(x) is an expression in the variable x E lR, or equations of a similar type . If we set u = \1a + cp( x), v = \jb - cp( x), then simultaneously
u + v = c, un + v"' = a + b. Systems like this can be solved, for �ance, by using the method of symmetric polynomials from Section 4. Let us again consider two examples.
(i) The equation
�32 - X + �1 + X = 3, with the substitutions u = �32 - x, v = -¢/1 + x, leads to the system u + v = 3, u5 + v5 = 33,
6 Irrational Equations
69
which we have solved in Exercise 5.12.(x) ; hence, u 1 = 1, v1 = 2, or u 2 = 2, V2 = 1 . From the equation �32 - x = 1 we obtain the first root x 1 = 31 of the original equation, and from �1 + x = 1 we get the second root x 2 = 0, of which we can easily convince ourselves.
(ii) To solve the equations �8 + X + �8 - X = 1, we
use
the substitutions
u = {/8 + x, v = {/8 - x and solve the system u + v = 1, u3 + v3 = 1 6
If we set o-1
=
u1 (u, v) = u + v, o-2 = u2 (u, v) = u · v, then 1 = Ut ,
16 and thus o-1
.
1 and o-2
=
0"� - 30"1 0"2 ,
-5 . Therefore, u, v aie roots of the polynomial F(t ) = t 2 -u1 t+u2 = t2 - t-5, that is, {u , v} = { ( 1 + v'2I)/2, ( 1 - v'2I) /2} . Since X = u3 - 8, we obtain X 1 = 3 . v'2I, X 2 = -3 . m. We remark that the solution of these problems could be accelerated: Indeed, if u2 ( u, v) = u v = -5, then -5 = {/8 + x · .V8 - x . Therefore, {/64 - x2 = -5, which gives again x1 , 2 = ±3v'2f. By substituting we verify that both numbers are roots of the original equation; to do this, we can use the result of Example 3.24. =
=
·
6. 1 6 Exercises Use the method of 6.15 to solve the following equations:
(i) {/1 - X + {/15 + X = 2. (ii) {/2x - 2 + {/6 - 2x = vf2. (iii) �1 + 2x + �1 - 2x = �. (iv) \1'1 + vfx = 2 - \1'1 - JX. (v) 2 · {/(6 - x)(x - 2) + v'6 - x + v'x - 2 = 2.
6. 1 7 Equations of the Type .ifl(X} + \I9[X) = h(x) By using the formula
(u + v) 3 = u3 + v3 + 3uv(u + v),
70
1 . Algebraic Identities and Equations
we can modify the method introduced in Section 6.15 for n = 3 to in clude the solution of more complicated equations . Indeed, if in the equation ifJ(X) + \I9(X) = h(x) we set u = VJ{x), v = {19(X), then according to the formula above we have
ifJ(X) + \I9(X) = h(x)
====>
f ( x) + g(x) + 3h(x) · Vf(x) g(x) = h3 (x). (52) ·
We illustrate this approach with the following examples .
(i) The equation
�8 + X + �8 - X = 1 was already solved in 6.15. ii) . Now, using (52), we rewrite it in the form 8 + x + 8 - x + 3 . 1 . 3 ( 8 + x)(8 - x) = 1, which implies �64 - x2 = -5; hence again x 1 ,2 = ± 3 J21 . ·
(ii) Let us now solve the equation
�X - 1 + �X + 1 = X · -e-'2. Rewriting it according to (52), we get x - 1 + x + 1 + 3x {/2( x 2 - 1) 2x3 , and thus x · [3{/2(x2 - 1) - 2 (x2 - 1)] = 0, so x 1 0 or 3 {/2(x2 - 1) = 2 (x2 - 1); this last equation has roots ·
·
=
=
·
X2 = 1, X3 = -1, X 4,5 = ± V( 2 + 3vl3)/2.
The roots of the original equation are therefore some of the numbers Xi, 1 < i < 5. While it is easy to check each of the first three numbers (by simple substitutions we verify that each one is indeed a solution of the original equation) , we carry out this check for the remaining numbers X4 , Xs with the help of the following trick: We set a = �x4 - 1 , b = �x 4 + 1, c = X4 � and show that a + b = c. Indeed, an easy calculation shows that the numbers a, b, c satisfy the relation a3 + b3 + 3abc = c3 ; the desired equation a + b = c then follows from the result of Example 3. 16. (iii) . This works similarly for x5 . •
6. 18 Exercises Solve the following equations:
(i) �12 - x + ?'14 + x = 2 . (ii) ?'x + 7 + �28 - x = 5 . (iii) �2x - 1 + ?'x - 1 = 1. (iv) ?'x + 1 + ?'x + 2 + �r--x-+-=3 = o . (v) � + ?'2x - 3 = {/12(x - 1). * (vi) � + �x - 16 = ?'x - 8.
6 Irrational Equations
71
6. 19 Irrational Equations with a Parameter We now turn our attention to solving several types of irrational equa tions with parameters. We will use all the methods described above, and pay special attention to those problems that often cause considerable complications. (i) Jx2 + a = a - x, where x is a variable and a is a real parameter. We first square the equation: x2 + a = a 2 - 2ax + x 2 , and thus 2ax = a( a - 1 ) . For a = 0 we get the equation 0 = 0, whose roots are all numbers x E lR; for a 1= 0 it is x = (a - 1)/2. We now do the necessary checking. ( a) a = 0: By substituting into the original equation we get ..JX2 = -x, which is equivalent to lxl = -x, and holds if and only if x < 0. For a = 0 we thus have an infinite set K. of roots, with K. = RO . (b) For a 1= 0 we have
( )
( )
2 L a -2 1 = (a -4 1 ) + a = I a +2 1 I '. R a -2 1 = a +2 1 ' so that L = R if and only if Ia + 1 1 = a + 1, that is, a > - 1 . Therefore,
J
the given equation has the unique root x = (a - 1)/2 for each a E [-1 , 0) U (O, oo) , while it has no root for a E (-oo, - 1) . (ii) The equation
a · Jx + 1 + b a - b · Jx + 1
a+b a-b
with real parameters a, b makes sense only when a 1= b. We substitute y = Jx + 1 and rewrite it as (ay + b) (a - b) = (a + b)(a - by); then after some manipulations we obtain ( a2 + b2 ) y = a2 + b2 • Thus y = 1 and x = 0 for each pair of parameters a, b, where a 1= b. The checking in this case is easy. •
6.20 Example Solve the following equation with parameter a E lR:
x2 - Ja - x = a.
(53) ( i) FIRST SOLUTION. By separating the square root we obtain Ja - x = x2 - a, where a - x > 0 and at the same time x2 - a > 0, hence x < a < x2 • After these observations, by squaring we obtain
(54) which is an equation of degree four in the variable x, where none of its zeros are easy to �'guess. We will therefore use the following trick: Let us for a while consider equation (54) as an equation with variable a and parameter '1
72
1. Algebraic Identities and Equations
x; for then we have a quadratic equation a 2 - (2x2 + 1)a + (x4 + x) = 0 with discriminant D = ( 2x - 1) 2 . Therefore, we have either 2 + 1 + ( 2x - 1) 2x = x2 + x, a= 2
or
2 + 1 - (2x - 1) 2x = x2 _ x + 1. a= 2
Now we return to the original variable and parameter, and distinguish between two cases: ( a) a = x2 +x. Since a < x2 , we have x < 0. Then the quadratic equation x2 + x - a = 0 has discriminant D = 4a + 1 (which means a 2:: --}) and roots x 1 , 2 = ( -1 ± v'4a + 1) /2. The root x1 = (- 1 + v'4a + 1) /2 makes sense only for a E [-� , 0] , since for a > 0 we have X1 > 0. The root x2 ( -1 - v'4a + 1) /2 is negative for all a > --! . ( b ) a = x 2 -x+l. Since a < x2 again, we have ( -x+1) < 0, that is, x > 1, from which we furthermore obtain the condition a > 1. We will now solve the equation x2 -x+(1-a) = 0 only for parameter values a > 1, and we find X3,4 (1 ± ../4a - 3) /2. Since x > 1, the number X4 = (1 - v'4a - 3) /2 is not a solution. On the other hand, X3 = ( 1 + .J4a - 3) /2 works, under the conditions a > 1 and x > 1. In summary, we have that for a < --} the equation (53) has no solutions; for a = - � it has the unique root - �; for a E (--!, 0] it has the two roots x 1 , x2 ; for a E ( 0, 1) it has the unique root x2 ; and finally, for a > 1 it has D the two roots x2 , x3 . =
=
Note: The roots of equation (53) are "unpleasant," and checking them
by substituting would be difficult. Therefore, in the course of solving the problem above we made sure that all manipulations carried out were equivalences; we carefully followed the domains of definition of expres sions, squaring only nonnegative expressions. We will follow this cautious approach also in the second solution of (53) . (ii) SECOND SOLUTION. We use the substitution y = .Ja - x; then y > 0, a > x, and we solve the system
_ a + y, x2 y2 = a - x. Subtracting the equations, we obtain x 2 - y 2 = y + x; hence (x + y)(x y - 1) = 0. Now we distinguish again between two cases: ( a) x + y = 0; then x = -.Ja - x, that is, x2 + x - a = 0 under the condition that x < 0. We then continue as in 6.20. (i) , case ( a) . ( b ) x - y - 1 = 0; then x - 1 = .Ja - x, and thus x > 1. For a > i the equation x2 - x + (1 - a) = 0 has the roots x3,4 = (1 ± v'4a - 3) /2.
6 Irrational Equations
(1 -
73
Since X4 = ..j4a - 3) /2 < !, the number x4 is not a root of (53) for any value of the parameter a; the number x3 = 1 + J4a 3) /2 is a root exactly when X3 > 1 , that is, when a > 1 . A summary of these results can be found at the end of the first 0 solution.
(
-
6. 21 Exercises Solve the following equations, where parameter: (i)
(ii) (iii) (iv) *(v)
x
is a variable and
a is
a real
..,Jx2 + a2 = x + a. 1 + y'x = ..,jx - a. ..jx - a = a · JX. J(x + a) 2 + 4a + a = x. Ja + ..,ja + x = x.
6.22 Examples At the end of this section we will solve a few systems of irrational equations. We limit ourselves to systems of two equations in two variables, and we apply some of the tricks that were used earlier.
(i) vfx + 2V'Y = 9,
x - 4y = 9. SOLUTION . Since x > 0, y > 0, the second equation of the system can be rewritten in the form ( JX + 2..,JY) ( JX - 2..,JY) = 9, from which by the first equation it follows that JX - 2..,JY = 1. The system vfx + 2 JY = 9, vfx - 2 JY = 1, has the solution JX = 5, ..,JY = 2; hence x = 25, y = 4. By substituting we convince ourselves that the ordered pair (x, y) = (25, 4) satisfies both equations of the system and is therefore its unique solution .
(ii) � +
w = 35,
rx + {IY = 5.
SOLUTION . We use substitution; if we set y = v5 , we obtain
u3 + v3 = 35, u + v = 5,
0
u = rx, v = flY, i.e., X = u4 ,
1. Algebraic Identities and Equations
74
which we solve using the method of symmetric polynomials (see Section 4) If 0'1 = 0'1 ( u, v ) = u + v, 0'2 = 0'2 ( u, v ) = u · v, then we have : 0'1 = 5 and 35 = O" r - 30'10'2 , and thus o-2 = 6 . The numbers u, v are zeros of F(t) = t2 - 5t + 6, so either u = 2 and v = 3, or u = 3 and v = 2. In the first case we have x 1 = 16, y1 = 243, and in the second one, x 2 = 81 and y2 = 32. By substituting we convince ourselves that both pairs (16, 243) 0 and (81, 32) are indeed solutions of the original system . ·
[2X=T + fY+2 = 2 V Y+2 V 2i=l '
(iii)
(55)
X + y = 12.
SOLUTION. If we use the substitution
� = t > 0 for the first equation
of the system, then this equation appears in the form t + f = 2; this is a quadratic equation with a unique (double) root t = 1 . The system (55) then takes the form of the following system of two linear equations in two variables:
2x - 1 y + 2, X + y = 12, =
with the unique solution x of the system (55).
= 5, y = 7. The pair (5, 7) is then also a solution 0
6.23 Exercises Solve the following systems of equations, where in (viii) the numbers and b are real parameters:
(i) (iii) (v)
{IX + w = 4, xy = 27. y'x2 + 4xy - 3y2 = x + 1, x - y = l. 10 · � + 3x - 3y = 58, x - y = 6.
(ii)
[t + � = � ,
(iv) (vi)
* (vii)
x+yx 2 - y2 x - yx2- y2 1 7 x-y'x2 - y2 + x+y'x2- y2 - 4 '
x(x + y) + y'x2 + xy + 4 = 52.
*(viii)
X + y = 10. x + xy + y = 12, {IX + � + � = o . y - _§Q_ .V!iy + V!Vi ...fXY ' oiJY x + y = 20.
a
7 Some Applications of Complex Nwnbers
7
75
Some Applications of Complex Numbers
Now, at the end of the first chapter, we will concentrate on problems that thematically belong to the preceding sections but that can be conveniently solved by use of complex numbers, although in the statements of the prob lems only real numbers appear . We stress that the use of complex numbers for solving these problems is not imperative; however, it replaces a number of artificial tricks required in the corresponding "real" solutions, and thus makes for clearer solutions. We assume that the reader is familiar with the definition of complex numbers, knows how to work with their algebmic (a+bi) and trigonometric (r(cos � + i sin �)) forms and knows de Moivre 's theorem
(cos � + i sin �) t = cos t� + i sin t�, which holds for arbitrary numbers
� E 1R and t E Z.
7. 1 Sums of Binomial Coefficients Already in Section 1 . 3 . ( i) we saw that by appropriate application of the binomial theorem we can obtain the sums of certain binomial coefficients. If in 1 . 2 we now set A = 1 and B = i, we get
We evaluate the left-hand side by way of de Moivre's theorem:
Comparing the real and imaginary parts on both sides, we obtain
(;) (;) + (:) (�) - (;) + (;) -
-
· · · =
-
· · · =
(ht ros n; ,
(56)
( h t sin
(57)
n; .
Here, as in the following equations, the dots denote the terms in an obyious pattern, continuing as long as the binomial coefficients involved are defined (we have defined (�) only for k = 0, 1 , . . , n) . By adding and subtract ing (56), resp. (57) , to/ from 1 .4 . ( i ) , resp . 1 . 4 . ( ii ) , we obtain the following .
76
1 . Algebraic Identities and Equations
formulas:
n ;, (�) (�) (;) n + ( ) + (;) + . . . = 2n- 2 + (V2r - 2 sin ; , (�) ; n1r ' n( ) + (n) + ( n ) + = 2n-2 - ( vrn2) n-2 4 +
2
+ . . . = 2" - 2 + ( V2r- 2
+
10
6
· ··
008
(;) + (;) + (� ) + . . . = 2n-2 7. 2 Example For an arbitrary natural number
_
( V2) n- 2 sin
�1r ·
n, determine the sum
SOLUTION . We set c = cos ! + i sin � . In the binomial theorem 1 .2 we set A = 1 , B = ck , where k E {0, 1 , . . . , 5} , and we get
If t is an arbitrary natural number not divisible by 6, then ct 1= 1, and therefore by (5) , and using the fact that c6 = 1 , we have
0 ct - 1
-- = 0. If, on the other hand,
t E No is divisible by 6, then
1 + ct + c2t + €3t + €4t + c5t Adding (5 8 ) for all k
� 5
(59)
E
=
1 + 1 + 1 + 1 + 1 + 1 = 6.
{0, 1 , . . . , 5}, we get
(1 + ck )n = 6
(�)
+ (1 + c +
·
·
+ ( 1 + en + e2n + ·
·
·
+ e5) ·
(�)
+ e5n)
+···
(:) .
By (59) and (60) the sum on the right-hand side is 68 . Hence
S = 61 ((1 + 1 )n + ( 1 + €) n + . . . + (1 + €5)n] .
( 60)
7 Some Applications of Complex Numbers
77
ck
To evaluate the numbers on the right-hand side, we first determine the numbers by de Moivre's theorem:
Hence
Now we again use de Moivre's theorem,
(! ± i � ) n = [cos ( ± ! ) + i sin ( ± �)] n = cos n; ± i sin n; , n n n ± ± ± ± sin = cos = + � i ))] i ) ( � ) [JJ (� l )] [VJ( ( � i ( � =
( V3) n (cos n; ± i sin n; ) ,
and obtain the desired sum
c
We remark that the choice of the number that we have used above is not as unnatural as it may appear at first sight. By comparing the formula in the binomial theorem and the sum S we see that we need a complex number whose sixth power is 1 and whose first to fifth powers are not equal to 1 ( that is, a primitive sixth root of unity ) . It follows from de Moivre's theorem that the number = cos + i sin has this property ( apart from this number, so does but no-others) . For a similar reason D in 7 . 1 . 11- i sin we have worked with the number i = cos
cc5 ,
2;
2;
2;
2;
7. 3 Exercises For arbitrary natural numbers
(i) (ii) (iii) (iv) (v}
(�) + (;) + (:) + . . . (�) + (:) + (;) + . . .
n,
find the following sums :
. .
(�) + (�) + (�) + . . . . (�) - 3 (�) + 3 2 (:) - 3 3 (:) + . . . . (�) - 3 (;) + 3 2 (�) - 3 3 (;) + . . . .
78
1 . Algebraic Identities and Equations
7.4 Trigonometric Functions With the help of calculations based on the trigonometric form of complex numbers, we can obtain several interesting identities in which trigonomet ric functions occur. We illustrate this in the solutions of the following four examples. In the first two we apply a technique similar to the one in Sections 7.1 and 7.2, while in the remaining ones we will use the decom position of polynomials into linear factors and Vieta ' s relations between their coefficients and zeros.
(i) Express cos na and sin na for each n E N in terms of cos a and sin a. SOLUTION .
By de Moivre ' s theorem and the binomial theorem we have
(cos na + i sin na) = (cos a + i sin a) n = cos n a + i (�) cosn-la sin a cosn - 2 a sin 2a -i (;) cosn - 3 a sin3 a + (:) cosn - 4a sin4a + i (�) cosn - sa sins a - · · ,
(�)
·
from which we obtain the following two identities by comparing real and imaginary parts: cosn- 2 a sin2 a + (:) cos n- 4 a sin4 a cos na = cosn a sin na = (�) cosn- l a sin a - (;) cosn - 3 a sin3 a + (�) cosn- s a sins a - · .
(�)
·
-
·
·
·
·
,
D
(ii) Find the values of the sums 81 = sin � + sin( � + a) + sin(� + 2a) + · · · + sin(� + na) , 82 = cos � + cos( � + a) + cos( � + 2a) + · · · + cos( � + na) , for arbitrary n E N and �, a E :JR.
Z),
in which case we SoLUTION . The problem is trivial for a = 2k1r (k E have 81 = (n + 1) sin � , 82 = (n + 1 ) cos � - For all other values of a we consider the sum 8 = 82 + i81 : 8 = [cos � + i sin �] + [cos( � + a) + i sin(� + a) ] + [cos(� + 2a) + i sin( � + 2a) ] + · · · + [cos ( � + na ) + i sin( � + na) ] . To simplify notation, we set a = cos � + i sin � , de Moivre ' s theorem we have
(61)
b = cos( � ) + i sin( � ) . By
7 Some Applications of Complex Numbers
79
From the ass u mption a 1= 2k1r ( k E Z) it follows that b2 1= 1, so that by formula (5) we can evaluate 1+b2 +· · · +b2n and thus obtain the expression 8 = b2 a- 1 . (b2n+2 - 1) b(b -ab- 1 ) . bn+1 (bn+ 1 - b-n- 1 ) bn+ 1 _ b-n- 1 abn . (62) b - b- 1 By de Moivre's theorem it follows that b - b- 1 = (cos � + i sin � ) - (cos � - i sin �) = 2i sin � bn+ 1 _ b-n- 1 = (cos (n�1) et + isin n�1 ) _ (cos n�1) - isin (n�1 ) _ . . (n+21)et , 2 �sm a · bn = (cos�+ i sin�) · (cos n� + i sin n2"' ) = cos(�+ n2"' ) + i sin(�+ n�) . Substituting these into (62), we obtain (n+ 1)et sin 8 = sin !2 · [cos(�+ n2"') +isin(�+ n�)] , from which, upon comparing real and imaginary parts, we get with (61), (n+ 1)"' · sin(� + ) sin 2 sm2 2 ' 81 = sin � + sin( cp+a) + . . . + sin(�+na) = . (n+ 1)a cos(� + ) sin 2 sm. 2 2 82 = cos�+ cos(�+a) + · · · + cos(�+na) 0 for a 1= 2k1r (k E Z) . (iii) Show that for each n E N greater than 1 we have sm. -n1r sm. -21rn s1n. -37rn · · · s1n. (n -n 1 )1r = 2nn- 1 . (63) 2 , . .. , . c c SOLUTION The polynomial xn 1 has the n complex zeros 1, , cn- 1 , where c is the complex unit cos(27r/n) +i sin(27r/n). Its decomposition into factors is therefore xn - 1 = (x - 1)(x - c)(x - c2) · (x - cn- 1 ). If we divide the polynomials on both sides by x - 1, we obtain xn- 1 + xn- 2 + . ..+ x + 1 = (x - c )(x - €2 ) . .. (x - cn - 1 ), which by substituting x = 1 gives the equation n = (1 -c)(1 - c2) (1 - cn- 1 ). =
(
)a
(
,
)a
a
E:9.
a
.!!:!!
·
=
a
each
linear
·
·
·
·
·
1. Algebraic Identities and Equations
80
11 -cl · l 1 -c2 l · · 11 -cn- 1 1 , 1, 1 2k1r ) 2 2k 7r 2k1r . k1r . I2 - 2 cos n 11 - ck l = y. I( 1 - cos n + sm 2 n = 2 S 1n � = v (where we have used the well-known identity cos 2a = 1 2 sin 2 a ), we obtain the desired equation after dividing by 2n - 1 . This result has in teresting geometrical interpretation . It arises when in the complex plane one considers a regular n-gon whose vertices are the images of the complex numbers 1, c, c2 , , cn- 1 , and if one realizes that the absolute values of
This implies n = · since the absolute value of a product of complex numbers is equal to the product of the absolute values. If we substitute for each k = 2, . . . , n - the result of the calculation •
-
an
.
•
•
the complex numbers 1 - ck are equal to the lengths of the segments A1Ak . D The reader is invited to continue this argument .
E N verify the equality 21r n1r 37r cot 2 cot 2 cot 2 + · · · + + cot2 2n + 1 2n + 1 2n + 1 2n + 1
(iv) For each n 7r
SoLUTION .
+
n(2n 3
- 1) (64)
We will find an equation of degree n with the n distinct zeros
xk = cot2 2nk1r+ 1
1, 2, . . . , n) . To this end we use the expression for sin(2n + 1 )a in terms of sin a and cos a, which have derived in the solution of example (i) : 2 + 1 ) cos2n -2i s n2i+l . a a i sin(2n + 1 )a = t( -1 )i ( � 2J + 1 j=O If on the right-hand side we factor out sin2n+ l a, we obtain 2 1 sin(2n + 1)a = sin 2n+ a · t( -1 )i ( � + ) cot 2n -2i a j=O 2J + 1 (supposing sin a =I= 0) . We will use this last formula for each a = 2!�1 , where k = 1, 2, . . . , n . Since for each such a we have sin(2n + 1)a = 0 and sin a 1= 0, we conclude that all the numbers X defined above are roots of (k =
we
l
k
the algebraic equation
e 7 l) xn - e : l) xn- 1 + e : l) xn-2 _ . . · +( -l)n G: : D n
n
n
= o.
The sum of the roots of this equation is, according to Vieta's relations,
1) n(2n - 1 ) n e ;� >k = en+l ) = 3 . 1 k= l n
7 Some Applications of Complex Numbers
81
0
This proves equality ( 64) .
For the sake of interest we will now show how this result can easily be used to derive the sum of the important infinite series
w2 . 1 + 212 + 312 + 412 + . . . + n12 + . . . = 6
To achieve this, we begin with the fact that for each a, 0 < a < � , we have O < sin a < o < tan a. (Justify this inequality geometrically by comparing the areas of three shapes: an isosceles triangle with length of the equal sides and angle a between them, a circular sector with radius and angle a, and a right angled triangle with sides and tan a making the right angle). From these inequalities we get cot2 a < 2 < + cot2 a.
1
1
1
1 1 If we add over all a = 2!� 1 (k = 1, 2, . . . , n) , we obtain with (64) , n(2n - 1) � ( 2n + 1 ) 2 n(2n - 1) < LJ < n+ Q
3
k=l
3
kw
·
2n�l ) 2 , we reach the conclusion that for 1 212 + 312 + . . . + n12 , for each n E N we have the bounds 1( - 1 ) (1 - 2 ) w2 < S(n) < (1 - 1 ) ( 1 1 ) w2 From this, after multiplying by ( the partial sums S(n) = +
2n + 1 6 which confirms that S(n) --+ w 2 /6 for n --+ oo . 2n + 1
2n + 1
+
2n + 1 6 '
(v) Prove the identity
3C4i 3� _3 / 1 · (5 - 3 v3r,:;7) , cos 7 = y cos 7 + y 7+y y3C2; 2 c�
where (as in Section 6) the third root is considered to be a real function, that is, a bijection on the set :JR.
12
The equation x6 + x 5 + · · · + x + = 0 has the complex units e:, . . . , c-6 as roots, where c = cos + i sin These six complex numbers, upon substituting y = x + � (a standard method of solution for these so-called reciprocal equations), turn into the three real numbers SOLUTION .
c-2 ,
2;
Yl = 2cos 72w , Y2 = 2cos -4w7 ,
;.
82
1 . Algebraic Identities and Equations
which are solutions of the equation y3 + y2 - 2y - 1 = 0. This last equation can be derived by first dividing the original equation of degree 6 by x3 and then using the expressions
1 = y3 - 3y. X3 + 3 X
x + -X1 = y, Hence we have to verify the equality
{IYl + {IY2 + W3 =
\/5 - 3{/7,
where Yi are real roots of an equation whose coefficients we know. Let us therefore formulate the following more general problem: Given the cubic equation y3 - ay2 +by - c = 0 with real roots Yl , Y2 , Y3 (in our case a = -1, b = -2, c = 1) , construct an equation z3 - Az2 + Bz - C = 0 with real roots .vYl, {IY2 WS"· From Vieta's relations
Y l + Y2 + Y3 = a, Y1 Y2 + Y2 Y3 + Y3 Yl = b, Y1Y2 Y3 = c , it is immediately clear that from Table 4. 12:
{IYl + {/y2 + W3 = A,
� + � + � = B, �Y1 Y2 Y3 = C, C = {/C.
Next we use the following identity
(m + p + q) 3 = m3 + p3 + q3 + 3(m + p + q)(mp + pq + qm) - 3mpq. If we substitute the triple WI, {fY2, {(Y3, we obtain A3 = a + 3AB - 3C, and by substituting � , W2fj3, �, we get B3 = b + 3BCA - 3C2 • In the case of the coefficients a = - 1 , b = -2, c = 1 we therefore conclude that C = 1 and that A and B are the solutions of the pair of equations A3 = 3AB - 4 and B3 = 3AB - 5. Multiplying these two equations we obtain, for the new variable w = AB, the equation w 3 = (3w - 4)(3w - 5), or ( w - 3) 3 = -7. Hence w = 3 - {/7, and so A3 = 3w - 4 = 5 - 3 {/7 and B3 = 3w - 5 = 4 - 3{/7. Since A = .vY1 + f(ii2 + {(Y3, the proof is now D
complete .
7. 5 Exercises (i) Express tan 6a in terms of tan a for any a :JR. {ii) For each n prove the identity 211" 47r + cos 61r . . + cos 2n7r . cos + cos + 2n + 1 2n + 1 2n + 1 2n + 1 {iii) Show that for arbitrary n a 1R we have
E
EN
E N, E
(�) cos na + (�) cos(n - 2)a + (�) cos(n - 4)a + . . . + (:) cos(n - 2n)a = 2n
·
cosn a.
1
2
7 Some Applications of Complex Numbers a:,
83
For arbitrary n E N, {3 E find the sums 81 = (�) cos {3 + (�) cos( f3+o:) + (�) cos({3+2o:) + · · + (:) cos({3+no:) , 82 = (�) sin {3 + (�) sin({3+o:) + (�) sin({3+2o:) + · + (:) sin( f3+no: ). * (v) Let r, cp E lR, sin o: =F 0 and n E N. Prove the identitites sin cp + r · sin(cp+o:) + r2 · sin(cp+n2o:l ) + · · + rn sin(cp+nn o:2) sin cp - r sin(cp - ) r + sin(cp+ (n+1) r + sin( cp+no:) ) + o: + r2 1 2r cos cos cp + r cos(cp+o:) + r2 cos(cp+2n o:1 ) + · + rn cos(cp+nno:+)2 r cos( cp+no:) ) cos cp - r · cos( ) - r + cos(cp+ (n+1) + o: 1 - 2r cos + r2 * (vi) For each n E N verify the identity tan2 -4n1r +tan2 -37r4n +tan2 -4n57r + · · · +tan2 (2n 4n- 1)1r = n(2n - 1) . (vii) Let us return to the polynomial identity xn- 1 + xn-2 + · · · + x + 1 = (x - c:)(x - c:2 ) · (x - c:n- 1 ) (65) (c: = cos(21r/n)+i sin(27r/n)) from Example 7. 4 .(iii), where we havE:! substituted x = 1 . In the case of an odd n = 2m + 1 it is worth also substituting x = -1 . Do this, and thus derive the identity (for m E N) cos 2m1r+ 1 cos 2m + 1 cos 2m + 1 . . . cos 2m + 1 = 21m . (66) Let us note that the corresponding formula for even n = 2m, 21r- cos -37r- . . . cos (m - 1)7r = -Vm cos -2m1r- cos -2m 2m 2m""--�- 1 2m > 2), follows directly from (63) with the help of the (m E N, m identities k1r = sm. (m - k)1r = sln. (m + k)1r cos 2m 2m 2m used for k = 1, 2, . . . , m - 1. * (viii) Implement another method for deriving formulas (63) and (66) , namely one based on the multiple-angle formulas for sine obtained in(a)7.4.(i): First determine the polynomial A ( x) of degree m with zeros m 2 Xk = sin 2,!�1 (1 < k < m), Bm ( Y) of degree m with zeros (b) the polynomial 2 Yk = sin 2,!�2 (1 < k < m). the help of Vieta's relations then obtain again formulas (63) With and (66) . *(iv)
R.
·
··
a: ,
·
_
a: -
·
_
·
cp - a:
·
·
a:
··
a:
··
�
k
�
1 . Algebraic Identities and Equations
84
Using approach similar to 7.4.(v), prove the identity �/ 1 · ( 3v3/n9 - 6) 3L&i 3� 3C'ii + cos cos + = cos · y -g y -g y -g y 2 (x) Prove the following equalities: cos � = 1 cos 2;- -1�
* (ix)
an
+4v'S ,
=
v'5
.
7. 6 Polynomials I
s polynomial involving problems in used be also often can numbers Complex the of way by divisibility for testing in stance n i for coefficients, real with criterion introduced in 3. 15. (ii) . We will illustrate this with the following examples. (i) Suppose that the integer n > 1 is divisible neither by 2 nor by 3. Show that the polynomial '
is divisible by G(x) = x3 + 2x2 + 2x + 1 . G(x) . We easily polynomial the of roots the find first us Let G( -1) = 0, and thus G( x) is divisible by x + 1. By that ourselves convince dividing we obtain G(x) = (x + 1) (x2 + x + 1), x2 + x + 1 are ( -1 ± ivfa)/2. By 3. 15. (ii) we are done of zeros the where weBy can F(x) has -1, (-1 ivfa)/2, and ( - 1 - ivfa)/2 as zeros. that show the binomial theorem, we have for each x E lR, x 1= 0, 1 [(x + 1)n - xn - 1] , F (x) = F( -1) - [on - ( -1)n - 1] = 0, since get we substituting by which from . The values of the polynomial F(x) at the numbers ( - 1 + iVJ)/2 nandis odd ( -1 - ivfa) /2 can be computed together: SoLUTION.
if
+
X
•
=
F
( - l � iV3) = - l � ivl3 [ c ± i� r - (-� ± i �r 1
-1 .
By de Moivre's theorem we have c ± i�r - ( � ± i�r = (cos (± ;) + isin (± ;))" - (cos (± 2; ) + isin (± 2; ) r . . n1r - cos 3 n1r ± �s1n 2n7r . 2n1r . =F�sm = cos 3 3. 3 -
85
7 Some Applications of Complex Numbers
Ink Eview of the fact that n is divisible neither by 2 nor by 3, there exists a N such that n 6k ± 1, and thus sin n31r = sin (2k7r ;) = sin (± ; ) 2n7r , = sm. (± 321r ) = sm. ·(4k7r ± 321r ) sin 3 n1r cos (2k1r ± 1r ) cos (± 1r ) 1 , cos 3 2 3 3 2n7r (4k7r± 321r ) (± 21r ) = - 1 . s 3 2 By substituting these values we get ( - 1 ±2 iv'3) 2 cos 3 ± i sin 3 -1- cos± iv'32mr3 ± i sin 2n31r - 1 0 This completes the proof of the statement. (ii) Show that for arbitrary numbers n E N and a E 1R satisfying the conditions n > 1 and sin a 1= 0, the polynomial sin a - x sin na + sin(n - 1)a P(x) is divisible by the polynomial Q(x) x2 - 2xcosa + 1 . SOLUTION. It is easy to convince ourselves that Q(x) has the zeros x1 ,2 cos a ± i sin a. Thus, P(x 1 ,2 ) (cosa ± isina) n sina - (cosa±isina)sinna+ sin(n - 1)a. Ifuponwe simplification the expression (cos a ± isina)n cosna ± isinna, we obtain P(x 1 ) P(x2 ) cosnasina - cosasinna + sin(n - 1)a. expression on the right vanishes thanks to the the formula sin( n 1 )a cosasinna - cosnasina, which we can derive by applying de Moivre's theorem to both sides of the equality (cos a + i sin a) n-1 (cos a + i sin a) n (cos a + i sin a) - 1 have thus come the con and then equating, the imaginary parts. We clusion that P(x1 2 ) 0. By 3.15.(ii) this means that Q(x) divides0 =
±
=
=
COS
=
= COS
F
= COS
1!2!:
=
=
=
.!m.
=
o.
:l"
=
=
=
use
=
=
=
=
=
=
P(x).
·
to
1 . Algebraic Identities and Equations
86
7. 7 Exercises
Show that for arbitrary E No the polynomial (x + 1) 2n+ 1 + xn+2 is divisible by x2 + x + 1 . (ii) Show that the polynomial ( x sin + cos ) n - x sin - cos divisible by x2 + 1 for any E 1R and any E N,4a > 41. 1 4c+2 + (iii) Show that for any a, b, d E No the polynomial x + x b+ + x x4d+3 is divisible by x3 + x2 + x + 1. * (iv) Find all real numbers a E ( -2, 2) satisfying the following condition: polynomial The x1 54 - ax71 + 1 is a multiple of the polynomial x1 4 - ax7 + 1 . To concerning problem more one with deal we section this conclude polynomial with real coefficients, where again we apply complex numbers. (i)
n
na
a
a
n
a
na
n
is
c,
a
7. 8 Example X1 , x2 , . . . , Xn Xn + P1 Xn- 1 + P2 Xn -2 + · · · + Pn- 1 X + Pn P1 , P2 , . . . , Pn . (x� + · · · (x; + P2 + P4 - · · · ) 2 + (p1 - P3 + Ps - · · · ) 2
Let
be the zeros of the polynomial
Show that with real coefficients 1) 1) (1 SOLUTION . By 3. 14 we have =
Xn + P1 Xn- 1 + · · · + Pn- l X + Pn (x - Xl )(x - X2 ) · · · (x - Xn ) · x i, x -i (i - Xk )( -i Xk ) x� + (x� + ) · · · (x; + ) (in + P1 i n- 1 + · · · + Pn - 1 i + Pn ) n 1 n X (( -i) + P1 ( - i ) - + · · · + Pn - 1 ( -i) + Pn ) · a = - P2 + P4 - · · · , b = P1 - P3 + Ps - · · · , (x� + · · · (x; + ) = (ina + in- 1 b)(( -i) na + ( -i) n- 1 b) a2 + b2 , =
expressions two the multiply and this into We substitute thus obtained. Since 1, we have 1 1 then If we set 1 1) 1 also holds identity the that follows it (Furthermore, shown. be to was which in the case where the coefficients P1 , . . . , Pn are complex numbers.) =
=
-
=
=
=
D
7. 9 Exercises (i)
F(x) xn + an_ 1 xn- l + . . + a 1 x+ao polynomial the that Suppose has zeros Xt, x2 , . . . , Xn . Show that (x� + X1 + 1 ) · (x� + X2 + 1 ) (x; + Xn 1 ) 1 = 2 · [(A - B ) 2 + ( A - C) 2 + ( B - C) 2 ] , ·
=
· · ·
+
7 Some Applications of Complex Numbers as +
87
with A + + B + + C + · where and where the sums are taken over indices not exceeding we understand that 1 . *(ii) Let be the roots of the polynomial = ao
a3
· · · ,
= a1
a4
· · · ,
= a2
n,
an =
Xt , x2 , X3 , X4
Show that
· · ,
2 Algebraic Inequalities
Inequalities are essential tools in many areas of mathematics. Orderings of numbers, which are obtained by way of inequalities, find applications even outside of mathematics in various theoretical and practical fields. Secondary-school curricula have therefore traditionally devoted a certain amount of attention to linear and quadratic inequalities, and to inequalities involving absolute values. Already less emphasis is given to the •'calculus'> of operations with inequalities and to methods and approaches for deriv ing estimates for algebraic expressions, and for finding proofs. The present chapter is devoted to exactly these questions. First we de The necessary basic results are summarized in Section scribe a way of introducing inequalities between real numbers, and then we derive some basic rules of arithmetic with inequalities. FUrther theorems and important results, connected with various methods, will be considered throughout the appropriate sections. The proofs in two particular sections and require a more exact concept of irrational numbers. Although in the text itself we restrict ourselves to the case of rational numbers, the reader can find in Section 9 the necessary supplementary remarks on the general case. In the solutions to some examples, the letters L and R denote the left, resp. the right, sides of the inequalities under consideration.
1.
(1.10 8.6)
90
1
2. Algebraic Inequalities
Definitions and Properties
Already in early childhood, when our first ideas of the numbers 1, 2, 3, · · . are formed, we know about "bigger'' and "smaller'' ; this obviously occurs before we learn how to add or subtract these first numbers. Later we become aware of the fact that the difference a-b makes sense only when �'a is greater than b." We overcome this limitation by enlarging the collection of the original (positive) numbers 1, 2, 3, . . . by new numbers, namely zero and the negative numbers - 1 , -2, -3, . . (as numbers �'opposite" to the positive numbers) . Now we generalize this process: We construct the required theory of inequalities on the basis of dividing the integers into positive and negative numbers. In the following paragraphs we express the known properties of positive and negative numbers by way of the "rules of sign." .
1 . 1 Positive and Negative Numbers
1= 0
Definition. Every real number x is either positive or negative. The set 1R of all real numbers is therefore divided into three parts: the set JR+ of all positive numbers, the set :JR- of all negative numbers, and the singleton How is this subdivision preserved under arithmetic operations? We give only those rules that will be required later:
{0} .
(i) (ii) (iii) (iv) (v)
a E JR+ A b E JR+ ==> (a + b) E JR+ , a E JR+ A b E :JR+ ==> ab E :JR+ , a E lll- � (-a) E :JR+ , a E JR.+ A b E :IR- ==> ab E :IR- , a E :JR+ � -!- E :JR+ .
A real number x ¢ 1R- is called nonnegative; the set of all nonnegative numbers is denoted by :JRt , so that JRt = :JR+ U We will often require a generalization of (i) to the case of a sum of several numbers from :JRt . We therefore list this as an additional rule:
{0} .
(vi) If a1 , a2 , . . . , an are nonnegative numbers, then s = a1 + a2 + · · · + an is also nonnegative; furthermore, s = if and only if a 1 = a2 = · · · = an = o.
0
It is easy to derive (vi) from (i): The value of the sum we leave out all summands ai that are equal to zero.
s
does not change if
1. 2 Introducing Numerical Inequalities Definition. We say that the number a is greater (resp. less) than the number b (written a > b, resp. a < b) if and only if a - b is positive ( resp.
1 Definitions and Properties
91
negative) :
a>b a
-F=> -F=>
(a - b) E :JR+ , ( a b) E lR- .
(1)
-
Since the numbers (a - b) and (b - a) are mutually "opposite," it follows from l . l . (iii) that a > b is the same as b < a. From the decomposition 1R = JR+ U U lR- we immediately obtain the trichotomy law: For an arbitrary pair of numbers a, b E lR, one and only one of the relations a > b, a = b, a < b is true. In the case that a > b (resp. a < b) does not hold, we write a < b ( resp. a > b). Inequalities with < and > ( resp. < and > ) are called strict (resp. weak). Thus, the weak inequality a > b means that
{0}
(a - b) E JRt.
H we represent the real numbers in the usual way by points on the num
ber line oriented from left to right, then the inequality a > b acquires geometrical meaning: the image of the number a lies to the right of the image of the number b. Thus, for example, we have -1 > -2, even though one sometimes inaccurately says "-2 is a larger negative number than -1." It is better to avoid this last expression. Finally, we note that according to (1) with b = a number is positive ( resp. negative) if and only if it is greater ( resp. less) than zero. Thus the notations x E JR+ , y E JR.t , and z E R- for real x , y, z also stand for :i; > 0, y > and z < Now we use definition (1) and the rules l . l . (i) - (vi) to derive all the basic properties of inequalities between numbers.
0
0,
0.
1. 3 Transitivity Theorem If a > b and b > c, then a > c. More generally: If a 1 > a2 , a2 > a3 , . . . ' an - 1 > an , then a 1 > an , where a1 = an if and only if a1 = a2 = . . . = an . PROOF. If a > b and b > c, that is, (a - b) E :JR+ and (b - c) E :JR+ , then by l . l . (i) we have (a - b) + (b - c) E :JR+ , that is, a > c. The more general statement follows from l . l . (vi) and the equality a 1 - an = (a 1 - a2 ) + (a 2 0 aa) + · · · + (an - 1 - an ) · We remark that we can write the pair of inequalities a > b, b > c more concisely as a > b > c; similarly, we often write the system of inequalities a1 > a2 , a2 > aa , . . . , an- 1 > an as the chain a1 > a2 > · · · > an . However, the notation x < y > z is not customary. ..
1. 4 Adding a Number Theorem. If a > b, then a + c > b + c for each c.
92
2. Algebraic Inequalities
PROOF.
b+�
If a
> b, then (a + c) - (b + c) = (a - b)
E :JR+ , that
is, a + c > 0
We note that upon replacing the number c by -c we obtain the rule of �'subtracting a number" : If a > b, then a - c > b - c for any c.
1. 5 Adding Inequalities Theorem. If a > b and c > d, then a + c > b + d. More generally: If a 1 > b�, a2 > � ' . . , an > bn , then .
(2)
where we have equality in (2} if and only if a 1 = b�, a2 = b2 , . . . , an = bn .
a > b and :> d, then by 1 .4 we have a + c > b + c and b + c > b + d, which by 1 . 3 gives a + c > b + d. The more general assertion PROOF.
If
c
follows from l . l . (vi) and the equation
(a 1 + a2 + . . · + an ) - (b1 + b2 + . . · + bn ) = (a 1 - b1 ) + (a2 - b2 ) + · · · + (an - bn ) ·
0
1. 6 Multiplying by a Number Theorem. If a > b, then ac > be for any c > 0, and ac < be for any c < 0. If a > b, then (a - b) E :JR+ . By l . l . ( ii) we have (a - b)c E JR+ whenever c E :JR+ , and by l.l. ( iv ) we have (a - b)c E lR- whenever c E lR- . Since (a - b) c = ac - be, in the first case we get ac > be, while in the second 0 case it is ac < be. PROOF .
We note that upon replacing the number c by 1 / c we obtain, in view of l . l . ( v ) , the rule of "dividing by a number" : If a > b, then afc > b/c for c > 0, and afc < b/c for c < 0.
1. 7 Subtracting Inequalities Theorem. If a > b and c > d, then a d > b - c. More generally: If a > b and c > d, then a - d > b - c, where equality a - d = b - c occurs if and only if a = b and c = d. -
By 1 .6 the inequality c > d holds if and only if -c < -d. Hence 0 1 .7 follows from 1.5 for the pair of inequalities a > b and -d > -c.
PROOF.
1 Definitions and Properties
93
1. 8 Multiplying Inequalities Theorem. If a > b > 0 and c > d > 0, then ac > bd. More generally: If a1 > b1 > 0, a2 > b2 > 0, o o o , an > bn > 0, then (3) with equality if and only if a 1 = b1 , a2 = b2 ,
.
o
o
, an
=
bn .
From a 1 > b 1 > 0 and a2 > b2 > 0 it follows by 1.6 that a 1 a2 > b 1 a2 and b1 a2 > b1b2 . Hence 1.3 implies a 1 a2 > b 1 b2 o Since b1 b2 > 0 by 1.1o(ii), we can repeat this argument for the case n > 30 Thus we obtaln. a1 a2 a3 > b1 b2 b3, etc. , and finally (3), where the last step is the chain of inequalities PROOF
o
(4) H equality occurs in
(3),
then by
(4)(sincewea have a1 a2 · 0 0 an - 1 an a o a f. 0) and by
a1 a2 · · · an - 1 bn . This implies an = bn 1 2 · n- 1 a1 a2 · · · an- 1 = b1 b2 0 bn - 1 · Repeating this argument, an - 1 = bn- b etc . , and finally a 1 = b 1 o
(4),
•
°
•
we obtain
0
1. 9 Dividing Inequalities Theorem. If a > b > 0 and c > d > 0, then � > �0 More generally: If a > b > 0 and c > d > 0, then � > �' where equality occurs if and only if a = b and c = d. In particular, for a = b = 1 we get that if c > d > 0, then 1 > -c1 · "d Since cd > 0, by Hence 1.9 follows from 1.8. PROOF.
1.6 we have a/d > b/c if and only if ac > bd. 0
1 . 10 Exponentiating Theorem. If a > b > 0, then am > bm and y'a > v'b for each integer m > 2 . More generally: If a > b > 0, then ar > br for each r > 0, and a7- < br for each r < 0. a > b > 0. Using 1.8 with m identical inequalities a > b, we obtain am > bm . Let us assume that y'a < v'b; then by the above, ( y'a) m < ( V'b) m , that is, a < b, which is a contradiction. If r > 0 and r E Q (the case r E :JR+ \ Q will be discussed in Section 9), then r = m/n ( m , n E N), and by the above we obtain am > bm; hence '\/(iiii > \fbiii, that is, ar > br . If finally r < 0, then by the above we have a-r > b- r (since 0 -r > 0) , which by 1.9 means that 1/a- r < 1/b-r , that is, ar < br . PROOF.
Let
94
2. Algebraic Inequalities
1 . 1 1 Exponentiating Inequalities Theorem. If a > b and 0 < c < 1 < d, then ca < cb and da > db · PROOF. Let 0 < c < 1 < d and r = a - b > 0. Then by 1.10 we have cT < 1 T < dT , that is, ca -b < 1 and da- b > 1. If we multiply the last two D inequalities by cb , resp. db , then by 1.6 we obtain ca < cb and da > db . To conclude this section, the properties we have thus far obtained summarized in the following table.
are
a > b A b > c =====* a > c a > b ===* a + c > b + c l\ a - c > b - c a > b A c > d =====* a + c > b + d a > b A c > 0 ==> ac > be A -ac > -bc a > b A c < 0 ==> ac < be A -ac < -b c a > b A c > d =====* a - d > b - c a > b > 0 1\ c > d > 0 =====* ac > bd A da > �b a > b > O ===* -a1 < -b1 a > b > 0 1\ r > 0 ==> aT > bT a > b > 0 1\ r < 0 ==> aT < bT a > b 1\ 0 < c < 1 ==> ca < cb a > b A d > 1 ==> da > db 2
Basic Methods
We will now show how the basic rules obtained in Section solve some easy problems involving inequalities.
1 can be used to
2. 1 Equivalent Transformations We begin by considering five problems that will be solved as follows: The inequality that is to be proved will be transformed in a succession of steps until we reach an inequality that is obviously true. In doing so it is im portant to make sure that each step is equivalent, that is, the validity or failure of the inequality is not changed by the operation. According to Sec tion 1, such operations include, for example, adding the same expression to both sides of the inequality, multiplying the inequality by a positive ex pression, or raising an inequality between positive terms to the rth power
2 Basic Methods
95
( r > 0) . Also, we must not forget algebraic transformations of both sides
of an inequality. As a '�emplate" for a proof we often choose the opposite direction: We transform the final, "obvious," inequality in a succession of steps until we arrive at the original inequality that was to be proved.
(i) Let us show that -ersT < W. Since both numbers are positive, by 1.10 it suffices to show that ( .W) 72 < ( W) 72 , that is, (8!) 9 < (9!) 8 . Since 9! = 9·8!, we can transform this inequality to (8 ! ) 9 < 98 · (8 ! ) 8 . Upon division by (8!)8 (using 1.6) we obtain 8! < 98 . This last inequality holds by 1.8, since it is the product of the eight inequalities 1 < 9, 2 < 9, . . . , 8 < 9. (ii) Let us decide which one of the three numbers x
= (a + b) (c + d), y = (a + c) (b + d) ,
is largest, under the assumption that difference y - x: y
z
= (a + d) (b + c)
a < b < c < d. We evaluate the
- x = (ab + cb + ad + cd) - (ac + be + ad + bd) = d( c - b) - a( c - b) = ( d - a) ( c - b) > 0,
since both numbers ( d - a) and ( c- b) are positive. Hence y > x. Similarly, we convince ourselves that z > y . Therefore, z is the largest of the numbers.
(iii) We now show that for each a > 1 we have the inequality 1 Va < v'a + 1 - v'a - 1 .
(5)
Since a + 1 > a - 1 > 0, by 1 .10 we have v'a + 1 > v'a - 1 . Both sides of are therefore positive; hence by 1.10 we can compare their squares:
(5)
After multiplying out and simplifying we get
2a - ! > 2 Va2 - 1 . a Both sides are again positive (2a > 2 > 1 > 1/a); by squaring we obtain 1 4a2 - 4 + 2 > 4( a2 - 1) , a and after subtracting the expression 4(a2 - 1) we get the correct inequality 1/a2 > 0. (iv) Let the numbers a, b, r, s E JR+ satisfy a > b and r > s . We will prove
the inequality
2. Algebraic Inequalities
96
Multiplying out both sides and subtracting (as+ r - bs+ r ), we obtain arbs as br > as br - arbs , that is, 2arbs > 2as br , and after dividing by 2as bs we finally get ar- s > br - s . But this holds by 1.10, since a > b and r - s > 0.
(v) We will show that for arbitrary a, b, r, s E :JR+ we have if a
1= b.
The difference of the left and the right sides is
L - R = ar (as - bs ) - br (a5 - bs )
=
(ar - br )(as - bs ) .
= a7 - br and What can we say about the signs of the two numbers B = as - bs ? By 1.10 we know that if a > b (resp. a < b), then both A and B are positive (resp. negative) . Therefore, in the case a 1= b we always have L - R > 0, that is, L > R. We remark that similar "discussions" of the values of parameters are often used in proofs of inequalities (see also 2.3. (iv) below) .
A
2. 2 (i) (ii) (iii)
Exercises Generalize the result of 2 1 . (i) Which of the numbers 2700 and Which number is larger: .
101997 + 1 101998 + 1
.
5300 is larger? or
101 998 + 1 10 1999 + 1
?
Prove the inequalities (iv) - (viii) : b - a2 (iv) Vb > a +
(v) (vi) (vii) (viii)
(O < a < Vb < a + 1). 2a + 1 1 2(v'a + 1 - Va) > (a > 0). Va c+a > c+b ( 0 < b < a, v'ab < c) . v'c2 + a2 v'c2 + b2 (a, b E :JR+ ). o/OJ + 1W > ifci{lb + {t'a� (n! ) 2 < k!(2n - k)! (n, k E N, n > k ). ::: ::= ::::;: : ---;:::::
2.3 Irreversible Transformations We will now deal with problems in which the course of solution from an original "obvious" inequality to the desired inequality cannot be reversed. Thus, for example, the inequality L > R can be proved by finding decom positions L = L 1 + L2 + · · · + Ln and R = R1 + R2 + · · · + Rn such that
2 Basic Methods
L k > Rk for each k = 1, 2,
. . . , n.
97
( This may be a tough nut to crack even
in the case n = 2). A similar approach is provided by the multiplication law 1.8. Let us now consider the following eight problems.
(i} Prove the inequality
a+b < a + b 1+a+b 1+a 1+b
(a, b E &.+ ).
SOLUTION.
The fraction on the left has the largest denominator. We can therefore write
L = 1 +a +a +b b = 1 + aa + b + 1 + ab + b < 1 +a a + 1 +b b = R.
0
(ii} Let c be the hypotenuse of a right triangle, and a, b the other two sides. Show that for every integer k > 2 we have ak + bk < ck . By the Pythagorean theorem we have t? = a2 + b2 • Multiply ing by ck - 2 , we obtain ck = a2 ck - 2 + b2 ck - 2 . Since a < c and k > 2, by 1.10 we have ak - 2 < ck- 2 ; hence ak = a2 ak- 2 < a2 ck- 2 . Similarly, we get bk < �ck- 2 , and by adding these two inequalities, SOLUTION .
0
a > b > 0 and E N. Determine which of the numbers 1 + a + a2 + · · ----� 1 + b + b2 + · · ----� · + bn · + an and B = ------�---A = ------�---1 + b + b2 + . . . + bn - 1 1 + a + a2 + · · + an- 1
(iii) Let
n
·
is larger. SOLUTION .
We rewrite both numbers according to the identity
n 2 1 +x+x + ··· +x -
"" x ----::---:::---1 + 1 + x + x2 + ----n 1 + x ··· 1 =1+ 1 + 1 + ••+ 1 " · z
1 + x + x· · + x :- = ------: :- +------: 2 n 1 ·
:z:n
From a we get
:z:n - 1
> b > 0 it follows by 1.10 that a- k < b-k (1 < k < )
n .
1 1 1 < -1 + -1 + · · · + 1, + · · · + -a + bn an b b2 a2 which leads to the conclusion that A > B. (iv) Show that
By adding
0
x6 + 2 > x4 + 2x for all x E :JR.
The given inequality is an equality for x = 1; hence the poly nomial L- R is a multiple of (x - 1) ( see Chapter 1, Section 3) . By dividing SOLUTION .
98
2. Algebraic Inequalities
find that (x6 + 2) - (x4 + 2x) = (x - 1)Q(x), where Q(x) = x 5 + x4 - 2. Therefore, it remains to show that Q(x) > 0 for x > 1 and Q(x) < 0 for x < 1. Since Q(1) = 0, one could repeat the division of the polynomial by (x - 1); however, in view of the form of Q ( x), the following discussion suggests itself: we
x > 1 ===> x5 > 1 A x4 > 1 ==> Q(x) > 1 + 1 - 2 = 0, -1 < x < 1 ==> x5 < 1 A x4 < 1 ==> Q(x) < 1 + 1 - 2 = 0, x < - 1 ==> x4 > 0 A 1 + x < 0 ==> Q(x) = x4 (1 + x) - 2 < -2. 0
This completes the proof.
We remark that the search for linear factors of a polynomial is a basic method for solving problems involving polynomial inequalities. We will use this approach also for solving the following problem.
(v) Let a, b, c E :JR+ be such that c > a + b. Show that
a3 + b3 + c3 + 3abc > 2(a + b) 2 c. SOLUTION . With the notation F(c) = L-R = c3 +3abc-2(a+b) 2 c+a3 +b3 we will show that F(x) > 0 for all x > a + b. Since F(a + b) = (a + b) 3 + 3ab(a + b) - 2(a + b) 3 + a3 + b3 0, =
F(x) is divisible by (x - a - b); by dividing we obtain F(x) = (x - a - b) (x2 + (a + b)x - a2 + ab - b2] .
the polynomial
Hence it suffices to show that the term in square brackets is positive for x > a + b. But this is easy: For such x and positive a, b we have
x2 + (a + b)x - a2 + ab - b2 > (a + b) 2 + (a + b) 2 - a2 + ab - b2 = a2 + 5ab + b2 > 0.
0
(vi) Show that for each n E N and each a E :JR+ , a 1= 1, we have the
inequality
(6) SOLUTION .
Since both sides of (6) are sums of 2n numbers (on the left we have n-times the number a2n+ l and n-times the number 1), we first check whether (6) is a sum of 2n valid inequalities. For a > 1 we have the chain a2n+ l > a2n > a2n - l > · · · > a2 > a > 1 (for positive a < 1 the chain goes in the opposite direction) ; this, however, does not imply ( 6) . Therefore, we try another possibility, namely the sum of n inequalities a2n+ l + 1 > Rk (1 < k < n) , where R1 , R2 , . . . , Rn are appropriate sums
2 Bas�c Methods
99
of two terms each from the right-hand side R of the inequality (6), with R R1 + R2 + · · · + Rn,. Obviously, it is best to combine �'symmetric" terms: the smallest with the largest, etc. , that is, to set Rk = ak + a2n+ 1 - k for k = 1, 2 , . . , n. This attempt is successful, since =
.
a2n+ I + 1 Rk _
=
=
a2n+ 1 + 1 (ak + a2n+ I - k ) (a2n- k+ 1 - 1)( ak - 1) 0. _
>
0
(vii) Show that if 0 < a < 1, then (1 + a) 1 - a . (1 - a) 1+a < 1.
b (1 - a)/(1 + a), then (1 + a) 1 -a · (1 - a) 1+a (1 + a)(1 - a)ba = (1 - a2 )ba < ba , since 0 < 1 - a2 < 1 if 0 < a < 1 . Next, since 0 < b < 1 , 1.11 implies 0 ba < 1. SOLUTION.
If we set
=
=
(viii} Show that for arbitrary numbers a, b, c E :JR+ we have
>
(aa . bb . cc ) 2 ab+c . bc+a . ca+b . SOLUTION. First we note that for any a, b E :JR+ we have a" · bb ab · ba . Indeed, this inequality can be written in the equivalent form aa -b ba -b ; now it suffices to distinguish between the cases a b, a b, a < b and to use rule 1.10. By multiplying the three valid inequalities
>
=
0
we then obtain the desired inequality.
2.4
>>
l?xercises
Prove the inequalities (i)-(iii):
(i) (1•1.)
(1•1•1.)
(iv)
>
3 1 1 + 1 (a, b, c E :JR+ ). + a+b b+c c+a a+b+c X 1 + X2 + • · · + X6 < X 1 + X2 + · · · + X 10 (x 1 < · · · < x 10 ). 10 6 (1 + a)(1 + b) < 1 + a + b ( a, b E 11]) + ) 2 2+a+b Show that if the numbers a, b, c are the side lengths of some trian gle, then the same is true for the triples ..ja, v'b, ...jC and (a + b) - 1 , (b + c) - 1 , (c + a) - 1 . �
Prove the inequalities (v )-( ix) :
(v) x8 - x5 + x2 - x + 1
>0
(x E lR) .
·
100
2. Algebraic Inequalities
2 n +, n > 2) . (vi) a 1++a2a++aa3 + · · · ++ an- 1 >- n + 1 :JR (a + ·· a n-1 (k, *(vii) + + �) · · · + 4k2I ) > J <m-:n�k)! * (viii) a3 + b3 + c:3 + 3abc > ab( a + b) + be( b + c) + ac(a + c) (a, b, c :JR+ ). (ix} (1 + na)n+ 1 > [1 + (n + 1)a] n (a :JR+ , n
E
·
(m �) (m
(m
E
(Hint: Use the identity
E N, m E N). E E N). n
1 + na 1 + 2a 1 + a + 1 )a ----:1 + (n + 1 ) a = 1 +1 (+ na · 1 ' 1 + ( n - 1 )a 1 + a and change the product of the n + 1 terms on the right to a power n
of the smallest one of these terms. ) (x) Which one of the numbers 31 11 and
171 4 is larger? 1 *(xi) Which one of the numbers 2 31 00 and 32 50 is larger? (xii) Using a similar trick as in example 2.3.(iii) , show that the equation
(xiii}
with nonnegative coefficients aj cannot have two distinct positive roots. Use the method of Example 2.3.(v) to show that if a, b, c :JR+ and c < a + b, then
E
a3 + b3 + c3 + 3abc > 2(a + b)�. * (xiv) Let a, b, c, d :JR+ . Show that of the three inequalities
E
a + b < c + d, (a + b)(c + d) < ab + cd, (a + b) cd < ab(c + d), at least one is false.
A, B, C, a, b, c :JR+ an<:! s > a + b + c. Show that the numbers A+B+a+b B +C+b+ c A+C+a+c A+B+s ' B+C+s ' A+C+s are the side lengths of some triangle. (Hint: Use the fact that if 0 < x < y, then xjy < (x + p)/(y + p) for any p > 0.) * (xvi} For fixed positive numbers a 1 , a2 , . . . , an set A(r) = a� + a2 + · · · + a� ( r lR). *(xv)
Let
E
E
Show that if r < s < t < u and r + u = s + t, then A(r)A(u) A(s) A (t), with the exceptional case a1 = a2 = · · · = an .
>
101
2 Basic Methods
2. 5
The Estimation Method
In mathematics it is often required to estimate the value of some "com plicated" expression Q. This can be done, for example, by replacing it with a simpler expression (with an error as small as possible). The num bers or, more generally, the expressions L and U satisfying the inequality L < Q < U are called the lower and upper bound of the expression Q; the lower bound L1 is called sharper than the bound L if L < L1 < Q. Similarly, we define a sharper upper bound. The following seven examples will illustrate some simple approaches to obtaining bounds (especially of finite sums) .
(i)
Let us find bounds for the expression
d a b c + :JR+ ) . b, c, d E (a, + + d a + b + d a + b + c b + c+ d a + c+ It is clear that 0 < R < 4; by numerical experimentation we are unable to find concrete values a, b, c, d such that R < 1 or R > 2 . In fact, such values do not exist, for we derive the bounds R > 1 and R < 2: a b c d 1, R> + + + a + b + c + d a +b + c + d a + b + c + d a + b + c+ d a + b + c + d R< a + b a + b c + d c + d 2. R
=
---
=
=
By approprate choices of numbers sharper bounds (see [ 7], p. 165).
a, b, c, d one can show that there are no
(ii) The easiest approach to obtaining bounds for the sum a 1 + a2 + · · + an is as follows: We find the smallest and the largest among the values ab a2 , . . . , an ; these, multiplied by n, are then bounds for the given sum. ·
Thus, for the sum
S(n)
=
1 + ··+1 1 +1+·
v'2 v'3
we obtain S(n) > n · (1/fo) for S(n) will be obtained in 2
= .
Vn and S(n) < n · 1
5 ( iv) and 2.6 (iv) .
(n > 1)
Vn
.
=
below.
n.
Sharper bounds
(iii) The method of the previous example can sometimes be improved by first subdividing the terms ai of the sum a1 + a2 + · · · + an into smaller
groups (for instance pairs) ; then we find bounds for the sums of these · groupings, and finally we add these bounds. We use this method to prove the inequality
1 + 1 1 1 <3 · + + · + · 2n 4 · n_ _ +_1 n + 2 n + 3
102
For
2. Algebraic Inequalities
n > 1 we pair the summands as follows:
(n � l +
2n
� l ) + ( n � 2 + 2n � 2 ) + ( n � 3 + 2n � 3 ) + · · · ·
To avoid having to distinguish between even and odd original inequality by two and write it in the form
n- l
n, we multiply the
)
1 3 1 1 L n + k + 2n - k < -2 - -n · k=l
(
(7)
1 < k < n - 1 we have 1 1 3n 3n - 3 < + 2n · n + k 2n - k 2n2 + k( n - k ) 2n2 + 0 Hence the sum on the left-hand side of (7) is less than _!_ 3n - 3 3n - 2 .!_ (n 1) 2n = 2n < 2n = 32 n . For
--
_
_
(iv) If we sum the inequalities 1 < Jk + 1 - Jk - 1 Jk
obtain a new upper bound for the sum S(n ) in 2.5. (ii) that is considerably sharper: S(n) < Jn + 1 + .Jii - J2. It follows from 2.6. ( iv ) below that the error of this estimate for n = 10 6 is less than 1.
(see 2.1.(iii)) ,
we
(v) We show that for arbitrary n, k E N we have 1 .!_ 1 1 ...+ 1 < (8) + + (n + 1)! (n + 2)! (n + k)! - n n! (n + k ) ! Indeed, if 1 < j < k, then 1 n < n+j - 1 = 1 . (n + j) ! - (n + j)! (n + j - 1)! (n + j)! Adding these estimates and dividing by n, we obtain (8) . (vi) A number of estimates for finite sums can be derived from results of Chapter 1 , Section 2. Thus, for example, we obtain the bound 1 +1 +1 + +1 < -7 - -1 T(n) = · · (n > 2) · 1 2 2 2 32 n2 4 n as follows: We keep the first two terms in T( n) without change and estimate the remaining summands using the inequality 1/ k 2 < 1/ ( k 2 -k) , 3 < k < n; finally, we apply the result of Exercise 2.40. ( i ) in Chapter 1 for k = 2.
[..!..
].
2 Basic Methods
103
(vii) Finally we mention an example of an estimate for a finite product. For the expression Q(n)
=
1 3 5 · ·6 2 4
2n - 1
(n > 2)
· · · -2n-
we will prove the bounds 1 -2y'n n Since ! < we have Q (n)
1
(9)
< Q ( n) < -v�2n= :::;: +1
i and more generally (2k - 1) /2k < 2k/(2k + 1) for each k > 1 , =
1 3 5 · ·6 2 4
···
2n - 1 2n
2 4
2n
< 3 · 5 · · · 2n + 1
1 (2n + 1)Q (n) "
-
This implies (2n+ 1) [Q( n)] 2 < 1 , which gives the right-hand side of (9). If we use the inequalities ! > i and more generally (2k- 1)/2k > (2k-2)/ (2k-1) for each k > 2, we get 2Q(n)
=
3 5 ·6 4
···
2n - 1 2 4 > · 2n 3 5
2n - 2
· · · 2n - 1
=
1 2nQ(n) ;
hence 4n[Q (n)]2 > 1 , which is the left-hand part of (9) .
2. 6 Exercises Prove the inequalities (i)-(iii) for integers n > 2:
(i) (n - 1 ) v'2 < v'2 + J3 + (ii) (n!)2 > nn.
2 n n 1 (iii) > E E k k=2 k k=n+l 1
and
· · + y'1i < (n - 1)y'n. ·
n2 - l 1 n - 1 1 . <Ek E k k=n k=l
(iv) Using the result of 2.2. (v) , find a lower bound for the sum S(n) in Example 2.5.(ii) . Then determine the integer N for which the estimate N < 8(106) < N + 1 holds. (v) With the help of the estimate in 2.5. (vi) prove, for each integer n > 2, the inequality 1 1 1 3 1 1 · · + < + + · + n(2n + 1) 8 2n . 2·5 3·7 4 9 ·
(vi) Using the result of Exercise 2.40. (v) in Chapter 1 , prove the following estimate for each integer n > 2: 1 1 1 1 1 + + · · · + < --23 33 n3 4 2(n2 + n) ·
104
2. Algebraic Inequalities
in Chapter 1, prove the 2.40.(vi) n > 2: 1 + 1 1 + · · · + 1 < 1 - 4n2- 1 1 n(2n - 1) 2 2(4n - )" 2.3 3·5 4·7 (viii) Show that for each integer n > 1 we have the bounds + 1) < 2n(n+1). 5·7 + · · · + (2n - 1)(2n n(2n+1) < -1-· 3 + -23 -5 + g n (ix) For each integer n > 1, prove the inequality 3 · 7 · 11 · · · 4n - 1 < n4n + 1 V � 5 9 13 (x) Let p E N. Show that for the expression Q(n) from 2 . 5 . (vii) we have Q(p) v[Pn < Q(n) < Q(p) J2n2p++ 11 for each n > p.
(vii)
Using the result of Exercise following estimate for each integer +
1
·
2. 7 Symmetry and Homogeneity
We will now mention two important properties of inequalities, which will be used in the following sections. The first two of the inequalities
a + b + c > abc, -ab + -bc + -ac > 1, a + 2b + c > bac are ( as opposed to the third one ) symmetric in the variables a, b, c, that is, they do not change if the order of the triple a, b, c is changed. (Note that the third inequality is symmetric in the variables a, c. ) Symmetries in the variables x 1 , x2 , . . . , Xn are sometimes used as follows: We may assume that the variables x�, x2 , , are appropriately ordered, for instance x 1 > X n an assumption can considerably shorten the arguments xin2 the> · course · · > Xnof. Such a proof. We illustrate this by the example of the inequality (10) which, as we will holds for arbitrary b, c E JR.+ . If a > b > c, then a + b + c < a + a + a 3a, and thus (a + b + c) lOO < (3a) 100 < 31 00 (alOO + blOO + ClOO ) . This completes the proof. It may be interesting to note that, excepting the case a b c, a variant of (10), still with a strict inequality, holds even when the number 3 1 00 on the right is replaced by 399 ( see 7.8. (v ) below) . .
see ,
=
=
=
.
•
a,
2 Basic Methods
105
homogeneous inequality by way of the example as + bs + cs > �a + �b + � a3 b3c3 . c We find out how both sides of this inequality change if we replace a, b, c by ta, tb, tc for an arbitrary t E JR.+ : L' = (ta) 8 + (tb) 8 + ( tc) 8 = t8 L, 3 (tb) 3 (tc) 3 = t8 R. (ta) +t + R! = t t We explain the term
(
)
( � � �)
This leads to an equivalent transformation: Both sides change by a factor of t8 , thus L > R holds if and only if L' > R'. In general, the inequality Q(x�, x2 , . . . , Xn ) > 0 is called homogeneous (in the variables x�, x2 , . . . , Xn ) if it is equivalent to Q(tx 1 , tx2 , . . . , txn ) > 0 for each t E JR.+ , especially if
Q(tx� , tx2 , . . . , txn ) = t r Q(x� , x2 , . . . , Xn ) for some r E :JR. ( The inequality L > R can be written as Q = L R > 0.) Through the choice of the number t E :JR+ we can appropriately •'normalize" the variables x�, x 2 , . . . , Xn in a homogeneous inequality such that, for example, we get Xn = 1 ( and thus reduce the number of unknowns by 1 ) , or x 1 +x 2 + · · + xn = 1 , etc. As an illustration we prove the following assertion: H 0 < r < s, then for arbitrary numbers a, b E :JR+ we have (as + bs ) lf s < (ar + br ) llr . ( 11 ) This inequality is homogeneous in the variables a, b; through an appropriate choice of t E :JR+ (the reader should determine this value) we may assume that a1· + br = 1 . Then ar < 1 , which by 1 . 1 1 gives a5 = (ar) s fr < ar , since sfr > 1. Similarly, we have b8 < br, and thus a:s + b8 < ar + br = 1, that is, (a8 + b8 ) 1 1 s < 1 , which is ( 1 1 ) under the assumption that a.,. + br = 1.
-
·
This completes the proof. A similar homogenization approach leads to the so-called
( n a ) 1/s ( n a ) 1/r
inequality
L � k= l
<
E=l
k
k
Jensen
(O < r < s)
for positiv� numbers a 1 , a2 , . . . , an (n > 2). From this we derive the fol lowing interesting property: If n > 2 and p, a 1 , a2 , . . . , an E 1R+, p =/:. 1 , then
(a 1 + a2 +
· · ·
+ an ) P > af + a� + · · · + a� , if p > 1,
(12)
respectively
( a 1 + a2 + · · · + an ) P < ai + a� + · · · + a�, if 0 < p < 1.
( 13)
In closing we remark that symmetric and homogeneous inequalities will be very prominent throughout this chapter.
106
2. Algebraic Inequalities
2. 8 Exercises
a, b, c E :JR+ prove the symmetric inequalities (i) a( a - b)(a - c) + b(b - c) (b - a) + c(c - a)(c - b) > 0, (ii) (a - b) 2 (a + b - c) + (a - c) 2 (a + c - b) + (b - c) 2 (b + c - a) > 0. Show that the inequality (ii) can be transformed into a4 + b4 + c4 + abc( a + b + c) > 2(a2 b2 + a2 c2 + b2 c2 ) by multiplication by a + b + c and further equivalent transformations.
For arbitrary numbers
(iii)
It is very difficult to prove this last interesting inequality "directly'/ (that is, without recognizing the above connection ) ; the authors know of no other approach than the use of (ii) . Prove the homogeneous inequality
a + b - vr; (a - b) 2 (a + 3b)(b + 3a) > b ao - B(a + b)(a2 + 6ab + b2 ) 2
--
�-��-�-___,.-:"--
which provides a nonnegative lower bound for the difference between the arithmetic and the geometric means of the positive numbers a and b. (Hint: Setting b = 1 and a = t 2 , where t > 0, you get a polynomial inequality that can be proved by way of factorization. )
3
The Use of Algebraic Formulas
We now add formulas for An - Bn and (A + B ) n , which we derived in Chapter 1, to our collection of tools for proving inequalities. For the entire section we assume that n, k E N.
3. 1
The Decomposition of An - Bn
In the following three examples we illustrate the use of the formula
An - Bn = ( A - B)(An- 1 + A - 2 B + An- a B2 + . . . + ABn- 2 + Bn- 1 ) n
(14)
for algebraic transformations of expressions that occur in the given inequalities.
(i)
Show that
SOLUTION.
if a, b E JR+ , a 1= b, then an+ 1 + nbn+ 1 > (n + 1 )abn .
By
(14) we get
a( an - bn ) - nbn (a - b) = a(a - b)(an- l + an- 2 b + + abn-2 + bn- 1 ) - nbn (a - b) = (a - b)(an + an- 1 b + + a2 bn- 2 + abn- 1 - nbn )
L-R=
·
·
·
·
·
·
.
3 The Use of Algebraic Formulas
Upon adding a k bn - k > bn ( if a > b), resp. a k bn- k < bn ( if a < k = 1, 2, . . . , n we obtain in both cases L - R > 0, that is, L > R.
107
b),
for
0
(ii) Suppose the numbers a, b, c E :JR+ have the following property: For each n > 1 there exists a triangle Tn with sides an , bn , and en . Show that all triangles Tn are equilateral. SOLUTION. Let a > b > c > 0. The triangle inequality for Tn means that c"' > an - bn , that is, The last term in parentheses is at least ncn - 1 , since a > c and b > c implies an - 1 - k bk > cn - 1 - k ck = cn - 1 , 0 < k < n - 1 . We thus obtain c1" > (a - b)ncn- 1 , that is, c > (a - b)n. Since this last inequality holds for all n > 1 and furthermore we have a > b, it follows that a = b. ( In the case 0 a > b we would obtain a contradiction when n > a�b . )
(iii) Show that if a > b > 0, then n+ 1 - bn+ 1 n + 1 n+1 a n a > an - bn > n b. SOLUTION. By the identity (14) we have
(15)
an+ 1 - bn+ 1 an _ bn
(a - b) (an + an- 1 b + . . . + abn- 1 + bn ) (a _ b)(an- 1 + an- 2 b + . . . + abn-2 + bn- 1 ) an + an - 1 b + . . . + abn- 1 + bn - an - 1 + an- 2 b + . . . + abn - 2 + bn- 1 · We note that if we multiply the denominator D of the last term by the number a (resp. b), we get the first ( resp. last ) n terms of its numerator.
'rhus,
where
D = an- 1 + an-2 b + . . . + abn - 2 + bn- 1 . Since the "outer" expressions in (15) are a+aln, resp. b+bln, it suffices to �how that aln > bn I D and bin < an I D, that is, aD > nbn and bD < nan . But this is easy: a > b implies and similarly we obtain
bD < nan .
0
108
2. Algebraic Inequalities
3. 2 Exercises Prove the assertions (i) -(iv) :
1 - an 1 - an+ l (i) 0 < a < 1 A n > 1 => n > --n+1 (ii) a > b > 0 A c > 0 A n > 2 ==? y'an + c - ytbn + c < a - b. 3 1 2 (1.1·1·) a > 1 ==? 1 - 1 > 2 - 2 > a - 3 > · · · · a -a a -a a -a *(iv) a > v'2 A b > v'2 => a4 - a3 b + a2 b2 - ab3 + b4 > a2 + b2 . (v) Suppose that a, b E JR+ satisfy a3 + b3 = a - b. Show that a2 + b2 < 1. * (vi) Show that for arbitrary a, b, c E JR+ , 3 3 3 a + b+ c . c b a > + + �---3 a2 + ab + b2 b2 + be + c2 c2 + ca + a2 -
3. 3 Estimates for An - Bn The proofs of a number of inequalities rely on the estimates n(A - B)Bn- 1 < An - Bn < n(A - B) An -1 ,
(16) ( A > B > 0, n > 2) , which are easy to obtain from formula (14) : Just as in 3 . 1 . ( i) it is clear that nBn - 1 < An-1 + An-2 B + . . . + ABn- 2 + Bn-1 < nAn -1 . We give three examples. (i) Show that if 0 < a < 1, then n + (1 + a) n < na + 2n for n > 2. SOLUTION. If 1 < 1 + a < 2, then by the left part of (16) with A = 2 and B = 1 + a we have 2n - (1 + a) n > n(1 - a) (1 + a) n- 1 > n(1 - a) · 1 n- 1 , 0 and after an easy simplification we get the statement.
(ii) Show that the sums Sk (n) (studied in Chapter 1 , Section 2) satisfy the
lower bound
1 . k+ 1 Sk (n) = 1 k + 2k + · · · + nk > n . k+1 SOLUTION. By the right part of (16) with A = j, B = j - 1, and n = k + 1 we have for each j > 1 the inequality j k+ 1 - (j-1) k+ 1 < (k+1)jk . Summing over j 1, 2, . . . , n we obtain nk+ 1 = (1 k+ 1 - ok + 1 ) + (2k + 1 - 1 k+ 1 ) + . . . + [nk + 1 - (n - 1) k+ 1 ] < (k + 1)(1 k + 2 k + · · · + n k ) , =
3 The Use of Algebraic Formulas
109
0
from which upon division by k + 1 we obtain the desired bound.
(iii) Prove the so-called Bernoulli inequality (1 + x) n > 1 + nx (x > -1, n > 2), with equality if and only if x = 0.
(17)
SOLUTION. H x > 0, then (17) follows from the left inequality of (16) with A = 1 + x and B 1. If -1 < x < 0, then (17) follows from the right part of (16) with A = 1 and B = 1 + x. In both cases the inequality (17) 0 is strict, and for x = 0 we get equality in (17). =
3.4 Exercises Show that the inequalities (i) -(iii) hold for n > 2:
(i) (ii) (iii) (iv)
2(a + 1 ) n + n2n > (na + 2)2n (a > 1 ) . n + ( 1 + a) n < na2 + 2n (0 < a < 1 ) . ( 1 - a) n + (2n - 1 ) an > nan - l (0 < a < 1 ) . The arithmetic means A 1 7 A2 , , AN of the real numbers ai are •
.
•
defined as follows:
( 1 < n < N) .
Show that if 0 < a 1 < a2 < · · · < aN, then for each n = 2, 3, . . . , N we have the inequality ( An ) n > an ( An- 1 ) n- 1 , unless a 1 = a2 = · · = an . (Hint: Use ( 16 ) with A = An and B = An- 1 ·) ·
Using ( 17) , show that for each k > 2 the numbers Ck = ( 1 + i) k satisfy (v) and (vi):
(v) Ck > 2. Ck+ 1 < 1 + 1 . * (vi) 1 < ---; ;:k2 + 2k
(Further properties of the numbers Ck will be derived in 3.8.(iv) .) (vii) Using (17), show that for a, b E JR+ and n > 2 we have
(1 8) (Hint: Set x = abr - 1 in ( 17) for an appropriate r.) When is (1 8) strict? Remark. The inequality (1 8 ) follows easily from the so-called AM GM inequality, which will be proved later, in Section 8. Indeed, we can apply the inequality (84) to the n-tuple an , b, b, . . . , b.
1 10
2. Algebraic Inequalities
(viii) Show that *(vi) follows from (18) with a = 1 and appropriate b, n. *(ix) Let the largest one of the nonnegative numbers d 1 , d2 , . . . , dk be equal to D. Show that for each n > 2 we have
where an = (n - 1) n1�n . 3. 5 Estimates Using Geometric Series From the formula (14) with A = 1 and B = q it follows that
1 + q + q2 + · · · + qm =
1 - q +1 1-q m
<
--
1 1 -q
(19)
for each positive q < 1 and each m = 1, 2, 3, . . . (the number 1 1 is the sum of the infinite geometric series 1 + q + q2 + · · ). The inequality ( 19) can be used to obtain an upper bound for the sum a 1 + a2 + · · + ak in the case that we can find numbers bi > ai such that bi + l < qbi for each j, where 0 < q < 1. Using this approach, we will prove the bound q
·
·
n+ 2 . 1 (20) n + 1 (n + 1 ) r Indeed, from the inequality (n + j)! > ( n + 2 ) ! ( n + 2)i 2 for j > 3 and from ( 19) with q = 1 / (n + 2) it follows that 1 1 1 +...+ + (n + 1)! ( n + 2) ! ( n + k) !
<
-
1 1 + (n + 1)! ( n + 2)! 1 -< ( n + 1)! 1 < ( n + 1)!
1 (n + k) ! 1 1 1 1+ + +..·+ ( n + 2) ( n + 2 ) 2 (n + 2) k- 1 1 n + 2 · -1 . n + 1 (n + 1 ) ! - ' 1 - n� 2 The reader should verify that (20) is sharper than the bound +..·+
[
1 1 1 +...+ + -:-::-( n + 1)! (n + 2)! ( n + k)!
1 n · n! '
< --
which is the result of Example 2.5 . (v) . 3. 6 Exercises Prove the inequalities (i)-(iii) , where a1 1 a2 ,
. . . , an E JR+ :
l
111
3 The Use of Algebraic Formulas
1 n2 + 6n + 9 1 1 1 · + + + · (n + 2)! (n + 4) ! · (n + 2k) ! < n2 + 6n + 8 (n + 2) ! " (ii) 3 ·1 1 ! + 12 · 3 + 1 · 3 · 5 + . . . + 1 · 3 · 5 · n· · (2n - 1) < 1 . 3 · n! 3 · 2! 33 · 3! _, +-- 2-=2-a.k2 -+---.-._+_2_n_a-;-: . * (iii) (a 1 + a2 + · · + an ) ( -¢12 - 1) < {j..-2a__f.-
(i)
·
·
·
·
3. 7 Using the Expansion of (A + B)n The binomial expansion
(A + B) n = An +
(�) An- 1 B + (;) An-2B2 + · · · + (n n l ) ABn- l + Bn (21)
can be used in the proofs of various inequalities that contain powers of integer degree n > 2. If we leave out several summands on the right-hand side of (21), we obtain a lower bound for the power (A + B ) n , for positive A, B. Thus, for instance, we get
E
(A, B JR+ , n > 2)
(22)
(compare with (12)). We give three examples. (i) Suppose that the numbers x, y, z IR satisfy xyz > 0 and x + y + z > 0. Show that the inequality xn + yn + zn > 0 holds for all n > 2 .
E
SOLUTION. Since xyz > 0, either all three numbers x, y, z are positive (then the assertion is obvious) , or one is positive and the remaining two are negative. For example, let x = a, y = -b and z = -e, where a, b, e R+. From x + y + z = a - b - e > 0 it follows that a > b + e, which by (22) implies an > (b + e) n > bn + en ; for odd n this can be written as xn + yn + zn = an - bn - en > 0. For even n the inequality xn + yn + zn > 0 D is obvious.
E
E
(ii) Show that (1 + na) n+ l > [1 + (n + 1)a] n for all a JR+ . SOLUTION. We use (21) to expand both sides of the inequality, and then we compare the coefficients of equal powers ak (0 < k < n) on both sides . It suffices to show that
holds for such k. (On the left side of the original inequality we have the additional positive term nn+ l an+ l .) It is easy to verify by substituting that this inequlity holds for k = 0, 1; for k > 1 it can be rewritten as
1 12
2 . Algebraic Inequalities
(n + 1) k - nk < k(n + 1) k - 1 . But this is true by the right side of (16), and
the proof is complete. Another possible approach is based on the direct use of the right part of (16) with A = 1 + (n + 1)a, B = 1 + na:
[1 + (n + 1)a] n - (1 + na) n < na[1 + (n + 1)a] n - 1 [1 + (n + 1)a] n - (1 + a)[1 + (n + 1)a] n - 1 , which implies (1 + na) n > (1 + a) [1 + (n + 1)a] n- 1 . If we multiply this last inequality by 1 + na, we get (1 + na) n+ 1 > [1 + (n + l)a + na2 ) [ 1 + ( n + 1)a] n- 1 > [1 + (n + 1)a] n . =
We note that the original inequality was derived earlier, in Exercise 2 . 4 .(ix), with a somewhat artificial trick. Also, it is worth mentioning two conse quences: With a = 1/(n2 + n) we obtain the left part of 3.4.(vi) , and with a = 1 we get 0 2 > .W > ifti > > V'n + 1 > ·
·
·
·
·
·
.
(iii) Show that for each n > 3 we have (2n + 1) n > (2n) n + (2n - 1) n . SOLUTION.
Using (21) , we expand the powers (2n + 1) n and (2n - 1)n :
(2n + 1) n - (2n - 1) n n (2n) n- k n ( -1) k (2n) n- k = k=O k k=O k 2 (2n) n- l + (2n) n-3 + (2n) n - 5 + . . .
t( ) t( ) (�) [ (�) > 2 (�) (2n) n - l = (2n) n .
=
(�)
]
0
3. 8 Exercises Prove the assertions (i)-(iii) :
(i) If the positive numbers a, b, c satisfy ah + bn = en for some n > 2, then a, b, c are the side lengths of some triangle. (ii) If 0 < a < 1 and n > 3, then (1 + a) n + 2an- 1 > 1 + an - 1 (2n + a). (iii} If 2n > a > 0, then (a - 1) n + an < (a + 1) n ; if (1 + J2)n < a, then the opposite inequality holds. (This covers the result of 3.7.(iii) . )
4 The Method of Squares
1 13
(iv ) Given the numbers ck = (1 + �) k , k >
2, derive the expression Ck 2 + _!_ (1 - .!) + _!_ ( 1 - .! ) ( 1 - k2 ) + . · · 2! k 3! k (23) 2 1 k + _!_ ( 1 - .! ) ( 1 - ) . . . ( 1 k ). k! k k Show that (23) again implies the inequality Ck+ l > Ck (see 3 . 4.(vi)) =
and prove the bound
Ck < + 1 + 1 + · · · + 1
k > 2. (24) The smallest constant with the property ck for all k E N is called the base of the natural logarithm. This irrational number with k! 3
2 2! 3!
<
for each
e
the approximate value e mathematical constants . 4
< e
�
2. 71828 is one of the most important
The Method of Squares
( E
The inequality x2 > 0 x lR, x # 0) stands out among all other inequal ities because of its simplicity and, at the same time, its wide applicability in many parts of mathematics. This inequality provides us with another method of proof of the inequality L > R: We try to find expressions Qt, Q2 , . . . , Q N such that
L - R = Q� + Q� + · · · + Q�, or
L - R = 81 Q� + S2 Q� + · · + SNQ�, where St , 82 , , SN are nonnegative expressions. In 4.1 we describe approaches for finding such expressions; they are mainly based on transforming "incomplete" squares X 2 + XY using the formula X 2 + XY = ( X + Y ) 2 - Y 2 , ·
•
.
•
2
2
which is called completing the square. Consequences of the basic inequality in 4.1 are of such importance that we devote the separate sections and 7 to them.
(25) 4. 5, 4.
4. 1 Examples We now give ten examples of the use of the method of squares.
4.3,
1 14
2. Algebraic Inequalities
(i) The inequality (25) X 2 + Y2 > 2XY (X, Y E IR, X :;f Y ) follows easily from ( X - Y) 2 > 0. Let us ask a more general question: Which numbers p E R have the property that the inequality x2 + y2 > pxy ( which we denote by L > R) holds for all numbers x, y E IR? The trinomial L - R contains the binomial x2 -pxy, which we complete as a square. Thus we get
(26) Choosing x = py /2, y f. 0, we obtain the necessary condition 4 - p2 > 0, which, in view of (26), is also sufficient . Solving the inequality 4 - p2 > 0, we obtain the answer: -2 < p < 2. (ii} Let us now prove the inequality
a + b >1+1 (a, b E JR+ ) . b2 a2 a b Upon multiplying by a2 b2 we obtain a3 + b3 > ab(a + b); dividing by a + b we get a2 - ab + b2 > ab, and after subtracting ab, finally (a - b) 2 > 0. (iii} Determine the integers n > 2 for which the inequality a� + a� + · · · + a! > (a 1 + a2 + · · · + an- l )an holds for arbitrary a 1 , a2 , . . . , an E R(j. Completing squares, we obtain
(
)
an ) 2 + (a - an ) 2 ( an ) 2 + 1 - n - 1 a2 L - R = (a 1 - 2 + + a · · · 1 2 2 n- 2 n. 4 The inequality therefore holds when 1 - ( n - 1) /4 > 0, that is, n < 5; for n > 6 the inequality is generally not true: It suffices to consider the n-tuple aj = 1 (1 < j < n - 1) and an = 2. (iv} We prove that for each x, y E 1R we have the inequality
x2 - 2xy + 6y2 - 12x + 2y + 41 > 0.
The terms containing x will be completed as squares:
x2 - 2xy - 12x = (x - y - 6) 2 - (y + 6) 2 . We thus obtain
1 15
4 The Method of Squares
(v) We prove that whenever p > q > 0, the following inequalities hold for all IR: p + q > x2 - 2qx + p2 > p - q . p - q - x2 + 2qx + p2 - p + q
XE
The trinomial in the denominator satisfies
x2 + 2qx + p2 = (x + q) 2 + (p2 - q2 ) > 0. If we multiply each of the inequalities by the (positive) product of both relevant denominators, we obtain after simplification the two inequalities 2q(x + p) 2 > 0 and 2q(x - p) 2 > 0. (vi) We prove the following assertion: If x3 + y3 = 2 for some x, y R, then x + y < 2. We note that for x = y = 1 we have x3 + y3 = x + y = 2; we will not find other such pairs x, y. In such a situation it is convenient to set x = 1 + u, y = 1 + v, and to derive u + v < 0 from the assumption (1 + u) 3 + (1 + v) 3 = 2. Indeed, the equation
E
2 = (1 + u) 3 + (1 + v) 3 = 2 + 3(u + v) + 3(u2 + v2 ) + u3 + v3 implies From this we easily obtain u + v < 0, since by the result of part (i) we have u2 - uv + v2 > 0, and thus u2 - uv + v2 + 3 > 0. (vii) To prove the inequality a3 + 3a2 - 13a + 10 > 0 (a :JR+) , we try to write its left-hand side in the form L = a(a + p) 2 + b(a + q) 2 + c with appropriate constants b, c JRt and p, q JR. By comparing the coefficients of equal powers ai we obtain the conditions 2p + b = 3, p2 + 2bq = -13, and bq2 + c = 10. It is not difficult to find some solution of this system of three equations: We choose an arbitrary p and then successively compute b, q, c. But we require solutions with the property b, c JRt! The first equation implies p = (3 - b)/2 < Let us try such integers p: While the values p = 1, p = 0 do not work (we get c = -39 resp. c · -4.08) , we are successful with p = -1: We get c = g > 0 (b = 5 and q = -�). Thus we obtain 2 1 7 2 + 5 > 0. L = a(a - 1) + 5 a 5
E
E
E
E
�-
( )
(viii) The inequality X 2 + Y2 + Z2 > XY + YZ + ZX
E
(X, Y, Z lR)
(27)
has numerous applications in proofs of other inequalities. It can be obtained by rewriting the inequality (X - Y) 2 + ( Y - Z) 2 + (Z - X ) 2 > 0. Thus, for example, we verify
(28)
116
2. Algebraic Inequalities
2 2 E 2 + x2y2 + y2 z2 + x2y2 + y2z2 + y2x2 > xy2z + yz2x + zx2y = xyz(x + y + z).
for arbitrary x, y, z IR as follows: Using (27) with X = x , Y = y , and z2 x2 ; using (27) again, this Z = z , we obtain x4 + y4 z4 > time with X = xy, Y = yz, and Z = zx, we get Now ( 28) follows from these two consequences of ( 27). The reader should verify that the inequality
a + b + e -< -bea + -cab + -abe (a, b, e E JR+ )
also follows from ( 27), with
X=
�,
Y=
J¥ ,
and
Z=
fff- .
3 + z3 > 3xyz. For this 3 x + + + y purpose we use the elementary symmetric polynomials 0' 1 = x + y + z, 0'2 = xy xz + yz, and 0'3 = xyz ( Chapter 1, Section 4). Since x3 + y3 + z3 - 3xyz = (O'r - 30'10'2 + 30'3) - 30'3 0'1 (0'� - 30'2) and 0'1 > 0, it suffices to show that O"� - 30'2 > 0, that is, 0'� - 20'2 > 0'2 . But this is just (27) , since x2 + y2 + z 2 0'� - 20'2 • (x) Let us find the smallest possible value of the expression ab be ca V= + + , e a b if the positive numbers a, b, e satisfy the condition a2 + b2 + t? = 1. First we determine the square of V: a2b2 + b2t?2 + t?a2 2 + 2 ( ab . be + ab . ca + be . ca ) V2 = a2 b 2 e a e b a b t?a + 2(a2 + b2 + �) b t?2 + a2b2 + =a b2 t?a2 + 2. b2t? + ----,;2 a2b2 + � = ---;? (ix) We show that if x y z > 0, then +
see
=
=
c2
c2
Since (27) implies
( ab ) 2 + ( be ) 2 + ( ca ) 2 > ab . be + abe . cab + be . ca e
a
e a2 a b = a2 + b + � = 1, we obtain the bound V2 > 3, that is, V > v'3. Equality V = J3 occurs in the case a = b = e VJ/3; hence we have found J3 as the smallest value of V. =
b
117
4 The Method of Squares
4 . 2 Exe rcises
Prove (i)-(:xxviii) for arbitrary a, b, c E JR+ and x, y, z E IR: (i) (ii) (iii) (iv) (v) (vi) (vii) (viii)
(ix) (x) * (xi)
(xii ) (xiii) (xiv) (xv ) (xvi) (xvii) (xviii )
(xix ) (xx)
(xxi )
(xxii) * (xxiii) (xxiv) (xxv)
.
* (XXVI) (xxvii) * (xxviii)
2xyz < x2 + y2 z2 . (x2 y2 ) 2 > 4xy(x y) 2 . x4 + y4 > x3 y + xy3 . > .,;a + v'b. + x2 < 1 1 + x4 2 · x2 (1 + y4 ) + y2 (1 + x4 ) < (1 + x4 ) (1 + y4 ). x2 + 4y2 + 3z2 + 14 > 2x + 12y + 6z. x2 + 2y2 + 2xy + y + 1 > 0. 2 + x2 (1 + y2 ) > 2x(1 + y). x4 + y4 + z2 + 1 > 2x(xy2 - x + z + 1). .../a2 + b2 > a + b - (2 - .../2) v'£ib. 2x2 + 4y2 + z2 > 4xy + 2xz. 2(x4 + y4 ) - 12xy + 10 > 0. 2{ � + {/b + {'C) < 3 + vfa + � + .[C. a(1 + b) + b(1 + c) + c(1 + a) > 6.J(ibc. 2(a2 + b2 ) + a + b > 2(ab + av'b + bvfa,). a4 + 2a3 b + 2ab3 + b4 > 6a2 b2 : 4x2 y2 + ( Z + + y) ( Z + - y) ( Z - + y) ( Z - - y) > 0. x4 - x2 - 3x + 4 > 0. a4 + a3 - 8a2 + 4a + 4 > 0. x; + y2 + z2 > xy - xz + 2yz. a + b + c > 2(fo + v'bC - v'iib) . a3 > 36. a; + b2 + t? > ab + be + ac, abc = 1 (1 + x + y) 2 > 3(x + y + xy). ab + be + ca > J3abc(a + b + c). a8 + b8 + cB > !. + !. + !. a3 b3 c3 - a b c · xy + yz + zx > -4, x2 + y2 + z2 = 1. 4x(x + y) (x + z)(x + y + z) + y2 z2 > 0. pz - 2qy + rx = 0 p, q, r, x, y, z E IR 2 2 pr - q > 0, xz - y < 0. F(x) = x4 + ax3 + bx2 + ex + d t? + a2 d < 4bd. a, b, c, d E IR, d > 0, _
_
.:; .:a
�
X
X
X
if
X
and
if
Assuming thatpr ve the inequality satisfy � (xxx } Show that the polynomial and no real zeros, where
(xxix)
and has
1 18
2. Algebraic Inequalities
*(xxxi) Show that for arbitrary positive numbers a, b, c we have (p E R.ri ) . This is a generalization of (27) , which we obtain by setting P * (xxxii) For arbitrary a, b, c E JR+ decide which of the two numbers
(
) (
=
0.
)
A = 3 + (a + b + c) + a1 + b1 + c1 + ab + cb + ac ' + 1) (c + 1) B = 3(a + 1)(b abc + 1 is larger. * (xxxiii) Find the largest p E 1R such that the inequality
x4 + y4 + z4 + xyz(x + y + z) > p(xy + xz + yz) 2
holds for all x, y, z E JR. *(xxxlv} For each p E {1, �, ! }, determine the inequality
n
> 2 for which the
X� + X� + · · · + x! > p(X1X2 + X2X3 + · · · + Xn- l Xn ) holds for all x 1 , x2 , . . . , Xn
E R.
4 . 3 A Lower Bound for A + B Using (25) with X VA and Y = VB, we obtain =
A + B > 2v'JiB (A, B E JRt) , (29) with equality only when A = B. We use this lower bound for the sum A + B
to solve the following seven problems . (i) Show that for any a, b, c E JR+ the inequality ab + � > 2y'aC holds. SoLUTION. The result follows from (29) with A = ab and B = cjb.
(ii) Show that if a, b E JR+ , then ab(12 - 2a - 5b)
<
O
2a + 5b.
We note that the term 2a + 5b occurs on both sides of the inequality; we therefore rewrite it as 12ab < (2a + 5b)(1 + ab) . Using (29), both terms on the right of this last inequality can be estimated from below with the help of v'fib: (2a + 5b) > 2v'fi)ab and 1 + ab > 2v'fib. Multiply ing these together, we obtain (2a + 5b) (l + ab) > 4v'Wab > 12ab, since 0 v'W > 3. SoLUTION .
4 The Method of Squares
1 19
(iii) Show that if a, b, c, d E JRt, then a + b + c + d > 4 � . SOLUTION . Since by (29) we have a + b > 2Val) and c + d > 2...;cd, it ·
suffices to show that Vab + ...;cd > 2 · � . But this is just (29) with o A = Val) and B = ...;cd.
(iv) Under the assumption that the numbers a 1 , a2 , b 1 , b2 , C1 , c2 E Jil sat
isfy a 1 c1 > lJt and a2 c2 > � ' prove the inequality (a 1 + a2 ) (c1 + c2 ) > (bl + b2 ) 2 . SOLUTION. We rewrite the desired inequality as
(a 1 c1 - b� ) + (a 2 c2 - b� ) + (a 1 c2 + a2 c1 - 2bl �) > 0. Thus it remains to show that a 1 c2 + a2 c1 - 2b1 b2 > 0, and indeed, by (29) with A = a 1 c2 and B = a2 c1 we have
a 1 c2 + a2 c1 > 2 y'a 1 c2 a2 c1 = 2 vfaiC1 · .Jli2C2 > 2b1 b2 .
0
(v) Show that if a, b E JR+ and ab < 1, then (1 + �)(1 + i) > 4.
SOLUTION .
By (29) we have 1 + � >
(1 + .!.a ) (1 + !b ) -> 2_ va,
·
}a and 1 + i > J£;, and thus
2_ = .....!__ >4 v'b Val) '
< 1. since ab -
0
(vi) Show that if a, b, c E JR+, then (a + b) (b + c) (a + c) > Babe.
By (29) we have a+b > 2v'ab, b+c > 2v'bC, and a+c > 2vfaC; multiplying these three inequalities together, we obtain 0 (a + b) (b + c) (a + c) > Bv'a2 b2 c2 = Babe. SOLUTION.
(vii) Suppose that the real numbers x 1 , x2 , . . . , Xn satisfy the condition x1 x2 • • • Xk > 1 for each index k = 1 , 2, . . . , n. Prove the inequality
n 2 1 +...+ 2 + (1 + X 1 )(1 + X2 ) . . (1 + Xn ) < • (30) 1 + X1 (1 + X 1 )(1 + X2 ) 1 , 2, . . . , n. Hence by (29) with SOLUTION . Obviously, Xk > 0 for each k A = 1 and B = Xk we have 1 + Xk > 2vfxk, and thus •
=
k � < < (1 + X 1 ) (1 + X2 ) . . (1 + Xk ) 2 k ..jX 1 X2 " Xk 2k for each k = 1, 2, . . . , n. Therefore, the left-hand side of (30) does not exceed n+2 n 2 -1 + · · + -n = 2 - n < 2 + · 2 2 2 22 (see Chapter 1, Example 2.37) . o k
•
•
120
2. Algebraic Inequalities
4.4 l?xercises Show that the inequalities ( i) -(viii) hold for all a, b, c, d E JR.+ :
(i) (ii) (iii} (iv) (v) . ( ) VI
(vii) (viii) *(ix)
a2 b +
� > 2a.
6a + (c + 2) (2c + 3)b > 6(c + 2) v'ab. a4 + a3 b - 4a2 b + ab + b2 > 0. (a + 1)(b + 1)(a + c) (b + c) � 16abc. J(a + b)(c + d) + J(a + c) (b + d) + J(a + d) (b + c) > 6 1 1 8 + > ab cd (a + b) (c + d) ( VO, + Vb) 2 > 2 V2(a + b) v'ab. 2(a + b) 2 + (a + b) > 4(a Vb + by'a) . Show that for arbitrary a 1 , a2 , . . . , an E JR.+ we have
( ) i=l j=i+l
(
n- 1 n
n- 1 n
1 1 � � � � > 4 L-i L-i 2 L-i L..i a,·a, + ! a · + a3· i=! J=i
n
·
)
•
·
{IOi)Cii.
2 .
4 - 5 Upper Bound for A - B Rewriting (29) , we obtain
(A , B E JRt),
(31)
with equality occurring only if A = B . Using the bound (31), we now solve the following five problems. (i) Show that if a, b E JR.+ and a + b = 1 , then (1 + �)(1 + i) > 9. SOLUTION. By (31) with a + b = 1 we get ab < -! · Hence
a+ +1 � ( 1 + :b = 1 + :b > 1 + � � = 1 + ) ) ( 1+
=
9.
D
(ii} Let bb b2 , . . . , bn be an arbitrary ordering of the numbers a 1 , a2 , . . . , an , with 0 < ak < 1 for k = 1, 2, Show that at least one of the numbers . . . , n.
does not exceed
-!.
4 The Method of Squares
SOLUTION . k = 1 , 2, . . .
Suppose to the contrary that , n. Then
C)
n
ak (1 - bk ) > �
1 21
for all indices
< a 1 ( l - b1 )a2 (l - ba) · · · an (l - b,) a 1 ( 1 - a I ) a2 ( 1 - a2 ) · · · an ( 1 - an ) ,
=
which means that ak (1 - ak ) > � for some k 1 , 2 , . . . , n. But this is a 0 contradiction, since by (31) we have a( 1 - a) < i whenever 0 < a < 1 .
=
(iii}
Show that
if 0 < b < a, then a + 1/(ab - b2 ) > 3.
By (31) with A a - b and B b we have the inequality 2 (a-b)b < a /4, which implies a+1/(ab-IJ2) > a+4/a2 . Therefore, it suffices to show that a+ 4/a2 > 3. But this is easy to rewrite as (a + 1) (a - 2) 2 > 0.
=
=
SOLUTION.
FUrthermore, we see that the original inequality becomes an equality only 0 if a - b = b and a - 2 0, that is, a 2 and b 1.
=
=
=
(iv) Show that if a > 0, then 4 vfci(./(i - 2) (1 + 2 vfci) < (a + 1 ) 2 . SOLUTION.
vfci( vfci - 2 )
It suffices to examine the case vfci > a - 2 vfci and B 1 + 2 vfci we get
=
=
y'a (y'a - 2) (1 + 2 v'a) <
2. From (31) with A =
e - 2y'a ; 1 + 2y'ar = (a : 1) 2 '
which gives the desired inequality. It is left to the reader to show that O equality occurs only in the case a = 9 + 4vfs .
(v)
a, b, c, d E JR.+ we have a + b + c + d >2. b+c c+d d+a a+b
Show that for arbitrary
SOLUTION .
On the left-hand side of this inequality we add the first and the third terms, and the second and the fourth terms. Then, using (31), we estimate the common denominators ( b + c) ( d + a) and (c + d) (a + b) from above by !(a + b + c + d) 2 :
a2 + c2 + ad + be + b2 + � + ab + cd (c + d) (a + b) (b + c) (d + a) 2 + b2 + c2 + d2 + ad + be + ab + cd) 4( a >(a + b + c + d) 2 2 2 c2 2 . (a + b + c + d) b+ (ac +- d) 2 + (b - d) >- 2 · (a + + )
L= =
0
122
2. Algebraic Inequalities
4. 6 Exercises Prove the inequalities ( i) -(v) for arbitrary a, b, c, d E JR.+ :
(i) (1 + a + b) 2 > (1 + 2a)(1 + 2b). 2 1
- abc + abd 4 * (vi) For each integer n > 2 find the largest number Pn E IRt such that for all n-tuples XI, x2 , . . . , Xn E JRt we have n 2 n (E Xk) (E XkXk+ l ) > Pn E x�x�+ l , where Xn+ l = X 1 k=l k=l k=l * (vii) Let n > 4, and suppose that the sum of the nonnegative real numbers a 1 , a2 , . . . , an is equal to 1 . Prove the inequality
v'b
v
n
•
·
·
Remark. The results of 2 . 2 . (iv) and 4.6.(ii) present bounds for the value of v'b if we know an interval of length 1 in which this value lies. Thus the fact that .../2 lies between 1 and 2 implies t < .../2 < g. 4- 7 Lower Bound for A + A-1 If we set B = 1/A in (29), we get the inequality
A + A1 > 2
(A E JR+ ),
(32)
with equality only if A = 1. This inequality is useful for solving a number of problems; from among them we will choose four examples. We remark that as a rule it is necessar y to divide the desired inequality by an appropriate expression before (32) can be used . (i) Show that for arbitrary a, b, c E JR.+ we have
ab(a + b) + bc(b + c) + ac(a + c) > 6abc. SOLUTION. After dividing by abc we rewrite the inequality as
4 The Method of Squares
123
which is the sum of the three inequalities obtained when (32) is applied to A = g_b ' g_ and ll 0 c '
c·
(ii) Show that for arbitrary a, b, c, d E JR.+ we have (a2 + a + 1)(b2 + b + 1)(c2 + c + 1)(d2 + d + 1) > 81abcd. SOLUTION . After dividing by abed we rewrite the inequality as
By (32) , none of the four expressions in parentheses is less than 3; their 0 product is therefore at least 34 = 81.
(iii) Prove the inequality vfa( a + 1) + a(a - 4) + 1 > 0 for each a E JR.+ . SOLUTION. After dividing by a we rewrite the inequality as
By (32), none of the expressions in parentheses on the left than 2.
lS
less D
(iv) Show that for arbitrary a, b, c E JR+ we have a + b + c >3 b+ c c+a a + b _ 2. SOLUTION . If we set u = b + c, v = c + a, and w = a + b, we obtain a = (v + w - u)/2, b = (u+ w - v)/2, c (u + v - w)/2. Upon simplification =
we obtain
a + b + c = !_ b+c c + a a + b 2
[( u + v ) ( � v u w +
+
w) + (w + u ) _ ] v u w 3 ,
and it suffices to note that by (32) each of the three terms in parentheses is at least 2. D 4. 8 Exercises Show that for a, b, c, d E R+ the following inequalities hold: (i)
a2 + 3 > 2. va2 + 2
124
2. Algebraic Inequalities
2a2 + 1 > 1 . v'4a2 + 1 (iii) (ab+ cd) > 4. + c C �) (iv) 4ab(3 - a) - 4a(1 + b2 ) < b. (v) a2 + b + via+ v'ab (a v'b - 4v!a) > 0. (ii)
5
The Discriminant and Cauchy's Inequality
Let us consider the quadratic polynomial (a,
F(x) = ax2 + bx + c
(33) a :;f 0) . Completing the square ( the introduction to Section 4), we obtain the identity 2 ( ) b F(x) = a x + -2a - -4aD where D b2 - 4ac. (34) The number D is called the discriminant of the polynomial F(x). The expression (34) implies not only the known formula for the roots x 1,2 of the equation F(x) = 0, but also the following result . b, c
E
IR,
see
=
,
5. 1
Values of a Quadratic Polynomial Theorem. (33} = 2! . D as {34}. E lR, :;f (i) > D 0, E 1R (ii) >0 >0 (iii) D 0, E IR;
Let F(x) be the polynomial with positive leading coeffi cient a and discriminant in Put xo Then x x , F(x) for any x F(x ) o o i f and only i f for all x F(x) < ionly f i=f x then F(x) for all x in this case F(x) = 0 if and x , o (iv) if D > 0, the equation F(x) = 0 has two different roots, say x 1 > x2 ; in this case .F(x) > 0 when x < x2 or x > x1 1 and F(x) < 0 when X2 < X < X1 (The reader should think about how ( i) - ( iv ) change in the case a < 0.) PROOF. If a > 0, then by (34) we have F(x) > - 4Da (x lR) , where equality occurs only for x x0 . This implies the assertions (i) ( iii) ; the roots x 1 , x2 in part (iv) are given by the well-known quadratic formula, and the last assertion about the sign of F(x) follows easily from D the factorization F(x) a(x - x 1 )(x - x2 ) (see 3. 1 4 in Chapter 1). =
E
=
=
5 The Discriminant and Cauchy's Inequality
5. 2
125
Examples
In the following seven examples we will practice the use of the properties of the discriminant stated and proved in 5. 1.
a, b, (35) (a2 b2 + c2 ) 2 > 2(a4 + b4 + c4). The above inequality is equivalent to a4 - 2(b2 + c2 )a2 (b2 -c2 ) 2 < The equation x2 -2(b2 +c2 )x+(b2 -c2 ) 2 has the two roots x 1 (b+c) 2 and x2 (b c) 2 . By 5.l. (iv), the inequality (35) holds and only if 2 < a2 < (b c) 2 , that is, if and only if l b - cl < a < b + c, which is (bc) the known criterion for side lengths of a triangle. 1R for (ii) Let x 1 , x 2 , . . . , Xn be given real numbers. Determine the x which the sum S (x - x 1 ) 2 + (x - x 2 ) 2 · · · + (x -Xn ) 2 is minimal. We rewrite S = nx 2 +bx+c, where b -2(x 1 +x2 +· · · +xn ) · Then by part (i) of Theorem 5. 1 , S attains its smallest value for b X1 + X2 · · Xn 2n n (iii) Let x, y, z JR. Show that the smallest of the numbers (x-y) 2 , (y-z) 2 , and (z - x) 2 is greater than or equal to ( x2 + y2 + z2 ) f2. In view of the symmetry we may assume without loss of gen > > x y b z erality that x < y < z, and we set a y Then 2 + y2 + z2 (y - a) 2 + y2 + (y b) 2 . By 5.2.(ii) this sum is (for fixed xvalues b)/3 = (a - b)/3. Hence of a, b) smallest when y = (a + x2 y2 + z2 > ( � - a) 2 ( � ) 2 + (� + b) 2 2 2 Clearly, (a2 + ab + b2 )/3 > (£? + c2 + c2 )/3 £?, where c is the smallest of the two numbers a, b. Therefore, (x2 y2 + z2 )/2 > £?, where c2 is the smallest of the two numbers (y - x ) 2 and (z - y) 2 • abc (iv) Suppose that the numbers a, b, c JR+ satisfy a + b c and a2 be. Show that a > v'3. By Vieta's relations (Chapter 1, Section 3) the numbers b and c are roots of the quadratic equation x2 - (a3 - a)x + a2 (i) Show that the positive numbers c are side lengths of some triangle if and only if they satisfy the inequality +
SOLUTION.
+
0.
= 0
=
=
if
+
0
E
+
=
SOLUTION.
=
X = -- =
+ ·
+
0
-------
E
SOLUTION.
+
=
+
0,
=
0.
=
0 -
+
+
=
o
+
E
=
SOLUTION.
= 0,
=
1 26
2. Algebraic Inequalities
3 2 . 2 2 -3) (a2 +1) , be = a2 b+c = abc-a a·a = a -a = -a 3 2 2 (a a 4a = (a -a) a2 3, a (v) Suppose that x1 is the smallest and Xn the largest among the n real numbers x 1 , x2 , . . . , Xn· Show that if x 1 + x2 + · + Xn = 0, t hen the sum x� + x� + · · · + x; + nx1xn is not positive. SOLUTION. The polynomial f(x) = x2 -(x1 + xn ) x+x l xn has X 1 and Xn as its zeros. Hence Theorem 5.1 implies that if x 1 < x < Xn , then 0 > f(x). Adding the inequalities 0 > f(xj ) for j = 1 , 2, . . . , n, we obtain (in view of the condition X 1 + X2 + · · · + Xn = 0) n n n n 0 > EJ(xj ) = Ex� - (x1 + Xn ) E xj + nx 1 Xn = Ex� + nx 1 Xn · D j=l j=l j=l j=l
It therefore has a non since and > 0. Since D negative discriminant: D = D we obtain > which implies the desired inequality > .J3. ·
·
(vi) The evaluation of the discriminant replaces several artificial tricks
that were necessary for solving problems by way of the method of squares in Section We illustrate this with the following example. Adding the > > 2 £, > v'ab inequalities ..JbC, > and E JR+ , (see 2 and (29)) we obtain for arbitrary
4. 4-v'ab, 2(a + b) b + c a + b + c + vfaC + 3(a+c) 6vfaC ( 7) a, b, c (36) 6a + 4b + 5c > 5v'ab + 7 vfaC + 3-Jbe. "Discovering'' this proof of (36) is certainly not easy; the reader should try to prove this inequality with the method of completing the square. However, the inequality (36) is quadratic in the variables x = yfa, y = Vii, and z = ...jC; with the help of the discriminant we will show that (37) 6x2 + 4y2 + 5z2 > 5xy + 7xz + 3yz for arbitrary x, y, z lR, that is, 6x2 - (5y + 7z)x + 4y2 + 5z2 - 3yz > 0. (Note. The authors know that this will work. However, sometimes such a generalization can be misleading: It could happen that the inequality (37) holds only for x, y, z JR+ , since x = VO,, etc. Then the discriminant of the last polynomial could be positive. ) It therefore suffices to show that the discriminant D (5y + 7z) 2 - 24(4y2 + 5z2 - 3yz) is not positive for any y, z JR. By an easy calculation we find that D = -71 (y - z ) 2 • This completes the proof of (37), and therefore also of (36). E
E
=
E
(vii) In contrast to the previous example we now deal with a situation
where the use of the discriminant is simply unsuitable. We show that the equation
F($) = (X - a) (X - C) + 2 (X - b)(X - d) = 0,
(38)
5 The Discriminant and Cauchy's Inequality
127
a < b < c < d,F(x) = 3x2 -(a+2b+c+2d)x+ac+2bd, if D = (a + 2b + c + 2d)2 - 12(ac + 2bd) a b < < c < d; x = b, F(b) = (b a)(b c) < a < xb2<, c. F(x), x = b). 5.1 F(x) a b c < < x x x b x) a < < 1 2 2 c < x1 < d, F(a) F(b) < (c) < F(d)
where has two distinct real roots. The following approach suggests itself: Since the assertion holds if and only > 0. The reader should attempt to derive this last inequality from the assumption this is not at all easy. Compare this with the following alternative solution: Substituting we obtain 0, since Therefore, the polynomial with the positive coefficient By 3 of attains a negative value at some point (namely when Theorem this means that has two distinct real zeros. (Note that we required only the inequalities in this proof.) We finally remark that the zeros and > of F( satisfy the inequalities 0 , and 0, F > 0. since > 0,
5. 3 Exercises >0 (i} Suppose that the numbers s E IR are such that > 0 hold for all E R. Show that >0 and for all E :JR. (ii) Let E R+ . Show that c are the side lengths of some triangle E 1R with + satisfy the inequality and only + > pq�. (iii) Show that are the side lengths of some triangle, then the inequality + + r? + be + ca ) holds. then + + z + z (iv) Show that > 8 z+ . * (v) Determine the values E IR for which x2 +
2 px x + q + 2x2 + prx + 2qs
p, q, xr,
x2x+rx + s a, b, c p, q a, b,p q = 1 if if all pa2 qb2 ifa2 a, bb,2 c 2(ab < ifx < y < < u, (x y u) 2 (x yu) p -2 <2 -2 < x2 -2px 2x + 2 holds for all x E JR.
5.4
Cauchy 's Inequality
. . . , Un and Thesatisfy two thearbitmry n-tuples of real numbers u , u , 1 2 inequality v1 , v2 , . . . , Vn (u 1 v 1 + u2 v2 + + Un Vn ) 2 < (u� + u� + + u; )( v� + v� + + v; ) . (39) in (99}< only< if uk = 0 (1 < k < n), or if there is a t E lR Equality occurs such that Vk = tuk (1 k n). PROOF 1. If Uk 0 (1 < k < n ), we have equality in (39). Let therefore uk i= 0 for some k 1,2, . . . ,n . We set F(x) = (u1x - v1 )2 + (u2x - v2 )2 + + (unx - vn) 2 . (40) Theorem.
···
· · ·
· · ·
=
=
· · ·
2. Algebraic Inequalities
1 28
ax2 - 2bx + where n n �, Lv and a = k=Eul � > 0, k=l with discriminant D = 4 (b2 - a ) . By (40) we have F(x) > 0 for x lR, and thus Theorem 5.1 implies D < 0, that is, b2 < a , but this is (39). Equality in (39) occurs if and only D 0, that is, and only if F (t) 0 for some t :JR. By (40), this last condition means that Uk t -Vk 0 for all 0 k 1, 2, . . . , n. 2. It suffices to consider the case where neither u 1 u2 · · 0 norinv1the= vvariables inequality (39) is homogeneous ( U2.n7)=both 2 · uV1n, u=2 , 0.. . The . , Un and in the variables v1 , v2 , . . . , Vn · We may therefore normalize both n-tuples in such a way that u21 + u22 + · + un2 v21 + v22 + · + Vn2 _- 1 (41) As in the first proof we set b . Adding the u u + v v + U V 1 1 n n 2 2 inequalities 2uk Vk < u� +v� (see (25) ) for k = 1, 2, . . . , n we get, in view of 41), 2b b<>2,-1.thatAltogether is, b < 1. Similarly, the inequality 2( -uk )vk < ( - uk ) 2 +v� (implies we have therefore -1 < b < 1, that is, b2 < 1, and this is (39) in the case (41). Equality in (39) occurs if and only either b < 1k or< n)b . If-1,we that is, either Uk Vk (1 < k < n), or Uk -vk to the general n-tuple, we obtain the condition (1V tu ( 1 < k < n)return 0 for appropriate t =I= 0. k k Remark 1. Cauchy's inequality (39) implies the weaker inequality u1 v1 + u2v2 + + UnVn < J(u� + u� + · + u� )(v� + v� + · · + v� ). (42) (This inequality is trivial when the left-hand side is not positive; in the case of nonnegative numbers uk , Vk (1 < k < n) , both forms (39) and (42) of Cauchy's inequality are equivalent.) From Proof 2 above it follows that equality in (42) occurs if and only if Uk < k < n) or Vk tuk 0 (1 (1 < k < n) for some t > 0. Remark 2. Cauchy�s inequality (39) can be written with the help of the vector (with components ui ) and the vector v (with components vi) in the form ( u, V) 2 < (u, u) . (v, V) ' where ( . . ) stands for the scalar product in ' the n-dimensional Euclidean space. Equality then occurs if and only if the vectors and v are linearly dependent. Thanks to this inequality one can introduce into these spaces the concepts of distance and of size of an angle, with similar properties as in elementary plane geometry (see, e.g., [ 10] , pp. 217 f. ) . It is easy to see that F(x) is a quadratic polynomial
c,
c =
all
c
c
if
E
if
=
E
=
=
=
P ROOF
=
=
=
· ·
=
·
=
if
=
=
.
· ·
+
· · ·
if
=
=
=
· · ·
· ·
=
i1
i1
=
see
=
·
·
·
=
129
5 The Discriminant and Cauchy's Inequality
5. 5 Examples We will now convince ourselves that Cauchy' s inequality (39) can be used to prove a number of inequalities. (i) Show that if 2x + 4y = for some x, y E lR, then x2 + y2 > 2� .
1
SOLUTION . By (39) with n = 2 we have (2x + 4y) 2 < (22 + 42 )(x2 + y2 ). 0 If 2x + 4y = we get < 20(x2 + y2 ) , that is, x2 + y2 > 210 •
1,
1
(ii) Show that for arbitrary x, y, z E 1R we have y2 + ( -x + -y + -z ) 2 < z2 x2 + (43) 2 3 6 - 2 3 6' Furthermore, determine when equality occurs in ( 43). SOLUTION. In (39) with 3 we set u 1 = u2 u3 v1 = x/v'2, v2 yjVJ, and V3 zj.v-6. We thus obtain _!__ . � _!_ . JL _!__ . � 2 ! + ! + ! x2 + y2 + z 2 < + - 2 3 6 V2 v'3 v'3 2 3 6 ' that is, ( 43) . Since Vl XU 1 , V2 yu2 , V3 ZU3 , and Uk #= 0 < k < 3), 0 equality in ( 43) occurs and only if x y z (see Theorem 5 .4).
1/ -/2,
n =
(
=
-/2
=
+
.J6 .J6
if
=
) (
=
=
1/-/3,
)(
(1
=
=
(iii) Show that for arbitrary a 1 , a2 , . . . , an
=
1/.J6,
)
=
E
:JR+ we have
a2l + a22 + . . . + an2 - 1 + a2n > a + a + . . + a l 2 n· an a1 a2 a3 SOLUTION. By (39) with Uk = ak / y'ak+ l and Vk y'ak+1 lln+ l = a 1 ) we have .
=
( 44)
(1 < k <
n,
and upon division by a 1 +a2 + · · ·+an we obtain (44). It is left to the reader to verify that equality in ( 44) occurs and only if a 1 = a2 · · · = an . D
if
=
(iv) Prove the so-called triangle inequality
f�(ud vk ) 2 < � t u� + � t v�
(45)
130
2. Algebraic Inequalities
v�, +VI 1111 +
. . . , Vn· (This for two arbitrary n-tuples of real numbers u 1 , . . . , Un and < inequality can be rewritten in vector form as l u l VI , where denotes the length of the vector; the meaning of the attribute ''triangle" is now clear from the geometrical construction of the vector sum u v.)
( u� + · + u; + v� + · + v;,
1·1
+
SOLUTION. One can prove 45) as follows: Upon squaring, then subtract · and finally dividing by two, we obtain the ing ·· inequality (42). (From this we also obtain a criterion for equality in (45); see Remark 1 in 5.4 above.) However, we give another proof with a trick that can also be used to prove the more general so-called Minkowski inequality (see Exercise 8.8.(xii)) . If we add the two inequalities ·
n 2 , u +v ) E( E � k uk k= l k=l n n 2 Lv� , ) E(u +v k k k= l k= l n
n
(
< )u E(u + Vk k k k=l n < )v + v E(u k k k k=l
of type 42), we obtain
ir(uk + Vk )2 tr(uk + Vk )2 • ( � f� U� + � fr V�) <
2
·
(
We have thus derived the inequality L < L R, where L < R is 45). Hence L(L - R) < 0. If L = 0, then 45) is trivial; if L 1= 0, then L > 0, and therefore the inequality L( L - R) < 0 implies L - R < 0, which D proves 45) .
(
(
a1 7 a2 , , an :JR+ we have (a1 + a2 + · . . + an) (_!_a1 + _.!._a2 + . . · + _!_an ) > n2 ,
(v) Show that for arbitrary
•
•
•
E
(46)
where equality occurs if and only if a 1 = a2 = · · · = an . SOLUTION. (46) follows from (39) with = fok and = 1/fok for k = 1, 2, . . . , n; since and are positive, equality in 46) occurs and only = t , that is, 1/fok = tfok (1 < k < n) for some t E JR+ . But this means that a = a2 = · = an = 1 /t ) , and the proof is complete. We add that the inequality (46), which combines mathematical "beauty" with usefulness, is a special case of the inequality in Exercise 2.4.(xvi) with r = -1, s = t = 0, = 1. It is also worth mentioning another generalization of 46):
(
v u k k ifvk uk ·· ( 1 u
uk
V( k
if
5 The Discriminant and Cauchy's Inequality
131
with arbitrary b�, b2 , . . . , bn E JRt. This follows from Cauchy's inequality D (39) with the choice Uk = ..;a;Jik and vk = Jbk /ak , k = 1, 2, . . . , n.
(vi} Show that for arbitrary a, b, c E :JR+ we have 1 9 1 + 1 > ----- + 1+a 1 +b 1+c - 3+a+b+c SOLUTION. We obtain this inequality from ( 46) with n = 3, a 1 = 1 + a, a2 = 1 + b, and a3 1 + c upon dividing by a 1 +a2 +a3 = 3+a+b+c. 0 =
(vii) Show that for two arbitrary n-tuples of positive numbers b�, b2 , . . . , bn and c1 , c2 , . . . , Cn we have (47) FUrthermore, determine when equality occurs in (47). SOLUTION. By 4.3 we have bk + Ck > 2 ..J1)kck, that is, (bk + Ck ) 2 > 4bk ck , with equality if and only if bk = Ck · This implies
if
(with equality if and only bk = ck , 1 < k < n ) . This inequality, together with (46) for ak = bk ck (1 < k < n ) , gives ( 47). Equality in (47) occurs if and only bk = Ck (1 < k < n ) and at the same time b1 c1 = b2 c2 = · · · = bn Cn ( see the criterion for equality in ( 46) ) , that is, if and only if 0 b1 = � = · · · = bn = C1 = C2 = · · · = Cn ·
if
(viii) We obtain an important special case of Cauchy's inequa.Ucy (39) by setting V1 V2 · · · = Vn 1: (48) (u 1 + u2 + · · · + Un ) 2 < n(u� + u� + · · · + u; ), =
=
=
with equality if and only if u 1 = u2 = · · · Un · (In the literature this inequality ( 48) is often referred to as Cauchy's inequality. ) The relation (48) between the sum of several numbers and the sum of their squares is useful in a number of situations, some of which we will mention now. (ix) Show that if all the n zeros of the polynomial =
F ( x) = xn - cl xn- 1 + C2Xn- 2 - C3Xn -3 + . . . + ( -1) n - 1 Cn- 1 X + ( -1)n Cn (49)
132
2. Algebraic Inequalities
are real numbers, then the coefficients c1 and c2 satisfy the inequality SOLUTION. If x 1 , x2 , . . . , xn E 1R is the n-tuple of zeros of (49) , then by Vieta's relations (see Chapter 1 , Section 3) we have
C1 = X 1 + X2 + · · · + Xn , C2 = X 1 X2 + X 1 X3 + · · · + X!Xn + X2X3 + · · · + Xn- l Xn · This implies x� + x� + · · · + x; = � - 2c2 , and by (48) with uk therefore have � < n(� - 2c2 ), which gives (n - 1)� > 2nc2 .
=
Xk we 0
(x) Show that the inequality .Jx + 1 + v'2x - 3 + .,j50 - 3x < 12 holds for
all values x E 1R for which the left-hand side is defined. SoLUTION. By (48) with n .,j50 - 3x we have
=
3, u 1
=
.Jx + 1, u2
=
.,j2x - 3, and u3
( .Jx + 1 + .J2x - 3 + .Jso - 3x) 2 < 3(x + 1 + 2x - 3 + 50 - 3x)
=
=
144,
from which, upon taking the square root, we obtain the result.
0
(xi) Suppose that the sum of the n positive numbers a 1 , a 2 , . . . , an is equal
to � · Prove the inequality
(50) SoLUTION. Using (48), we estimate the left-hand side L from below:
Hence it suffices to show that 1 1
a1
-
+
a2
-
+ ···+
But this is ( 46) , with a 1 + a2 + · · · + an (xii) Let n
1
> n2 an -
-
=
.
1.
0
> 1 and suppose that the numbers x, y1 , Y2 , . . . , Yn E 1R satisfy
(n - 1)(x + Y� + Y� + · · · + Y; ) < ( Yl + Y2 + · · · + Yn ) 2 •
5 The Discriminant and Cauchy's Inequality
133
n, then x < 2YiYi · SOLUTION . In view of the symmetry we will prove only the inequality x <+ 2Y1Y2 · By Cauchy's inequality (48) for the (n - 1)-tuple of numbers Yl Y2 , Y3 , Y4 , . . . , Yn we have (Yl + Y2 + · · · + Yn )2 < (n - 1)[(yl + Y2 )2 + y� + · · · + y;] = 2(n - 1) Yl Y2 + (n - 1)(y� + Y� + · · · + Y; ). From this and the hypothesis we obtain upon dividing by n - 1 , X + y� + y� + . . . + y; < 2Y1Y2 + y� + y� + . . . + y; , 0 and thus x < 2Y1Y2 . (xiii) Show that if the numbers a, b, c E :JR+ satisfy abc = 1 , then 1 1 1 1 > + + a3 (b + c) b3 (a + c) c3 (a + b) 2 (ab + be+ ac) . SOLUTION . Since abc= 1 , we have z2 L = y+x2 z + x y+2 z + -x+y �- By Cauchy's and R = !(x + y + z), where x = �, y = t and z inequality (39) with n = 3 and the triples (u1 , u2 , u3 ) = ( .Jy + z, .Jx + z, .Jx + y) , (v1 , v2 , v3 ) (,jy:r:+ z , ..j:r:y+ z , ..jxz+ y ) we have (x + y + z) 2 < 2(x + y + z) · L, which upon division by 2(x + y + z) leads to the conclusion R < L . 0 Show that if 1 < i < j <
=
=
5. 6 Exercises vfaC v'bd. :JRt , then (i) Show that if · · · + under the (ii) Find the smallest value of the sum 1R satisfy condit ion that = , an, b are given real numbers with =/:. 0 for some where k 1,
J(a + b)(c + d) > + a, b, c, d E x� + x x + � ; x2 , . . . , Xn E x1 +a2x2 +· · ·+anxn b, x�, a 1 , . . . a 1 a a k 1 2 n. = 2, . . . , + Show that (iii ) and (iv) hold for a 1 , a2 , . . . , an E :JR and x 1 , x2 , . . . , Xn E :JR: (iii} (E�=l ak xk ) 2 < ( E:= l ak ) ( E:= l akx�).
134
2. Algebraic Inequalities
X� + X� + · · · x; - (xl + X2 + · + Xn) 2 . a + a + a a 1 a2 · · 1 n 2 r, + p4)(1 + q4 )(1 + r4 )(1 + + pqrs) 4 • a,b,c + a3)(1 + b3 )(1 + c3) + abc)3 .
> ·· (iv) - ++ an (v) Show that if p, q, s E Ill, then s4 ) > (1 (1 E JRt , then (vi) Using the result of (v) , show that if > (1 (1 ·
a, b, c, d JR+ , then 16/3 1 1 1 + + + a + b+ c a+ b+d a + c+ d b + c+ d - a + b + c+ d (ix) Show that if x 1 , x2 , . . . , Xn then (x1 + x2 + · · + Xn ) 4 < n3 (xi + x� + · · + x! ). (x) In Example 5.5 .(ix), prove the inequality (n - 1 ) c; 1 2nCn-2 Cn · (xi) Suppose that the real numbers x�, x2 , . . . , Xn satisfy the inequality X1 + X2 + · · · + Xn J(n - 1) (X� + X� + · + X� ) . Show that Xk 0 for each k 1 , 2, . . . , n. (xii) Show that if ak , bk , Ck JRt , 1 < k < n, then
(viii) Show that if 1
E
>
E Ill,
·
·
_
>
>
>
··
=
E
2 a 1 , a 2 , . . . , an (a1 + a2 + · · + an )33 n2 (a� + a� + · · · + a;2). (xiv) (a� + a� + · · · + a;) < n(a� + a� + . . . + a; ) . *(xv) Show that for a 1 , a2 , . . . , an :JR+ we have (a 1 + a2 + · · + an) 2 <- a1 + a2 + . . . + an 2(a� + a� + · · · + a� ) a2 + a3 a3 + a4 a 1 + a2 * (xvi) Let ab a2 , . . . , an JRt. Show that any numbers x 1 , x2 , . . . , Xn satisfy (a 1x� + a2x� + + anx�.)2 < a1xi + a2x� + · · · + anx! if and only if a 1 + a2 + · · · + an < 1.
Proceed in a way similar to Proof in 5.4 and use 4.l.(ix). Show that if E JRt , then (xiii) and (xiv) hold: < (xiii) · E
·
E
·
·
·
E
1R
6 The
6
Induction Principle
135
The Induction Principle
For the solution of inequality problems we can use induction methods in two different situations. The first one deals with inequalities of the type L(n) > R(n), that is, inequalities where both sides are functions of the integer variable n. It is also assumed that these inequalities are composed of finite sums or products and possibly powers with exponents depending on n. This will be done in 6.1-6.5. The second situation concerns inequalities of the type L ( x� , x2 , . . . , xn ) > R(x� , x2 , . . . , xn ) , where induction is used on the number n of the variables x 1 , x2 , , Xn (Sections 6.6-6. 7) . In the entire section, i, j, k, n are integers. .
.
•
6. 1 Examples We begin with two examples to explain the two most common approaches to proofs of inequalities L( n) > R( n) by mathematical induction. Instead of the usual concise solutions, we offer here some rather more informal remarks. (i) Let us prove that for each n > 6 we have 2n > ( n + 1 ) 2 • If we substitute the smallest value n = 6, we get L(6) 26 64 and R(6) 72 = 49. Hence the inequality L(6) > R(6) is true. Instead of also verifying the next inequality L(7) > P(7) by direct computation, we note that L(7) = 27 = 2L(6) , while R(7)/R(6) = 64/49 < 2. This shows that in the transition from L(6) > P(6) to L(7) > P(7) the larger side L increases by the factor 2, while the smaller side R increases only by the factor 64/49; hence L(7) > P(7) holds. Next, the relations L(8)/L(7) = 2 and P(8)/P(7) = 81/64 < 2 show that L(8) > P(B) holds, etc. All these particular verifications have to be carried out simultaneously: we must show that for all n > 6 we have =
L(n + 1) L(n)
>
=
=
P(n + 1) P(n) ·
But this is quite easy:
L(n + 1) L(n)
>
P( n.. + 1�) _....:.--,--,P(n)
(n + 2) 2 <===> (n + 1 ) 2 2(n + 1 ) 2 > (n + 2) 2 <===> 2>
-¢=::::?
n2 > 2 .
We stress that such a "quotient" criterion can be used only for inequalities between positive expressions.
(ii) We explain the second, "difference," criterion by way of the inequality 1 1 7 1 > + + · + · · n2 12 n + 1 ' 2 2 32 1
{51)
2. Algebraic Inequalities
136
which we will prove for each n > 2. For the smallest n = 2, equality occurs in (51), since L(2) = R(2) = ! · We note further that the left-hand side of (51) is a finite sum; if we increase n by 1 , there will be an additional term on the left:
L(n + 1) - L(n) =
1 (n + 1) 2 •
It is also easy to determine the increase on the right-hand side of (51):
R(n + 1) - R(n) = =
( 1� - n : 2 ) - ( 1� - n : 1 )
1 (n + 1)(n + 2)
<
1 (n + 1) 2 "
Thus we see that the increase on the left is greater than that on the right:
L(n + 1) - L(n) > R(n + 1) - R(n) for all n > 2.
The equality L(2) = R(2) therefore implies L(3) > R(3), and from this follows L( 4) > R( 4) , etc. Hence we have L( n) > R( n) for all n > 3. These examples illustrate the fact that in induction proofs of the in equality L( n) > R( n) we most often compare the absolute, resp. relative, growths of both sides L, R as the value of n is increased by 1. We express this in the following principle.
6. 2 The Induction Principle Theorem. Let L(no) > R(n0 ) and suppose that for each n > n0 one of the two conditions (i) and (ii) holds: (i) The numbers L(n) , R(n) , L(n + 1), and R(n + 1) are positive and satisfy L( n + 1 ) > R( n + 1) L(n) - R(n) . (ii) L(n + 1) - L(n) > R(n + 1) - R(n) . Then the inequality L( n) > R(n) holds for all n > no. If furthermore L(n 1 ) > R(n 1 ) for some n 1 > no, then L(n) > R(n) for all n > n 1 .
no N
Remark 1. In order to prove a finite number of inequalities L(n) > R(n), <
-
n < N, we require that (i) or (ii) hold only for n = n0 , no + 1 , . . . , 1. In this case we talk about so-called finite induction.
Remark 2. The conditions (i), resp. (ii) , often enter in a "hidden" manner
when from the assumption that for some n > no the inequality L(n) > R(n) holds, we derive the truth of the inequality L(n + 1) > R(n + 1). Thus, in Example 6.1.(i) we could have proceeded as follows: Multiplying the
137
6 The Induction Principle
>n >
> n
inequality 2n ( + 1) 2 by 2 , we obtain 2n + l 2 ( + 1) 2 . Hence it suffices to verify that 2(n + 1) 2 (n+2) 2 . In Example 6.1. (ii) , by adding 1/(n+ 1) 2 to both sides of (51) , we obtain 1 + 1 + 1 + + · · · 22 3 2 n2
(n
1 + 1) 2
> 127 - n +1 1 + (n 1 1) 2 = 127 - (n + 1)2 · +
n
Hence it suffices to verify the inequality
1 -127 - (n +n 1)2 > -127 - -n + 2·
6. 3 Exercises Show that the inequalities (i) -(viii) hold for all (i) (1 - a) n < 1 1 , 0 < a < 1). + a n (2n)! (ii) 4n 2) . ( < < +1 ( ) (iii) 1 + 1 + · · · + 1 1 1). 3 + (iv) 2 ! n(n- l ) 3) . (v) + + + ) +... + +X+ ) 1 1 1 (no 2). ( ) < 1+ + +...+ n 2 2 3 2 -1 < *(vii) (1 + a) n (1 + an+l )(1 + an+2 ) · · · (1 + a2n ) (no = 1, 0 < a < t2 ). 2) . (viii) ) [ + ··· (ix) Show that if 1 < k < then we have
n > n0 :
(no = l n 4 no = n n! 2 n+l n+2 n l > (no = n! (no = 1 > 2n y2n n > (xy) 2n- (xy 2n-� x(x,y xy y E lR,no = l . . n = n > 2!4! (2n ! > (n l)!]n (no = n, k k 1) k2 . 1 + - < ( 1 + - < 1 + -k + n n n2 n Remark. For k = n, (52) implies (compare with 3.8.(iv)) n ( 2 < 1 + :) < 3 for all n > l . (x) Show that for all n > 6 have ( n ) n > n! > ( n ) n 3 2 VI
we
·
(52)
(53)
138
2. Algebraic Inequalities
(xi) Show that if k > 2 and n > 2, then at least one of the numbers {in
and V'k is less than 2. (xii) Given the expression
1 3
2n
Q(n ) = 2 · 4 · · · 2 prove the estimates
Q(p)
�
<
Q(n) < Q(p)
- 1' n
J:: : �
(54)
for all p E N. Show that the inequalities (54) are stronger than those in 2.6. (x) . (xiii) Show that for all n > we have
1
� V n+
(n
- 1) + J.. + J2 + v'1 < Vn + 1 . ·
6.4 l?xa11nples We will show now that in the course of using the induction principle it is often necessary to transform the desired inequality, or even change it to a stronger inequality. (i) Out of n threes and n fours we form the numbers ,4
and Bn = 4 . Which of the two numbers An and Bn - 1 is larger? SOLUTION. We show that for each n > 2 we have An > Bn - l · With the induction method it is easier to show the stronger inequality An > 2Bn- l · By direct verification we find that A2 > 2B1 . If the inequality An > 2Bn - l holds for some n > 2, then 4"
(ii} Find the smallest number A for which one can prove
(1 + ..!.22 . ) (1 + ..!.32. ) · · · (1 + _!_n2 ) <- A
(55)
1( + ..!.22 . ) (1 + ..!.32. ) · · (1 + _!_n2 ) -< A - n B+ 1
(56)
by using the following approach: The sharper estimate ·
6 The Induction Principle
139
with appropriate B > 0 can be verified by way of the principle 6.2 with the "division" condition (i) . first point out that the inequality (55) cannot be directly proven by induction, · since its left-hand side grows with increas ing n, while the right-hand side remains constant. We therefore consider the stronger inequality (56); condition (i) in 6.2 means that for each n > 2 we need
us
(
! )(
� )
!
This last inequality holds for each n > 2 if and only if A < B . This implies with (56) for n = 2 that A 2A 1 15/8. It is also clear that (56) with A = B = 15/8 holds for all n > 2; hence we may set A = 15/8 in (55) . Can we use this approach to determine whether (55) is true also for some A < 15/8? We note that when (55) holds for some integer n = p > 2, then it holds also for all preceding n = 2, 3, . . . , p - 1 . Therefore, it suffices to show that the stronger inequality (56) is true for all n > p, where p is a certain (arbitrarily large) number. This occurs if and only if A < B and
We can therefore set
( ..!.. ) (
) (
)
+1 1 · 1 ..!.. . · A=B= P + 2 1 + ..!.. 32 · · + p2 2 p We have thus shown that the estimate (55) holds with the constant A=P
; 1 ( 1 + ;2 ) (1 + ;2 ) (1 + �) , · · ·
(57)
where p > 2 is an arbitrary integer. If we denote the right-hand side of (57) by Ap, then it is easy to see that
[
.AzM-1 = 1 - (p
: 1)4 ] A,.
This means that the value of Ap decreases as p grows. Actual computations give , for instance, A2 = UV8 = 1.875, A 13 � 1.83828, and A3o � 1.83806.
2. Algebraic Inequalities
140
converges We finally remark that the sequence of numbers A2 , A3 , A4 , to a minimal value A that satisfies (55); this value is equal to the infinite •
product
(1 + _!_32 ) . . ( 1 + _!_n2 ) . . . (1 + _!_) 22 .
.
.
•
By means of complex analysis one can show that the value of this product is equal to the number (47r) - 1 ( e'��" - e -'��" ) � 1.83804 (compare this with D the value of A30 above) . ·
6. 5 Exercises (i) Eight fives and five eights are used to form the numbers
5
s·
8
5
Which one is larger? (ii) Show that if 0 < a < 1 and 0 < b < 1, then for each n > 1 we have (a + b - ab) n + ( 1 - an ) ( 1 - bn ) > 1 . (iii) Show that for each n > 1 we have 1 1 ... 1 < 25 . 1+ 1 + _2 1 + _ 2 n(n + 1) 1· ·3 To do this, replace the right-hand side by the expression B An+C with appropriate constants A, B , C. *(iv) Try to improve the upper bound in (54) in the form
(
< Q(n) -
)
) (
)(
Q(p)
(n > p), v'An + B where A and B are appropriate constants (depending on p). ( v) Show that for each n > 1 we have
(1 + D ( 1 + � ) · · ( 1 + � ) < 3. ·
2
* (vi) Let S(n) = 1 1 + 22 + · · · + nn Show that the inequality .
1 1 1 1 + + + · · > · nn S(n) S(n + 1) S(n + k) holds for arbitrary integers n > 2 and k > 0. (To do this, use the 2 k fact that the numbers ck = (1 + l) , where k = 1, , . . . , form an increasing sequence; see 3.4.(vi) and 3 .8.(iv) .)
141
6 The Induction Principle
6. 6 Induction on the Number of Variables We will now use the induction method to solve problems concerning > 0. As a rule one can de inequalities of the form > 0 from the preceding inequality rive an inequality > 0, where is some n-tuple, appropriately chosen and dependent on the given (n + 1)-tuple In the simplest case one can choose y 1 in more com plicated cases where the variables are dependent on each other through conditions that have to be satisfied, the chosen variables have to satisfy the same conditions. We will now consider five examples. (i) Suppose that the real numbers satisfy either the inequal > 0 (k = 1, 2, . . . , n) , or -1 < < 0 (k = 1 , 2, . . . , n) . Prove ities that (1 + )(1 + > 1+ + + + · (1 + (In the case a 1 we obtain Bernoulli 's inequality (17) .) = · · ·
, Q(x , x . , . . ) X 1 n 2 , , x . . . , Q(x ) X 1 n+l 2 Q(y�, Y2 , . . . , Yn ) y�, Y2 , . . . , Yn , , x�, x . . X . 2 = x�, x�, xY2 , =. . .x,2 , . . . , Yn = xn ; n+l· 2 Xn+l Yl , Y2 , . . . , Yn , , a�, a . . a . n 2 ak ak a 1 a2 ) . . an) a1 a2 . . an . = a2 = an ·
SOLUTION. Using the method of finite induction we show that for each
index k = 1 , 2, . . . , n we have
a2 )
a k ) > 1 + a 1 + a2 +
ak . (58) For k = 1, equality occurs in (58) . If (58) holds for some k < n, then upon multiplication of both sides by the nonnegative number 1 + ak+l we get (1 + a 1 ) (1 + a2 ) (1 + ak+l ) > (1 + a 1 + a2 + + a k )(1 + a k+l ) = 1 + a1 + a2 + + ak+l + bk , where bk a 1 a k+l + a2ak+l + + a k a k+l > 0, since by assumption the numbers aiak +l are nonnegative. Therefore, we have (1 + a 1 ) (1 + a2 ) (1 + ak+l ) > 1 + a 1 + a2 + + ak+ b (1 + a 1 )(1 +
· · ·
(1 +
· · ·
+
· · ·
· · ·
· · ·
=
all
· · ·
· · ·
· · ·
which completes the proof by induction . (ii) Suppose that
a�, a2 , a3 , . . . is a sequence of real numbers satisfying
0
(59)
for each n > 2. Show that for each n > 1 we have +···+ a1 + ------------� -> + +···+ n+1 n SOLUTION. We rewrite the inequality (60) in the equivalent form > (n + 1)(a2 + + · . . + n(a 1 + + · +
a3
a2n+l a2 a4
a3 . a2n+l ) .
a2n
a4
.
a2n) ·
(60)
1 42
2. Algebraic Inequalities
L(n) R(n) and prove it by induction. !or 2a n 1 L(n +L(1) a + a R(1), by (59) with n 2. The 1 3 2 1) - L(n) R(n + 1) - R(n), which is of the form We denote this inequality by = we have = > inequality
>
>
=
=
can be rewritten as
8(n) a1 -a2 + a3 - · · -a2n + a2n+l - (n + 2)a2n+2 + (n + 1)a2n+3 0 and will also be proved by induction. For n 0 we have S(O) a 1 - 2a2 + 0, by (59) with n 2. Since, again by (59) , a2n+5 2a2n+4 - a2n+3 , awe3 estimate the difference 8(n + 1) - S(n) as follows: 8(n + 1) - 8(n) (n + 2)a2n+5 - (n + 3)a2n+4 - na2n+3 + (n + 1)a2n+2 (n + 2)(2a2n+4 - a2n+3 ) - (n + 3)a2n+4 - na2n+3 + (n + 1)a2n+2 (n + 1)(a2n+4 - 2a2n+3 + a2n+2 ) · 0 By (59) the last term is nonnegative. Hence 8(n) 0 for all n 0 . 3, satisfy the (iii) Show that if the numbers a �, a2 , . . . , an E :JR+ , n inequality =
>
·
=
>
=
>
=
=
>
=
>
>
>
ai , ai , ak ( 1 < i < j < k < n) are side lengths of Since (61) for n 3 is actually identical with (35), the asser tion for n 3 follows from 5. 2.( i) . Now let n 3. In view of the symmetry it suffices to show that (61) is a consequence of the inequality (62) for arbitrary ab a2 , . . . , an+l E JR+ . If we set 8k af + a� + · · + a! for k 2 and k 4, then ( 62) can be rewritten as (82 +a;+ 1 ) 2 n(84 +a!+ 1 ), which is equivalent to ( ) 2 8 2 2 (n - 1) an+l - n 1 < n n 1 (82 ) 2 -n84 . (Here we have used the method of completing the squares.) If (62) holds, then the right-hand side of the last inequality is positive, and thus we have (82)2 (n - 1)84. But this, by the definition of 82 and 84 , is just the0 inequality (61). then any three numbers some triangle . SOLUTION.
=
>
=
=
=
=
_
>
_
>
·
143
6 The Induction Principle
and , , u U Ub n 2 V2 , . . . , Vn satisfy U1 > V1 , U1 + U2 > V1 + V2 , , U1 + U2 + · · · + Un > V1 + V2 + ' . . + Vn · Show that if X 1 > X2 > · · · > Xn > 0, then also
(iv) Suppose that the two n-tuples of real numbers
.
.
•
v� ,
.
•
•
SOLUTION. We show by finite induction that for k = 1, 2, . . . , n we have
u1 x 1
u1 1
> v1 x � , which follows from > v and For k = 1, (63) is of the form x > 0. We will now consider the question: Is it possible to derive (63) for a given k, 1 < k < n, from the inequality
1
U1Y1 + U2Y2 + . . . + Uk- 1Yk- 1 > V1Y1 + V2Y2 + . . + Vk- 1Yk- b (64) where Y1 > Y2 > · · · > Yk- 1 > 0 is an appropriate (k - 1)-tuple? To begin with, it is clear that we cannot choose Yi = Xj (1 < j < k - 1); this, in order to derive (63) from (64), would require UkX k > VkXk , which does not follow from the assumptions. However, we have ( u 1 + U2 + · · · + Uk ) X k > (v1 + V2 + · + Vk ) Xk · Now it suffices to note that we obtain (63) by adding this last inequality to (64) with Yi Xj -Xk (1 < j < k - 1) Since for these numbers we have > Y2 > > Yk- 1 > 0 (this follows from 1 > > · · · > Xk ) , the use Y1of (64) 0 justified, and the proof by induction is complete. (v) Show that if X I, . . , Xn E :JR+ and 1, then we have · · X n · · · Xn = 1 . X1 + X2 + · + Xn > n, with equality if and only if X1 SOLUTION. For n 1 the assertion is true. We assume that we have (n + 1) positive numbers , Xn+ 1 that satisfy X 1 X2 · Xn+ 1 1, and we assume further that the assertion holds for n . If we choose Y1 , X and Yn Xn Xn+ b then Y1 Y2 Yn = 1 , which X Y Y 1 -1 n n 2 2 ' means, by our assumption, that Y1 + Y2 + . . . + Yn = X1 + X2 + . . . + Xn- 1 + XnXn+1 > n. We have to show that 1 + + · · · + Xn+ 1 > n + 1. To this end, it clearly suffices to verify that Xn + Xn+ 1 > XnXn+ 1 + 1, that is, (xn - 1 ) (xn+ 1 - 1) < 0. This, in general, does not follow from the as sumption X 1 X2 · Xn+l = 1 alone; however, in view of symmetry we can order the numbers X 1 , . . . , Xn+l in advance such that Xn < Xi < Xn+l .
· ·
=
.
x
· · ·
is
x2 ,
·
x1x 2 •
.
x2
=
= X2 =
·
=
=
x� , x2 ,
•
.
.
·
·
=
=
x� ,
=
•
.
=
•
=
x
•
·
x2 ,
x2
•
•
.
144
2. Algebraic Inequalities
n+1 X1X2 · · · Xn+1 (xn+1 )n+1 , 1 , 2, . 1 -1 . (x ) n Xxn+1+, x + · · · + (x>n - +1)(x1; n+1 - 1) Xn X 1 1 n + 2 X 1 X · · · = X·n·-1· ==X XnXn=+1.1 = 1 (xn - 1)(xn+1 - 1) 1 n+ l Remark. 8. 8.1
< for i = < ,n Then we have < 0. This < < that is, which implies equality means that proves the inequality n 0, which = X2 = and 0 implies = X2 = The result of (v) follows immediately from the so-called AM Since that GM inequality, which will be studied in detail in Section inequality is homogeneous, we make use of the opposite direction: The will be based on the above result proof of the AM-GM inequality in of (v) . .
.
=
6. 7 Exercises (i) Show that for each n
> 2 we have (1 - ..!.22 . ) ( 1 - ..!..23 ) . . . (1 - _.!._2n ) > !2 . (ii) Suppose that the sequence of real numbers x�, x2 , X3 , . . . satisfies 1 1 + x2 + · + xn ) Xn+1 > -(x n for each n > 1. Show that for all n > 1 we have X1 + 2x2 + · · · + nxn > n +2 1 (x1 + X2 + · · · + Xn ) . (iii} Suppose that the sequence of real numbers x�, x2 , X3 , . . . is nonde creasing, that is, Xn+ 1 > Xn for each n > 1. Show that for all n > 1 we have the inequality n(x1 + 2x2 + 4x3 + · · + 2n- 1xn) > (2n - 1)(x1 + X2 + · · + Xn) . (iv) Suppose that the sequence of real numbers a�, a2 , a3 , . . . satisfies the inequality an+ 1 · an- 1 > a; for each n > 2. Show that if we set bb;n =holdsy'a1aas2well. · · an, then for each n > 2 the inequality bn+1 · bn- 1 > *(v) Suppose that the two n-tuples of positive numbers a 1 > a2 > · · · > aan +aand b1 > b2 >> · > bn satisfy a 1 > b�, a1 + a2 > b1 + b2 , . . . , that for each k E N we 1have af2 ++· a�· · +a+ ·n· · +ba!1 +b>2bf+ +· b�+b+n . Show b + · · · !. (vi) Use a method similar to 6.6.(v) to show that if the positive numbers x�, x2 , . . . , Xn satisfy X1 + X2 + · + Xn = n, then X1 X2 · · · Xn < 1. (vii} Show that if n > 4, then all x�, x2 , . . . , Xn E JRt satisfy (x1 + X2 + · · + Xn) 2 > 4(X1X2 + X2X3 + · · · + XnX1 ) · * (viii) Show that if a 1 , a2 , . . . , an E N are distinct, then (ai + · · · +a�) + (a� + · · · + a�) > 2(a� + · + a�) 2 . ·
·
·
·
·
·
·
·
·
·
·
·
·
·
7 Chebyshev's Inequality
7
145
Chebyshev's Inequality
7. 1
Estimating a Sum Using Permutations We will be concerned with the following problem: Given two n-tuples of real numbers x 1 , x2 , , and y� , y2 , , find the smallest and the largest value of the sum (65) is an arbitrary ordering of the numbers y� , y2 , , where z�, z2 , . . . A special case of this problem is the following situation: On a table there are four piles of coins, a pile each of one-crown, two-crown, five-crown, and ten-crown coins. From two piles you may take eight coins each, from the next one five, and from the last one three coins. How will you decide? Obviously, it will be convenient to first order both the given n-tuples and Let us therefore assume that x 1 < x2 < · · < and < Y2 < First we show that for each k = 1, 2, . . . , n the inequality · ·< (66) < + X2 Y2 + · · + X1 Z 1 + X2 Z2 + · · · + •
•
•
Xn
.
.
•
Yn ,
, Zn
.
. Yi · Yn ·
·
, Zk
Xn
Yl
.
•
Yn· Xj
· XkYk
XkZk Xl Yl
holds, where z� , z2 , . . . is an arbitrary ordering of the numbers also, equality occurs in (66) if and only if the condition y�, y2 , • . . (67) is . satisfied. The reader should carefully consider what the condition ( 67) means; it may be surprising that equality in (66) can also occur for a k tuple z�, z2 , different from the one for which z1 < z2 < · · < that is, = (1 < i < k ) . Note, however, that in the case where x = for some i =I= j , switching the numbers and does not change the value of the left-hand side of (66) . We prove the inequality (66) by finite induction. The case k = 1 is trivial. Let us now assume that the assertion holds for some k < n; we will show that for an arbitrary ordering z1 , z2 , . . of the numbers we have the inequality < X 1Y1 + X2 Y2 + · · + (68) X 1 Z1 + X2 Z2 + · · + is an ordering of the numbers then z� , z2 , . . . If = hence the inequality (66) follows, and upon adding y1 , y2 , • . • does not hold, then = we obtain (68) . If = < the ordering and = for some i < k. We denote by zf, z�, • . . by switching the terms and that is obtained from z� , z2 , • . . Obviously, - (x 1 z1 + · · + (x 1 z� + + = + + = > 0,
, Yk ;
, Z . . . k Zi Yi
· Zk , i Xj
Zi Zj
, Zk+l Yl , Y2 , , Yk+l · Xk+l Yk+l · Xk+l Zk+l , Zk Zk+l , ; Yk+b X Z Yk k k l +l + Z Z + Xk l Yk+l Z k+l Yk+l k Yk +l +l , z � Yk+l i +l Zi Zk+l· , Zk+I · Xk+l Zk+I ) · · · Xk+l Z�+l ) (Xi Zk+l Xk+l Yk+l ) - (XiYk+l Xk+l Zk+l ) (xk+l - Xi)(Yk+l - Zk+l ) .
•
.
•
•
146
2. Algebraic Inequalities
Xk+1 > xi and Yk+1 > Zk+1 ; to prove (68), it therefore suffices to
since verify that
(69)
Yk+1
z�, z2, . z/c . , . 1 + z/c+1 Yk+b
Xi Xk+1
Zk+1 Yk+1 ) ·
Y1, Y2 , · · · '
is the ordering of the numbers However, since for which the inequality (69) has already been proven. Through an easy examination of our approach we can verify the truth of criterion (67) for equality in (66); in the process it is determined that the left-hand side of (69) is larger than the left-hand side of (68) as long as (since This proves (66) for all k 1 , 2, . , n. < < To obtain a lower bound =
.
=
.
is some ordering of the numbers Z , z , . z . , . 1 n 2 an ordering of the 1 , - z2 , . . . ,by-Zthe n isprevious Y1 Y2 -y· n· · -YYnn 1 · · · -Y1-· zTherefore, discussion X1 ( - zl ) + x2 ( -z2 ) + · · · +xn ( - zn ) < X1 ( -yn ) +x2 ( -Yn- 1 ) + · · · +xn ( -y1),
we now use a simple trick; < < < if and only if < < < numbers we have
which is just (70); furthermore, equality occurs in (70)
if
and only if
(71) (1 < i < j < n) . We note that the conditions (67) and (71) are formulated in such a way
x1 , x2 , . . . , Xn
that for their verification in specific situations the n-tuple need not be previously ordered. To summarize everything concisely (Theorem 7 .3), we need the following definition. 7. 2
Orderings Definition. We say that the two n-tuples and of real numbers have the same ordering, respo the opposite ordering if
u�, u2 , . . . , Un v�, v2 , . . . , Vn
( 1 < i < n, 1 < j < n) , respectively
(1 < i < n, 1 < j < n) o
u�, u , . . . , and v�, v2 , . . . , Vn have U n 2 the same ordering does not necessarily mean that the n-tuples u 1 , u2 , . un have opposite orderings-consider, for instance, the and Vn , Vn- b v 1 quadruples 1, 1, 2, 3 and 2, 1, 3, 4. However, such a conclusion is true for instance, the numbers u�, u2 , , Un are distinct.) ( Caution. The fact that the n-tuples
0
0
0
0
.
,
,
0
0
0
if,
7 Chebyshev's Inequality
147
7. 3 Extremal Values of a Sum
be two n-tuples of real , . . . , Let and y�, y , . x�, x . , . Y X n n 2 2 numbers. , is an 1 where z�, z z Z The x + X sum S = x + + z n n 1 1 2 2 2 arbitrary , . . . , 1 is maximal, resp. minimal, , y ordering of the numbers y Y 1 n 2 if x1 , x2 , . . . , Xn and z�, z2 , . . . , Zn have the same, resp. opposite, orderings. Inordering, particular, if the n-tuples Xi, x2 , . . . , Xn and Yl , y2 , . . . , Yn have the same , have and at the same time x�, , . . . , and x . . , X b . Y Y Y n n n l 2 opposite orderings, then each of the n! sums S satisfies the inequalities X1Yn + X2Yn- l + · + XnYl < 8 < X1Y1 + X2Y2 + · · + XnYn · (72)
Theorem.
. . . , Zn
· · ·
· ·
·
The proof was already carried out in Section 7.1.
7.4 Examples The above theorem will be applied in the following two examples. (i) Show that for arbitrary numbers E the inequality
a�, a2 , . . . , an , p :JR+ aia2 + a�a3 + · + a:_ 1 an + a�a1 < af+1 + a�+l + + a�+l (73) holds, with equality if and only a 1 = a2 an SOLUTION. For p > 0 the n-tuples a�,a2 , . . . ,an and af,a�, . . . ,a� have the same ordering, by 1.10. Then by Theorem 7.3 the ordering a2 , a3 , . . . , an , ai satisfies ai · a2 + a� · a3 + · · · + a� · a1 < ai · a1 + a� · a2 + . . · + a� · an , and this is (73) . Here we obtain equality only in the case where the n tuples a�, a2 , . . . , an and a2 , a3 , . . . , an , a 1 have the same ordering. Let us assume that this is the case and that we do not at the same time have if we set M = max( a�, a2 , . . . , an ), then there exist aindices an ; that 1 = a2i =and· · ·j such < ai = M and ai+l < ai = M, where a i l athat an and an+l = a 1 . The inequality (ai- l - aj)(ai - ai+ d < 0 means o = the and a2 , a3 , . . . , an , a 1 do not have original n-tuples a�, a2 , 0 the same ordering, and this is a contradiction . (ii) Show that for arbitrary a, b, c E JR+ we have 2 2 2 t? t? + a2 b + b + a < a + b + c 2c + 2a + 2b SOLUTION. By 1 .9 and 1.10, the triples (a2 ,b2 , t? ) and (�, z, �) have opposite orderings, and thus Theorem 7.3 gives the inequalities a2 . .!a + b2 . .!b + c2 . .!c < a2 . .!b + b2 . .!c + c2 . .!a a2 . .!a + b2 . .!b + . .!c < a2 . .!c + b2 . .!a + c2 . !b . · ·
· · ·
if
=
. . . , an
C2
= · · · =
.
148
2 . Algebraic Inequalities
If we add these two inequalities and then divide by two, we obtain the D desired inequality. 7. 5 I?xercises (i) Show that if
a�, a2 , . .. , an , p E JR+ , then the inequality a1 + a2 + . . . + an- 1 + an a'f- 1 + a�- 1 + . . . a:- 1 (74) an a 1 a 2 a3 holds, with equality if and only if a 1 = a2 = · · · = an· (ii) Give a new prdof of the result of 6.6. (v): If x 1 , x2 , . . . , Xn E JR+ and = 1, then x1 + x2 + + Xn n, with the exception of x x X 1 n 2 the case x 1 = x2 1. (Hint: Use (74) with p = 1 and an = = X n appropriate n-tuple a b a2 , . . . , an .) (iii) Show that for arbitrary a, b, c E JR+ we have a2 + b2 + b2 + + + a2 < a3 + b3 + · 2a 2b be ac ab 2c if
p
p
p
p
+
>
· ··
·· ·
= ·· ·
c3
c2
c2
7. 6
>
Chebyshev 's Inequality
numbers real of n-tuples ordered two given e we that Suppose ar X1 < X2 < < Xn and Yl < Y2 < < Yn . Set Bmin = X1Yn + X2Yn- l + · · + XnYl , (75) Bmax = X1 Yl + X2Y2 + · · · + XnYn (this notation is consistent with Theorem 7.9). Then the inequalities nSmin < (xl + X2 + . + Xn)( Yl + Y2 + . . . + Yn) < nBmax (76) (76} occurring only simul of parts left and right the in equality with hold, taneously, and if and only if x1 = x2 = · = Xn or Y1 = Y2 = · = Yn .
Theorem.
···
· ··
·
. .
· ·
PROOF.
· ·
By Theorem 7.3 and definition (75) we have
Bmax = X1Y1 + X2Y2 + · · · + XnYn, Bmax X1Y2 + X2Y3 + · + XnYl , Bmax X!Y3 + X2 Y4 + + XnY2 , Bmax X1Yn + X2Y1 + + XnYn- 1 · >
· ·
>
· ··
>
···
Adding all the relations in (77) , we obtain
nBmax (xl + X2 + · + Xn )(Yl + Y2 + · + Yn ), >
·
·
·
·
(77)
7 Chebyshev's Inequality
149
and this is the right-hand part of (76) . The left part of (76) can be proved in a similar way. If equality holds, for example in the left part of (76) , then we have equality everywhere in (77). Let us assume that does not hold, that is, that < Then according to 7.1 the equalities in (77) mean that < < < which implies > > > However, by the theorem's hypothesis we have < < · · < thus 0 and the proof is complete.
x = = · X · 1 2 ·, x X 1 n , . , , 1 Y . . Y Yl Y Y Y1 n Y n 3 2 2 ·· · Yn · · Y Y1 2 Y1 = Y2 · · · = Yn ,
·
= Xn Y2Y , n
=
7. 7 Example We now consider a typical instance of the use of Chebyshev 's inequality: We will prove that arbitrary positive numbers b, c satisfy the inequalities
a,
(78)
and (79)
a = = c. ( ) n a a n n= = x 2 , 1 = b2 a-=1 . ( a)3 , = 1 = a X2 , X3 nY1= x1 =Y2a4 , x = YX3 == cl;c4, 3 2 1 1 xb x2 , x3 Y3 = a • Y1Y1 , =Y c, Y , Y2 = 2 3 ( (
with equality in both 78 and (79) if and only if b In view of the symmetry we may assume that 0 < < b < c. Then clearly < bn < d"' for 2, 3, 4, and c- < b- 1 < Hence 78 is the right part of (76) with 3, c? , l,S, and similarly, (79) is the left part of (76) with 3, b4 , In both cases the triples and b- 1 , and have the same ordering. This completes the proof. Further consequences of Chebyshev's inequality will be derived in the following exercises. Especially the result of v) deserves some attention; it is an interesting generalization of Cauchy's inequtlity 48). =
7. 8 Exercises ( i) Another proof of Chebyshev1s inequality: Show that the expression
n(X 1Y1 + x2Y2 + · · + Xn Yn) - (x 1 + X2 + · +xn )(Y1 + Y2 + · · · + Yn ) can be written as the sum 1 n Bij, 2 iE ,j=1 where = (xi - Xj )( Yi - Yi ) · (ii) Show that the inequality (46 ) is a consequence of Chebyshev ' s ·
Bij
inequality.
·
·
150
2. Algebraic Inequalities
(iii) How can inequalities (78) and (79) be generalized? (iv ) Show that for eacfl integer we have the inequality
n>2 1 2 + 3 + · · · +-n > n+ 1 ( -+ 1 1 + 1 + · · · + 11· ) . -+ n n- 1 n-2 1 2 n n-1 n-2 (v) Show that for a 1 , a2 , . . . , an E JRt and each integer k > 2 the strict inequality (a 1 + a2 + · · + an ) k < nk- 1 (ak1 + a2k + · · · + ank ) (80) holds, with the exception of the case a 1 = a2 = · · · = an · (vi) Show that for arbitrary a 1 , a2 , . . . , an E IR+ we have (a 1 + . . . + an ) (a 1 + . . . + an ) < (a51 . . . + an5 ) ( a1l + . . . + a1n ) . (vii) Show that the result of 6. 7.(iii) is a certain Chebyshev inequality. (viii) Suppose that the numbers x, y E satisfy xy + 1 > x + y . Show that for each integer > 1 we have the inequality (n - 1 )xy + 1 > (n - 1)2 xy + (nn- 1)(x + y) + 1 . (ix) Show that if 0 < ai1 < ai2 < · · · < ain (1 < j < k), then ·
+
3
3
n
Ill
(x) Show that the inequality
(x1 +x2 + · · · +xn )(Yl + Y2 + · · · + Yn ) < n (x 1Y1 +x2Y2 + · · · +xnYn) holds also in more general situations than in 7.6: The inequality Yi < holds for any indices i,j E {1, 2, . . . , n} for which Xi < A < Xj , Yiwhere A = (x 1 + X2 + · · · + Xn) fn.
8
Inequalities Between Means
mean value in many different situations; in arithmetic mean of the values x1 , x2 , . . . , Xn ,
We encounter the term most cases it refers to the determined by the relation
(8 1)
8 Inequalities Between Means
151
However, there are also other kinds of means; the best known among them is the of nonnegative numbers which is defined by
geometric mean
x1 , x2 , . . . , Xn , 9n (Xl , X2 , · · · , Xn ) = ytx1X2 · · · Xn .
(82)
Between the various kinds of means there are inequalities that can be successfully used to solve a variety of problems. Especially the inequal ity between the arithmetic and geometric mean, more concisely known as the AM-GM is among the most important results of the entire theory of inequalities, with numerous applications (see A gener alization of the AM-GM inequality to the case of will be discussed and applied in Sections the remaining sections are then devoted to the theory of with arbitrary real degrees.
inequality,
8 5) 8.1 . weighted means.
6 8. 8. 9 ; power means
8. 1
The AM-GM Inequality
For arbitmry numbers a1 , a2 , . . . , an E JRt the inequality a l + a2 + . . . + an .y a-(83) 1a2 · · · an n holds, with equality if and only if a1 a2 = · ·· = an . PROOF . If a k = 0 for some k = 1 , 2, . . . , n, then the statement is clear, since the right-hand side of (83) vanishes. Let therefore a k 0, 1 < k < n. Since the inequality (83) is homogeneous (see 2. 7) , the n-tuple a 1 , a2 , . . . , an can be normalized such that a 1 a2 · · ·an = 1 . But then the assertion (83) is identical with the result that was derived in Section 6.6.(v) . This completes Theorem.
-------
> �,,-
_
-
=
>
0 the proof of the AM-GM inequality. Other proofs of follow from the results of 3.4.(iv) and 6.7.(vi). The significance of the inequality has stimulated the interest of mathematicians in finding proofs by different approaches and different methods see, e.g. ,
Remark. (
(83)
(83)
[1], [3]).
8. 2 Applications of the AM-GM Inequality The proofs of numerous inequalities follow from comparing the sum and the product of appropriate n-tuples of numbers, such as in the AM-GM In some situations (examples (i) - (vii)) we require a inequality
(83). lower bound for the sum A1 + A2 + . . · + An n y'A1 A2 . . · An , (84) while in others (examples (viii) -(xi)) we need an upper bound for the product (85) >
·
152
2. Algebraic Inequalities
We emphasize that the inequalities (84) and (85) hold for an arbitrary n tuple of nonnegative numbers with equality if and only if the numbers are all equal. We have already seen the significance of (84) and (85) for n = 2 in Sections 4.3 and 4. 5. (i) Show that if 0, then 0, and that this inequality is sharp when 1=
, A , A , , A 1 n 2 A1 , A2 , . . . , An > all -3a5 + a4 + 1 > a a 1. SOLUTION. By (84) , the triple of numbers a ll , a4 , 1 satisfies all + a4 + 1 > 3 -?'a ll · a4 1 = 3a5 , and equality occurs and only if a ll = a4 = 1, that is, a = 1. This implies 0 the assertion. .
.
•
·
•
if
a > 0 and for each integer n > 1 we have a2 n 2n < 1 · 1 + a + a + · + a 2n + 1 SoLUTION. By (84) the numbers 1, a, a2 , , a2n satisfy 1 + a + a2 + · + a2n > (2n + 1) · 2n+�1 · a2 · a2n = (2n + 1) · 2n+\lan (2n+l) = (2n + 1)an , (ii) Show that for each
· ·
•
·
•
.
·
·
·
0
which is equivalent to the desired inequality.
2b2t? + p a ab + be+ pabc a, b, e SOLUTION. If we set a = b = e = 1, we obtain the condition p < 4. On the other hand, by (84) the four numbers a2 b2 t? , ab, be, satisfy a2b2 e2 + ab + be+ > 4 · �a2b2e2abbcca = 4abc. (iii) Determine the largest value E 1R for which the inequality holds for arbitrary numbers E IR+. ca > ca
ca
0
Hence the desired largest value of p is equal to 4.
b
(iv) Show that if 0 < < a, then we have the inequality
a + (a � b)b > 3'
SOLUTION. By (84) , applied to the number triple we have
b, a-b, and [(a-b)b] - 1 ,
a + (a � b)b = b + (a - b) + (a � b} b > 3 . 3 b(a - b) . (a � b} b = 3.
D
8 Inequalities Between Means
153
a > 0 satisfies the inequality a4 + 9 > 4 · lOa 5 SOLUTION. We apply (84) with an appropriate quadruple of numbers: a4 + 9 = a3 + 3 + 3 + 3 > 4 · a3 · 3 · 3 3 = 2 · lOa 10 lOa lOa lOa 10 lOa lOa lOa 5 {/27. 0 Now it suffices to note that {127 > 2, since 27 > 16 24 • (vi) Show that a , b E JR+ , then 3a3 + 7b3 > 9ab2 • SOLUTION. The term ab2 on the right is the geometric mean of the three numbers a3 , b3 , b3 • We therefore try to use the estimate (v)
Show that each
·
4
=
if
7 + PbP P P1 · 2 2 3 {/3P1P2 > 9, 3 P1P2 > 9. Pl P2 . (86) Pl P2 · (vii) Show that for any a, b, c E JRt we have the inequality 2(a + b + c)(a2 + b2 + �) > a3 + b3 + c3 + 15abc. SOLUTION. Upon expanding the left-hand side and subtracting the sum a3 + b3 + from both sides of the inequalitY we obtain a3 + b3 + c3 + 2(a2b + a2 c + b2a b2c + c2a + c2b) > 15abc. The left-hand side L of this last inequality is a sum of 3 + 2 · 6 = 15 terms; by (84) we have L > 15 · 1{!a3 b3 c3(a2 b) 2 (a 2 c) 2 (b2 a) 2 (b2 c) 2 (c2 a) 2 (c2 b) 2 = 15abc. 0 (viii) Prove the inequality 1 · 3 · 5 · (2n - 1) nn for all n > 1 . SOLUTION. Applying (85) to the numbers 1, 3, 5, . . . , 2n - 1, we obtain 1 . 3 . 5 . . . (2n - 1) [ 1 + 3 + 5 + � + (2n - 1) r = c:: r = n" ' since 1 + 3 + 5 + · · + (2n - 1) = n2 (see Chapter 1, Section 2). 0
< for appropriate positive numbers We require that and that is, We easily see that both conditions are satisfied by = = This solves the problem. It is left to the reader to D explain why the estimate is �'most valuable" in the case = ·
e
+
·
<
·
<
·
.
154
2. Algebraic Inequalities
(ix) Show that if 0 < b < 2a, then 16b(2a - b) 3 < 27a4 • SOLUTION. We use (85) with the four numbers 3b, 2a -b, 2a -b, 2a - b (the coefficient 3 of b is chosen such that the sum of all 4 numbers is independent
of b) :
which, upon multiplying by 16/3, gives the desired inequality.
=
0
(x) Find the largest value of the expression V (a - x) ( b - y) (ex + dy), where a, b, c, d E IR+ are given numbers, and the real variables x and y satisfy x < a, y < b and ex + dy > 0. SOLUTION. The expression V is the product of the three terms in paren theses, whose sum, however, is not generally constant. But we have c(a - x) + d(b - y) + (ex + dy) ac + bd; hence we apply (85) with the three numbers c(a - x) , d(b - y) , (ex + dy) : ac + bd 3 cdV c(a - x)d(b - y) (ex + dy) < 3 This gives the bound (ac + bd) 3 , (87) V < - 27cd with equality ifand only if c(a-x) d(b-y) ex+dy; an easy computation gives 2ac - bd 2bd - ac and y x 3d 3c The reader should verify that these values are admissible. The number on 0 the right-hand side of (87) is therefore the largest value of V.
=
=
(
=
=
)
·
= =
:: ----:-
(xi} Show that for each k E N we have the inequality
( )
1 1 . 2 2 . 33 . . k k > k ; 1 .
SoLUTION. We consider the system of the nk
k(k+l)
2
•
= � (k2 + k) numbers
(88)
1 1 1 1, ! ' ! ' ! ' ' ' 1 ' 1 ' 2 2' 3 3 3 ' " k k ' ' ' ' k' Since their sum is equal to k, by (85) we have 2 1 . _!_ . _!_ . _.!_k < 2 2 33 k - nk k+1 By writing down the opposite inequality for the reciprocals, we obtain the o inequality (88). . .
( �) n"' = ( ) n"'
·
8 Inequalities Between Means
155
8. 3 Exercises Using (84) , prove the inequalities (i)- (vii) , where a, b, c E :JR+ :
a4 + a3 - 8a2 + 4a + 4 > 0. a2 (b + c) + b2 (c + a) + c2 (a + b) a4 + 2a3 b + 2ab3 + b4 > 6a2 b2 . 2 vfci + 3 · {/b > 5 · {lab. a3 ; b6 > 2 (v) 3ab - 4.
(i} (ii) (iii) (iv}
;
>
6abc.
> 3. (vi) a + a .!!.±.! (vn•• } an - 1 > n a - a-2- , if a > 1 and n E N.
(
2
n-1)
Using (85) , prove the inequalities (viii)-(xv) , where a, b, c, d k, m E N: a + 2b � 3c + 4d ) (viii) ab2
(ix) (x) (xi) (xii) (xiii)
E
:JR+ and
10 .
(k2 + 3k) (k2 + 5k + 6) k+2 < (k2 + 5k + 4) k+3 • 27a2 b < 4(a + b) 3 • 432ab2c3 < (a + b + c) 6 • (1 - a) 5 (1 + a) (l + 2a) 2 < 1. (b - a) k (b + ka) < bk+ l , if a < b.
(xiv) (xv) (xvi) Show that for arbitrary a�, a2 , . . . , ak E :JRt we have
8.4 Further Applications of the AM- GM Inequality In order to solve the following problems, whic� are somewhat more difficult than those in 8.2, we will usually have to apply the AM-GM inequality several times over. For clarity we will use the symbols An and gn for the two means introduced in (81) and (82). It is important that the reader be well acquainted with these symbols, for instance through verifying the
2. Algebraic Inequalities
156
ak , bk , c E JRt) : a1 + a2 + · · · + an = · An (aba2 , . . . ,an ), a1 a2 · · ·an = Qn (a�,a�, . . . ,a�) , An (cab . . . ,can) = C· An (ab . . . ,an), Qn (cab . . . , can) = c · Qn (ab . . . , an ), Qn (ab . . . , an ) Qn (bb · · · , bn) = Qn (al bb · , anbn), 1 . . , _!_) = gn (_!_, a1 an gn (a1 , . . . ,an) (ak > 0, 1 < k <
following relations (which hold for arbitrary n
·.
.
)
n .
These will be used repeatedly in the solutions to the problems below. We also remark that the lower index n with the symbols and helps avoid misunderstandings in some ambiguous expressions of the type In this example we are dealing with the arithmetic mean of n numbers: the number and n - i numbers equal to (i) Show that for arbitrary E JRt we have the inequality
An (a, b, b, . . . , b).
A
g
b. a a, b, c (a + b + c)(a2 + b2 + c2 ) > 9abc.
SoLUTION. We prove the statement as follows: L=
9Aa (a, b, c) A3 (a2 , b2 , c2) > 9Q3 (a,3b, 3c) Q33 (a2 , b2 , c2 ) 9Q3 (a , b , c ) 9abc = R. =
=
9
A different proof follows from the AM-GM inequality applied to the numbers that are obtained by multiplying out the left-hand side of the 0 given inequality. (ii) Tlie follows:
harmonic mean
of the numbers
a1 , a2 , . . . , an E IR+ is defined (89)
as
Show that the harmonic and geometric means satisfy the inequality
'Hn (ab a2 , . . . , an ) < Qn (a l , a2 , . . . , an ), (90) with equality if and only if a 1 a2 = · · = an . SOLUTION. By definition (89) and by the AM-GM inequality we have ·
=
with equality if and only if ... . =
an
1/al I/a2 · · · 1/an , that is, a1 a2 =
=
=
=
=
8 Inequalities Between Means
1 57
(83)
and (90) we obtain an inequality between As a consequence of the ¥ithmetic and the harmonic means; this also follows from the inequality 46). 0
(
a, b, E JRt we have �+ �+ -Vca - 1 32 (a + b + )
(iii) Show that for arbitrary
c
<
c .
SOLUTION. The desired inequality is the sum of the three inequalities {t'ab In
_
1 - _a_+_b , 3 3 <
and -Vca 3
- 31 c+a 3 . <
view of symmetry it suffices to prove the first one of these,
1, v ao Q3 (a, b, 1) A3 (a, b, 1) = a+b+ 3 s�
and subtract
i.
=
<
0
a1 , a2 , . . . , an E JR.+ we have 2 n S S S -> +· + --- + s - a 1 S - a2 · · S - an - n - 1 ' where n > 2 and S = a 1 + a2 + · · · + an . (iv) Show that for arbitrary
SOLUTION. To obtain a lower bound for the left-hand side, we apply the AM-GM inequality twice: L
= n . ( S -S al , . . . , S -San ) n(in ( S -S al , . . . , S -San ) nS . gn ( S -1 a1 , . . . , S -1 an ) Qn (S - a1nS, . . . , S - an ) n2 S nS ----= ( S - a� , . . . , S - an ) ( S - a1 ) + · · + (S - an) >
An
=
=
> - An
n2 S n2 n2 S 0 nS - (a1 + · · · +an ) nS - S n - 1 ( ) Suppose that the numbers x�, x2 , . . , xn are all greater than -1 , and that their sum is equal to zero. Prove the inequality X l + X2 + · · + Xn < 0. --X l + 1 X2 + 1 · Xn + 1 v
·
.
158
2. Algebraic Inequalities
SOLUTION. After rewriting the right-hand side we apply the AM-GM inequality twice:
L (X 1X+1 +1) 1- 1 + . . . + (XnX+n +1)1- 1 = n ( X1 1+ 1 + . . . + Xn 1+ � ) = n - n · ( x1 � 1 ' · · Xn � 1 ) n - n . gn ( X1 � 1 ' · · . ' Xn � 1 ) n -------:n - Qn (x 1 + 1 ,n. . . ,Xn + 1) - n - -An,-(x1 + 1 , . . . ,Xn + 1) - n - (x1 + 1) + ·n·2· + (xn + 1) = n - (x1 + · · n+2 Xn ) + n 2 n n - O +n 0 (vi) Show that for each integer n > 2 we have the inequality 1 + !.2 + !.3 + · · + .!n > n( v'n + 1 - 1). SoLUTION . If we denote the left-hand side by Ln , then Ln +n = (1 + 1) + G + 1) + G + 1 ) + · · · + G + 1 ) = 21 + 32 + 34 + · · · + n+n 1 = n A ( 21 ' 32 ' . . . ' n+n 1 ) 2 3 n+1 (n + 1)! n · n + 1 , > nQn ( l ' 2 , . . . , n ) = n · n! 0 which, after subtracting the number n , gives the desired inequality. _
=
.4,
·
<
'
<
=
·
=
=
0
.
·
.Mn n
=
v
Qn(ab a2 , · . · ,an) + Qn (bb � ' . · . bn ) Qn (a 1 + bb a2 + b2 , . . . , an + b(91) n) · Furthermore, determine when equality occurs in (91). SOLUTION. Dividing by the right-hand side, we rewrite (91) follows: <
,
as
which is the sum of the two AM-GM inequalities
�n ( a 1 a+1 b1 ' ' ana+n bn ) - -n1 ( a1 a+1 b1 + . . . + an a+n bn )
11
•· •
<
---
8 Inequalities Between Means
159
and
(91) holds, with equality if and only if a2 an + bn and a2 + b2 tbk (1 b that is, ak which means that a 1 /b1 /b a a f , · n n 2 2 n) for anintoappropriate t > 0. It is easy to verify (for instance by direct ksubstitution (91)) that this last condition for equality in (91) is also Hence
--- = · · · = ---
= ·
=
<
· =
=
<
0
sufficient.
Remark. It is easy to verify that if we replace the symbol gn everywhere in (91) by An , then we obtain a trivial equality. This fact has an interesting "dual" : The inequality a1 , a2 , . . . , an
holds by Chebyshev's inequality (76) in 7 . 6 if the n-tuples and �, . . have the same ordering; if the n-tuples have opposite orderings, then the opposite inequality holds. H we replace the symbol An in this inequality by we get again a trivial equality.
b1 ,
. , bn
Qn ,
a1 7 a2 , . . . , an is equal
(viii) Suppose that the sum of the positive numbers
to
1. Prove the inequality
SOLUTION.
k 1 , 2, . . , n we have by the AM-GM inequality 1 + a1k (n + 1 )An.+l (1 , na1 k , na1 k , . . , na1 k ) ( 1 1 . ., 1 ) > (n + 1 ) Qn+l 1 , nak nak nak
For each -
=
=
.
-
-�
.
-
-
,
.
-
-
.
Multiplying these inequalities, we obtain
1 n (na2 )n · (nan )n (na ) 1 ) a a . . , , . Qan1 ,(ab n 2 a2 , . . . , an , a1 + a2 + · · · +an 1 .
< The proof is complete if we verify the inequality < � · But this is the AM-GM which is equivalent to D inequality for the n-tuple = since
1,
·
·
160
Inequalities
2. Algebraic
(n > 2) have the . a a . a . , , b n 2 following property: If their sum is denoted by S, i.e., S = a 1 + a2 + · · + an , then the numbers bk = S - (n - 1 )a k , 1 < k < n, are nonnegative as well. Prove the inequality a a an > b1 b2 bn .
(ix) Suppose that the nonnegative numbers 1 2· ··
SOLUTION.
·
·
·
·
First we note that
b2 + b3 + + bn = [S - (n - 1)a 2 ] + [S - (n - 1 )a 3 ] + + [S - (n - 1)an ] = (n - 1)S - (n - 1)(a2 + a3 + · · · + an ) = (n - 1)(S - a2 - a3 - · · · - a n ) = (n - 1)a 1 · Hence the AM-GM inequality for the (n - 1) numbers b2 , b3 , . . , bn can be written bn a 1 > n -{jb2 b3 Similarly, we have ak > Qn- 1 (b b . . . , bk - b bk+ b . . . , bn ) for k = 2, 3, . . . , n . Multiplying these n inequalities together, we obtain 0 a a2 an > n-{jbn-1 1 bn-2 1 bnn- 1 - b1 b2 bn ·
·
·
·
·
·
.
as
.
1
·
·
·
. .
.
•·•
_
·
·
·
·
(x) Show that for each n E N we have the inequality
.
J2 . {14 � . . . 2V'2n < n +
SOLUTION.
1.
We rewrite the left-hand side as one root:
2n . 42n-2 . g2n-3 . . . (2n- 1 ) 21 (2n ) 20 . Underneath the radical sign we have the product of 2n - 1 numbers: 2n -l times the number 2, 2n- 2 times 4, . . . , 2 times the number 2n - 1 , and once the number 2n . If we take the additional factor 1 , the product will not change. The root in question is then the geometric mean of this 2 n-tuple; 2\j2 - l
.
by the AM-GM inequality it is then at most equal to
1 (2n- 1 2 + 2n2n ·
2
·4
+·
·
·
1
1)
+ 2 2n- l + 2 n + 1) = (n2 n + n 2 1 = n + n < n + l. 2 ·
However, it is possible to prove a sharper bound without the use of the AM-GM inequality:
2
� . .w . {IS . . 2V'2n = 2 !+�+i+···+ :IA- = 2 - "2il < 4 , .
where the sum in the exponent was determined in Chapter 2.37.
1, Example 0
8
Inequalities Between Means
161
8. 5 Exercises
(i) (ii) (iii)
ab a2 , . . . , an JRt we have the inequality (a1 + a2 + · · · + an )(a�-1 + a�- 1 + · · · + a:- 1 ) > n2a1 a2 · · ·an .
Show that for arbitrary
E
Use (84) to give another proof of the consequence (46) of Cauchy's inequality. E JRt and Show that if E R+ , then
bb b2 , . . . , bn a1 a2 · · ·an . b1 � · · · bn
a b a2 , . . . , an 1
n (iv) Show that if a, b, c JRt, then .../a2 + b2 + c2 (ab + be+ + .../a2 b2 + b2 c2 + c2 a2) > 3 ( 1 + J3) abc. (v) Show that for arbitrary a 1 , a2 , . . . , an n > 3, we have a 1 - a3 + a2 - a4 + · · · + an-1 - a1 + an - a2 >- 0 . --a2 + a3 a3 + a4 an + a1 a1 + a2 (vi) Show that for each integer n > 2 we have the inequality 1 ) 1 + .!:.2 + !.3 + · · · + .!.n < 1 + n ( 1 - n y�n- . (vii) Show that for arbitrary numbers a, bb �, . . . , bn we have b1-b2 + ab2 -b3 + · · · + abn-bl > 2 n a--bn + b1 - 2(b1 + � + · · + bn) . b1 + � � + b3 (viii) Suppose that the product of the positive numbers a1 , a2 , . . . , ak is equal to 1. Show that for each n we have (n + a1 )(n + a2 ) · · · (n + ak ) > (n + 1 ) k . (ix) Suppose that the sum of the positive numbers a1 , a2 , . . . , an is equal to 1. Show that for each real number b > 1 we have the inequality a1 + a2 + . . . + an -> n b - an bn - 1 b - a 1 b - a2 (x) Suppose that the sum of the positive numbers a 1 , a2 , . . . , an is equal to 1. Prove the inequality E
ca
E IR+ ,
E IR+
·
EN
Prove the inequalities (xi) -(xii ) for arbitrary
ab a2 , , an •
•
•
E
JRt:
162
8. 6
2. Algebraic Inequalities
Weighted Means
1 , x2 , . . . , Xn , we weight coefficients Pi weighted arithmetic mean Aw n (X1 J X2 , · · · ,Xn) - P1 XP11 ++PP2X22++· ·· ·· ++PPnnXn · It is convenient to normalize the weight coefficients Pi in such a way that their sum is equal to 1. We achieve this by introducing new coefficients V . - Pl + P2 p+· + Pn (1 < j < n), since clearly v1 + v2 + · + Vn = 1 ; the relation for the mean then simplifies to (92) + VnXn · A: ( X2 , , Xn ) = V1 X 1 + V2 X2 + We also define the weighted geometric mean
Sometimes, in determining the mean value of numbers x associate with different numbers xi different levels of "importance," indi cated by E :JR+ . The is then defined by the expression ·
_
J
J -
· · ·
·
xb
·
•••
·
· ·
(93)
v1 = v2 · Vn =
then the question arises whether the AM-GM inequality also holds in this �, more general situation. (If in and (93) we set · we get formulas and for the original nonweighted means An and The following theorem gives an affirmative answer.
gn .)
(92 ) (81) (82)
=
·
=
8. 7 The AM- GM Inequality for Weighted Means
Let the sum of the positive numbers v be equal to 1. , v , , V 1 n 2 Then for arbitrary numbers a1 , we have the inequality
Theorem.
a2 , . . . , an E
:JR+
with equality if and only if a1 a2 = = an =
· · ·
.•.
(94) .
v1 , v2 , , Vn mi = kvi (1 < j <
PROOF. We restrict ourselves to the case where the numbers are rational (the general case will be dealt with in Section 9). Then there exists a number E N such that all numbers n ) are positive integers. Furthermore ,
k
.
•
.
163
8 Inequalities Between Means
k
We now use the AM-GM inequality for the following set of numbers: times the number times We thus obtain times
a 1 , m2
a2 , . . . , mn
an .
m1
(95)
mi lk = vi ( 1
8. 1 < j < n)
which proves (94) , since we have By the result equality if and only if the above set of numbers consists only of identical elements, that is, when ··· This implies the assertion about equality in (94) , and the proof (for the case E Q, 1 is complete. 0
8. 8 Examples We now give six examples for t�e use of inequality (94). (i) We call the positive nQmbers if they satisfy * (Note that both numpers are greater than Prove the so-called If are associated numbers, then the inequality
inequality: p, q
p, q associated 1 .) q xP y xy < -p + q
+ � = 1. Young (96)
x, y E JR+ . SOLUTION. Up , q are associated numbers, then we can (94) with n = 2 q and v1 1/p, v2 = 1/q. Then with a1 xP and a2 = y we immediately obtain (96). We remark that the Young inequality is in fact equivalent to (94) for np == 1/vIf v1=, v21/vare are weight coefficients in (94) for n = 2, then the numbers 0 1 , q 2 associated. (ii) Show that if a, b, c E :JR+ and c =/= 1, then acb + ..!!__ > a + b. SOLUTION. If in (94) with n = 2 we set VI = a +a b , V2 = a +b b , we obtain (in view of the fact that a 1 1= a2 ) the strict inequality a . cb + b . c-a > (cb )af(a+b) . (c-a ) bf(a+b) = 1 , a+b a+b which upon multiplying by a + b gives the desired inequality. 0 holds for arbitrary
use
=
=
2:
&
2. Algebraic Inequalities
1 64
(iii) Show that if 0 < x < 1, then
1 < XX < X2 - X + 1. 2-x
(97)
SOLUTION. If 0 < x < 1, we can use (94) with n = 2 and set v 1 a1 = x, v2 = 1 - x, and a2 = 1. Since a 1 < a2 , we obtain the strict inequality x . x + (1 - x) . 1 > xx . 1 1 - x , which is the right-hand part of (97). If we interchange the numbers a 1 and a2 , we get x · 1 + (1 - x) x > p= · x l - x , 0 that is, 2x - x2 > x 1 x , and this gives the left part of (97) . =
·
-
(iv) Show that if a, b, c are side lengths of a triangle, then a-b c c-a b b-c
(1 + )a . (1 + a
b
) . (1 +
c
)
< 1.
SOLUTION. We use the inequality (94) with n = 3 for the coefficients
v1 - a + ab + c ' V2 - a + bb + c' ---
_
_ _ _ _
and
c V3 = a + b + c .
and
a3 = 1 + a -c b
(98)
'.fhen for the (positive!) numbers
a1 = 1 + b -a e , a2 = 1 + c -b a ,
-
we obtain the inequality
c c c a 1 a2 a3 < v1 a 1 + v2 a2 + v3 a3 = a + b - + ab ++ b -+ ac + + a - b = 1 , 0 which upon raising to the power a + b + c gives the desired inequality. v1
v2
v3
(v} Show that for arbitrary numbers a, b, c E JR+ we have the inequality
SOLUTION. We use again (94) with However, this time we set a1 = 1/a, obtain since
= 3 and the coefficients (98) . a2 = 1/b, and a3 = 1/c; we thus n
1 V1 - V2 = V3 = -;; b c a + b + c ·
If we write the opposite inequality for the reciprocals and then raise both 0 sides to the power a + b + c, we obtain the desired inequality.
Inequalities Between Means
8
165
(vi) Prove the general Bernoulli inequality: If x E IR, p E JR+ , x > -1 , and
p 1= 1 , then
(1
+ x)P > 1 + px
(p > 1),
(99)
(O < p < 1),
(100)
respectively (1
+ x)P < 1 + px
(99) or (100) if and only if x = 0 (compare with 3.3.(iii)). SoLUTION. If 0 < p < 1 , we substitute in (94) n = 2, v 1 = p, v2 = 1 - p, a1 = 1 + x > 0, and a2 = 1; we thus obtain p(1 + X) + (1 - p ) 1 > ( 1 + X )P 1 l -p ,
with equality in
·
·
that is, inequality ( 100) , with equality if and only if a1 = a2 , which means X = 0. Now let p > 1. If 1 + px < 0, we obviously have a strict inequality in (99). If 1 + px > 0, then by the already proven inequality (100) we have 1
(1 + px) P
< 1 + -1 px = 1 + x. p ·
(Equality occurs only for x = 0.) From this we obtain both sides to the power p.
(99)
after raising
0
8. 9 Exercises (i) Show that the weighted means (92 ) and (93) of the positive num
bers x 1 , . . . , Xn have the fundamental mean property: Their value is at most (at least) equal to the largest (smallest) of the numbers X 1 , • . • , Xn · (ii) Show that if a, b,p E JR+ and p < 1 , then (a + b)Pa 1 -P < a + pb.
a, b, c, d E JR+ : adb- c + bdc- a + cda- b > a + b + c. acbd (c + d) c+d < ccdd (a + b) c+d . a + b + c a+b+ c > (b + c) a (c + a) b (a + b) c . 3 2a+b+ c Show that if the sum of the positive numbers a, b equals 1 , then the inequalities ab ba < 2ab and � < aa bb < a2 + b2 hold. When does
Show that (iii) -(v) hold for arbitrary
(iii) (iv) (v) (vi)
(
)
equality occur in these inequalities? (vii) Prove the inequality acbl - c + (1 - a) c (1 - b) 1 - c positive numbers a, b, c less than 1 .
<
1 for arbitrary
166
2. Algebraic
Inequalities
(ix) with the help of Bernoulli's inequality in 8o8. (vi) : (viii) (1 + x) a+ l > (1 + x + :) (x > -1, a > O)o
Prove (viii) and
u
( !r < (1 + �r
(ix) 1 +
(The inequality and 3.8. (iv). )
(0 < a < b).
(ix) was derived for integers a > 2 and b = a + 1 in 3.4o (vi)
(x) Prove Holder's inequality: If p, q are associated numbers (see 8o8. (i) ) , then for arbitrary numbers X I J x 2 , . o o , Xn , Y b y2 , . . o , Yn E JR+ we have
(101) Use (96) and proceed in a similar fashion as in the second proof of 5.40 (Note that for p q = 2, (101) becomes Cauchy's inequality ( 42).) (�i} Use (101) to show that if a, b, c , d E JR+ , a5 +b5 < 1 , and c5 +d5 < 1, then a2 e + b2 d3 < 1. *(xii) Use (101) to prove Minkowski 's inequality: If p > 1, then for arbitrary numbers x�, x2 , . . . , Xn , Yl , y2 , o . . , Yn E JR+ we have
=
Proceed as in 5.5o (iv) for the proof of the triangle inequality ( 45)0 (xiii) Let c, p� , p2 , . . . , Pn E JR+ and suppose that the positive variables x 1 , x2 , . . . , Xn satisfy the condition x 1 +x2 + · o +xn = c. Show that the expression af1 1 �2 . 0 xPn ·
2
0
n
attains its largest value if and only if
X1 P1
X2 P2
Xn Pn
- = - = ··· = -
8. 10 Power Means Up to the end of Section 8 we will assume that a 1 , a2 , . . . , an are arbitrary positive numbers. We will derive several useful inequalities between the sums a} + a2 + · · · + a;;_ for various r E JR. For this purpose it is convenient
8
Inequalities Between Means
to introduce the so-called power means. By a mean of degree numbers a� , a2 , . . . , an we understand the value
r
167
of the
(102) which is meaningful for each r E IR \ {0}. We note that for r = 1 ( resp. r = -1) this is the arithmetic ( resp. harmonic ) mean (compare with (81) and (89) ) . The following theorem deals with the comparison of the power means and the geometric mean.
8. 1 1
Power Means of Positive and Negative Degrees
Theorem.
If r < 0 < s, then
with equality anywhere in (103} if and only if a 1 = a2 = · · · = an . PROOF .
inequality
We obtain the right part of (103) if we raise the AM-GM
to the positive power 1 / s; the left part is obtained by raising the AM-GM inequality Yn (af, a�, . . . , a;;.) < An(af, a�, . . . , a:;_) to the negative power 0 1/r. This also implies the statement about equality in (103) .
Remark. Using mathematical analysis one can show that Therefore, the geometric mean is often called mean We now state the main result on power means.
of degree zero.
8. 12 Inequalities Between Power Means Theorem.
Let r, s E IR, r < s, and rs 1= 0 . Then (104)
with equality if and only if a1 = a2 = · · · = an . The inequality (104) for integers r = 1 and s
earlier inequality (80) in Exercise 7.8. (v). PROOF.
and
r
<
> 1
is equivalent to the
By Theorem 8. 1 1 it suffices to examine only two cases: 0 < s < 0. First let 0 < r < s. If we set p = s/r > 1 , then a�
r<s
=
�,
168
2. Algebraic Inequalities
where bk = a'k ( 1 < k < n ) . Therefore, upon raising to the power inequality ( 104) has the form
bl + � �
0
0
0
+ bn <
(�
+�
�.
.
0
+ !Jl:.
y/P
0
r,
the
( 105 )
It suffices to show that (105) with p > 1 holds for arbitrary positive numbers bk , with equality if and only if b1 = � = · · · = bn · Since we are dealing with a homogeneous inequality in the variables b 1 , b2 , . . . , bn (see 2. 7), we may assume that (106) This means that for the numbers
Xk = bk - 1 we have
Since X k > -1 and p > 1 , Bernoulli's inequality (99) implies 1<
k<
(108)
n.
Adding the inequalities (108) , we obtain in view of (107) , bf + � + · · · + � > n + p(x 1 + X 2 + · · · + Xn )
=
n,
which implies (105 ) under the assumption ( 106) ; equality occurs in (105) if and only if there is equality in (108) for each k, and by 8 . 8. (vi) this means that Xk = 0 (1 < k < n) , that is, b1 b2 = · · · = bn = 1. In the second case, when r < s < 0, (104) follows from the inequality =
which has already been proven, since for each t =/= 0 we clearly have
0
This completes the proof of the theorem.
8. 13 Examples We show how inequalities between power means can be applied.
(i) Find the smallest value of the sum a3 + b3 + c3 for positive real numbers a, b, c satisfying the condition a2 + b2 + c2 27 . =
9 Appendix on Irrational Numbers
169
SOLUTION. By Theorem 8.12, the power means of degrees 2 and 3 for the numbers a, b, e satisfy the inequality
_2Ia2 + b23 +
v
c?
<
-
_3
I a3 + b3 + & .
v
3
Upon substituting a2 + b2 + t? = 27 and some simplification we obtain the bound a3 + b3 + e > 81. Using Theorem 8.12 again, we see that the equation a3 + b3 + e 81 occurs if and only if a = b = e ( = 3). The desired smallest value of the sum a3 + b3 + e3 is therefore equal to 81. If we wanted to find its largest value (under the same condition) , Jensen's inequality from Section 2. 7 (with exponents r = 2 and s = 3) would give the bound a3 + b3 + e < ( ..;27)3 = 81 · y'3. It is also clear that the value of the sum a3 + b3 + c3 can get arbitrarily close to 81 · y'3 (since, for instance, the number a can be arbitrarily close to ..;27) . A largest value of the given sum therefore does not exist (in the set of triples of positive numbers a, b, e 0 satisfying the condition a2 + b2 + t? = 27) . =
(ii) Show that for arbitrary numbers a, b, e E 8(a3 + b3 + e3 ) 2
>
:JR+ we have the inequality
9(a2 + be) (b2 + ca) ( � + ab) .
SOLUTION. With the help of (85) we first estimate from above the product of the three terms on the right, R <
_
9
[
]
(a2 + be) + (b2 + ca) + ( t? + ab) 3 1 _2 + ab + be + ca) 3 , = ( a2 + b2 + c3 3
which together with the inequality ab + be + ca < a2 + b2 + t? (see (27)) leads to the conclusion that 8 1 (2a2 + 2b2 + 2� ) 3 = (a2 + b2 + � ) 3 . R < 3 3 Therefore, the proof is complete if we can verify the inequality 8 3 (a2 + b2 + e2)3 < 8(a3 + b3 + e3 ) 2 (= L);
this, however, is clearly equivalent to the inequality between the means of degrees 2 and 3 of the numbers a, b, e, which is a special case of 0 Theorem 8.12.
9
Appendix on Irrational Numbers
Let us first recall that the general power ar with real exponent r is for each a > 0 defined as the limit ( 109)
2. Algebraic Inequalities
170
{r(k)}
where is an arbitrary sequence of rational numbers converging to r. Of course, it needs to be shown that the limit on the right of 1 09 exists and is independent of the choice of the sequence ( see [5] , p. 6 1 .
( ))
{r(k)} 1 . 10. We need to show that ar > br under the assumption that a > b > 0 d r E :JR+ \ Q. Some sequence {r(k)} of numbers in Q+ converges to this number r . By the proof in 1 . 10 we have ar (k) > br( k} for all k , and by taking the limit as k � we obtain by ( 109 ) the no longer strict inequality r > br. However, in the case r = br we get ADDITION TO
an
oo
a a = (ar ) l fr (br ) l fr = b, 0 which contradicts the assumption a > b. Hence ar > br . ADDITION TO 8 .6. We have to prove the assertion concerning inequality a
=
, v . . . , Vn are irrational . Given v , 1 2 v�Vj(k), v2 ,---+. . . , Vnas, wek ---+find sequences {vj(k)} of positive numbers in Q such that (1 j Vj ) and then we define numbers VJ1· (k) = V1 (k) + V2 (k)Vj(k)+ + Vn (k) E Q+ (1 j k E N). By the proof of 8.6 we have for each k, vH k)a l v� (k)a2 + + v�(k)an > a�� (k) a;� (k} . . . a:� (k) , which, upon taking the limit as k implies (94) , since vj(k) ---+ Vj (1 j ) It remains to show that (94) is a strict inequality unless a 1 = a2 = = an · that case we choose u1 , u2, . . . , Un E Q+ such that Uj Vj ( 1 j ) and we define the positive numbers n Uj , Wj u - � uJ ' UJ· = = . (1 10) W · J u w j =l Since uj E Q+ , by the proof of 8.6 we have the sharp inequality (94) in the case that some of the numbers <
oo
<
n ,
<
"·
+
<
<
n .
<
- L.....J
n,
···
� oo ,
· · ·
<
<
<
n ,
In
I
I
(111)
by the above we also have
w' w l a l + w2 a2 + . . . + wn an > awl '1aw� (1 12) 2 . . . an n . If we raise (111), resp. ( 112) , to the power u, resp. w, and multiply the resulting inequalities together, we obtain (in view of the fact that = uuj , = wwj , and = + w uj a wj a > at• +w, . · a�nwn = af1�2 · a�n . J =l J =l 1
Wj
(t
1
Vj Uj Wj) j ) (t j ) u
1
Uj
·
•
•
9 Appendix on Irrational Numbers
The inequality (94) is therefore strict
1 71
if u
> (t u j aj ) (t wj aj ) �v a · · J J .LJ j=l J=l J=l n
w
( 1 13)
We note that the identity
u + w jE=l (ui + wj) jE= vi 1 l holds; hence for arbitrary y E JR.+ we have ux+wy > L uj ai and y = E wj ai , j=l j=l n
=
=
n
=
x,
n
u w x .y .
If we choose
n
x =
we obtain (1 13) , since by (110) we have
ux + wy = jE=l (uuj + wwj )ai = jE=l (ui + Wj)ai = jE= l viai . n
n
n
0
3 Number T heory
In this chapter we deal with problems involving integers. We will be mainly concerned with questions of divisibility of integers, and also with solving equations in integers or natural numbers. Although the natural numbers and more generally the integers represent, in a certaiii sense, the simplest of mathematical structures, the investigation of their properties has presented generations of mathematicians with a large number of very difficult problems. Often these are problems that are easy to formulate, but are still not solved. Let us mention a few of the most famous among them: The twin prime conjecture (are there infinitely many primes p such that p + 2 is also a prime?) , the Goldbach conjecture (can every even number greater than 2 be written as a sum of two primes?) , or the crown among all the problems of number theory, namely Fermat's last theorem (are there natural numbers n , x , y, z such that n > 2 and xn + yn = zn ?) We note �hat in the six years between the first and the second Czech editions of this book, there have been very significant developments on this last problem. In June of 1993, Andrew Wiles, a professor at Princeton Uni versity, announced during a lecture at a conference in Cambridge that he had proved the so-called Shimura-Taniyama conjecture; this conjecture was already known to imply Fermat's last theorem (that is, the nonexistence of natural numbers n, x , y, z, as mentioned above). After initial problems with Wiles's proof, Fermat's last theorem is now settled beyond any doubt.
174
1
3. Number Theory
Basic Concepts
The concept of divisibility of numbers is encountered already in elementary school; we are therefore dealing with a rather familiar notion. However, since it is very important for this chapter, we will briefly recall the definition and some basic properties.
1. 1
Divisibility
Definition. We say that the integer a divides the integer b (or b is divisible by a, or b is a multiple of a) if there exists ail integer c such that a · c = b. In this case we write a I b.
The following easy statements follow directly from the definition; we leave the proofs to the reader as exercises, with hints given in the appendix. The number 0 is divisible by every integer; the only integer divisible by 0 is 0; for any number a we have a I a; for arbitrary numbers a, b, c the following four implications hold: ===> a 1 c, c ===> a I b + c 1\ a I c :;f 0 ===> (a I b <==> ac b 1\ b > 0 ===> a < b.
a 1 bAb 1 a I b 1\ a I aI
(1)
c
bI be),
c,
(2)
(3) (4)
We also recall that numbers that are ( resp., are not) divisible by 2, are called even (resp., odd). We are now ready to solve a few problems. (i) Determine for which natural number n the number by n + l.
n2 + 1 is divisible
( n + 1 ) (n - 1 ), and thus n + 1 divides n2 - 1. Let us assume that n + 1 also divides n2 + 1. Then it also has to divide the difference (n2 + 1) - (n2 - 1) = 2. Since n E N, we have n + 1 > 2, and so from n + 1 I 2 it follows that n + 1 = 2; hence n = 1 . Thus the only natural D number with the given property is 1. (ii) Find all integers a :;f 3 for which a - 3 I a3 - 3. SOLUTION. We have n2 - 1
=
SOLUTION. By equation (5) in Chapter 1 we have
a3 - 27 = (a - 3) (a2 + 3a + 9) , and therefore a - 3 divides a3 - 2 7 . Let us assume that a - 3 I a3 - 3 . Then a - 3 also divides the difference (a3 - 3) - (a3 - 27) = 24, and conversely, if a - 3 I 24 , then a - 3 also divides the sum ( a3 - 2 7 ) + 24 = a3 - 3.
1 Basic Concepts
175
The number 24 is divisible only by ±1, ±2, ±3, ±4, ±6, ±8, ±12, ±24; therefore, a - 3 must be equal to one of these numbers. This means that 0 a E { - 21, -9, -5, -3, -1 , 0, 1 , 2, 4, 5, 6, 7, 9, 1 1, 15, 27}.
(iii) Show that for each n E N,
169 I 3Sn+3 - 26n - 27. SOLUTION . We set A(n) binomial theorem:
=
33n+3 - 26n - 27 and rewrite 33n+3 using the
( ) . 0 n+ l (n 1 ) 1 + 26(n + 1) + : 26i .
n+ l n 1 1 3 3 l n n �+ + -: 26i = 2 = (26 + 1 ) + = E 3 't �=
=
E . 2
t=
't
Since for i > 2 we have 26i = 169 · 4 26i - 2 , all the summands in the summation above are divisible by 169, and we have therefore ·
( ) k
n+ l n 1 ; 26i = 169t for some natural number 169t and 169 I A(n).
t. Finally, A(n) = 1 +26(n+ 1 ) + 169t - 26n -27 = 0
(iv) Show that there are infinitely many natural numbers n such that 2n + 1 is divisible by n. SOLUTION . We will show that all numbers of the form n = 3k , where k E N (i.e., infinitely many numbers ) , have the desired property. We prove this by induction. If k = 1, then n = 3 and clearly 3 I 2 3 + 1. Let us now �; assume that for some k E N we have 3k I 23 + 1. Then there exists an integer m such that m 3k = 23 1c + 1. The binomial theorem gives ·
23 1c+ l
=
(2 31c ) 3 = ( m . 3k - 1 ) 3
m3 . 33k m2 . 32k+ l + m . 3k+ l 1 = t . 3k+ l 1, where t = m3 • 32k - l - m2 • 3k + m is an integer. Thus, =
which was to be shown.
_
_
_
0
3. Number Theory
176
Exercises
1.2
(i) Determine the integers n for which 7n + 1 is divisible by 3n + 4. (ii) For which natural numbers n do we have 3n + 2 I 5n2 + 2n + 4?
n E N: (iv) 64 I 32n+3 + 40n - 27. 9 I 4n + 15n - 1. (vi} (2n - 1) 2 I 2 {2n - l )n - 1. n2 I (n + 1) n - 1. Show that for arbitrary a, b E we have 17 I 2a + 3b if and only if 17 l 9a + 5b. Show that if n 1 2n - 2 for some integer n > 2, then also m 1 2m - 2 for m = 2n - 1 .
Show that (iii) - (vi) hold for arbitrary
(iii) (v} (vii)
(viii} 1. 3
Z
The Division Theorem
Given arbitrary numbers a E and m E N, there exist unique numbers q E and r E 0, 1, . . . , m - 1 } such that a = qm + r. PROOF. First we prove the existence of the numbers q and r. We assume that the positive integer m is fixed, and we prove the result for arbitrary a E To this end, we first assume that a E No, and prove the existence of q and r by induction: If 0 < a < m, we choose q = 0, r = a, and the equality a = qm + r
Theorem.
Z
Z
{
Z.
clearly holds. Now we assume that a > m and that we have already shown the existence of the numbers q, r for all a' E 0, 1, 2, . . . , a - 1 } . Then in particular, for a' = a - m there exist q', r' such that a' = q'm + r' with r' E 0, 1, . . . , m 1 . If we choose q = q' + 1 and r = r', then we have a = a' + m = (q' + 1)m + r' = qm + r, which was to be shown. We have thus shown the existence of the numbers q, r for arbitrary a > 0. If, on the other hand, a < 0, then we may use the fact that for the positive r' E 0, 1, . . . , m - 1 } such that integer -a there exist numbers q' E -a = q'm + r'; hence a = -q'm - r'. If r' 0, we set r = 0, q = -q'; if r > 0, we set r = m - r', q = -q' - 1. In both cases we have a = q · m + r, which proves the existence of numbers q, r with the desired properties, for
{
{
}
Z,
{
=
Z, m E N. We will now prove uniqueness. We assume that the numbers q1 , q2 E Z and r 1 , r2 E { 0, 1, . . . , m - 1 } satisfy a = q 1 m + r 1 = q2 m + r2 . Rewriting, we obtain r - r (q - q ) m, and thus m l r 1 - r . Since 0 < r < m and all
aE
1 2 1 2 l 2 0 < r2 < m, we have -m < r1 - r2 < m , and by ( 4) we get r 1 - r2 = 0. But then also (q2 - ql )m = 0, and therefore q1 = q2 , r1 = r2 . Hence the D numbers q, r are uniquely determined, and this completes the proof. The numbers q and r in Theorem 1.3 are called the (incomplete) quotient and remainder, respectively, in the division of a by m with remainder. It =
1 Basic Concepts
177
becomes clear that this terminology is appropriate if we write the equation a = mq + r in the form r a q+: = m m
r 0 -< m < 1.
where
It is also useful to convince oneself that m divides a if and only if the remainder r is zero; this follows from Theorem 1.3 as well. We will now give some examples to illustrate the usefulness of Theorem 1.3 for solving number theoretic problems.
1.4 Examples (i) Show that if the remainders of a, b E Z upon dividing by m E N are 1,
then the remainder of ab upon dividing by
SoLUTION.
m is also 1. s, t E Z such that a = sm + 1,
By Theorem 1.3 there exist Multiplying, we obtain the expression
b = tm + 1. ab = (sm + 1)(tm + 1) = (stm + s + t)m + 1 = qm + r, where q = stm + s + t and r = 1 are, by Theorem 1 . 3, uniquely determined; 0 the remainder in the division of ab by m is therefore equal to 1. (ii) Show that among m consecutive integers there is exactly one that is divisible by m . SOLUTION . We denote the given numbers by a + 1, a + 2, . . . , a + m . Ac cording to Theorem 1 .3 there exist uniquely determined numbers q E Z, r E { 0, 1, . . . , m - 1} such that a = qm + r , which implies a + (m - r ) = qm + r + m - r = (q + l)m, and thus m divides a + ( m - r ) , which is one of our m numbers. If, the other hand, a + k, k E {1, 2, . . . , m}, is divisible by m, then we have a + k = m for an appropriate E Z, and thus a = ( 1)m + (m - k). The uniqueness of the number r now implies that k = m - r , and therefore O only a + (m - r ) is divisible by m.
on
c
·
c
c-
1 . 5 Exercises Show that
(i) the sum of the squares of two consecutive natural numbers, divided
by 4, leaves the remainder 1; (ii) the remainder of the square of an odd number, divided by 8, is 1 ; (iii} for an odd k and a positive integer n , the number k2n. - 1 is divisible by 2 n + 2 .
178
1.6
3. Number Theory
The Greatest Common Divisor and the Least Common Multiple
Definition. Let the integers a�, a2 be given. Any integer m such that m I a1 and m I a2 (resp. a1 I m and a2 I m) is called a common divisor (resp. common multiple) of a1 and a2 . A common divisor (resp. multiple ) m > 0 of a 1 and a2 that is divisible by any common divisor ( resp. divides any common multiple ) of a� , a2 , is called greatest common divisor ( resp. least common multiple) of a1 and a2 and is denoted by (a�, a2 ) (resp. [a�, a2]). It follows directly from the definitions that for any a, b E Z we have (a, b) = (b, a), [a, b] = [b, a], (a, 1) = 1, [a, 1] = lal, (a, 0) = lal, [a, 0] = 0. However, it is not yet clear whether the numbers (a, b) and [a, b] exist at all for every pair a, b E Z. But if they do exist, they are unique, since for any two numbers m�, m2 E No we know by ( 4) that if both m 1 I m2 and m2 I m 1 , then necessarily m 1 = m2 . We prove the existence of (a, b) (along with an algorithm for finding it ) in Section 1 . 7, while an existence proof of [a, b] and a method of determining its value will be described in 1.9.
1 . 7 The Euclidean Algorithm
Let a1 , a2 be natuml numbers. For each n > 3 such that we denote by an the remainder when an-2 is divided by an- 1 · Then we will eventually get ak = 0, and in this case ak - 1 = (a 1 , a2 ).
Theorem. an- 1 =/= 0,
By 1.3 we have a2 > a3 > a4 > · · · . Since we are dealing with nonnegative integers, each number is at least one less than the previous one, and therefore we necessarily arrive at the final step ak = 0, in which case ak - 1 1= 0. From the definitions of the numbers an it follows that there exist integers q 1 , q2 , . . . , qk - 2 such that PROOF .
a1 = q1 a2 + a3 , a2 = q2 a3 + a4 , ·
·
(5)
ak - 3 = qk- 3 · ak -2 + ak - 1 , ak-2 = qk- 2 · ak - 1 · From the last equation it follows that ak - 1 I ak -2 , from the second-to last that ak - 1 I ak - 3 , etc. , until in the end from the second equation we obtain ak - 1 I a2 , and finally the first one gives ak - 1 I a 1 . Hence ak _ 1 is a common divisor of a 1 , a2 . On the other hand, an arbitrary common divisor of a� , a2 also divides a3 = a 1 - q1 a2 , and therefore a4 = a2 - q2 a3 , , and finally also ak - 1 = ak - 3 - qk - 3 ak -2 · We have therefore shown that ak _ 1 is 0 the greatest common divisor of a1 and a2 . •
•
•
1 Basic Concepts
179
1 . 8 Bezout 's Equality
Any two integers a1 , a2 have a greatest common divisor ( a 1 , a2 ), which is unique by 1. 6, and there exist integers k1 , k2 such that (ab a2 ) = k1a 1 + k2 a2 .
Theorem.
It clearly suffices to prove this theorem for a 1 , a2 E N. We note that if it is possible to express some numbers r, s E Z in the form r = r1 a1 + r2 a2 , s = s1a1 + s2 a2 , where rt, r2 , S ! J s 2 E Z, then we can also express in this way PROOF .
and for arbitrary c E Z. Since a 1 = 1 · a 1 + O · a2 and a2 = 0 · a 1 + 1 · a2 , it follows from (5) that we can also express in this way aa = a 1 -q1 a2 , a4 = a2 -q2 aa , _ 0 . . . , and finally ak - 1 = ak -3 - qk - a ak - 2 , which of course is (ab a2 ).
1. 9 Existence of the Least Common Multiple
For arbitrary integers a 1 , a2 there exists the least common multiple [ab a2] , and we have (ab a2 ) · [a� , a2] = la 1 · a2 l · PROOF. The theorem is certainly true when one of the numbers a 1 , a2 is zero. We may furthermore assume that both nonzero numbers a 1 , a2 are Theorem.
positive, since a change in sign does not change the formula. We will be done if we can show that q = (:!::2) is the least common multiple of a 1 , a2 • Since (ab a2 ) is a common divisor of a 1 and a2 , the numbers (a 1a1,a2 ) and ( a� ) are integers, and therefore a1 , 2
is a common multiple of a 1 and a2 . By 1.8 there exist kb k2 E Z such that (ab a2 ) = k1 a1 + k2 a2 . We now assume that n E Z is an arbitrary common multiple of a 1 , a2 and we show that it is divisible by q. Indeed, we have nIa1 , nIa2 E Z, and therefore the expression �.
a2
a 1 + k2 a 2 ) n(k �. 1 + k2 = k1 a1
a 1 a2
is also an integer. But this means that shown.
=
n(a 1 , a 2 ) a 1 a2
q I n,
=
n q
which remained to be
0
180
3. Nwnber Theory
1. 1 0 Divisors and Multiples of More Than Two Numbers We will define the greatest common divisor and the least common multiple , an E Z in the same way as in 1 .6. Any m E Z such of n numbers a�, a2 , that m I a 1 , m I a2 , . . . , m I an (resp. a 1 l m , a2 l m, . . . , an I m) is called a common divisor (resp. common multiple) of the numbers a 1 , a2 , . . . , an . A common divisor ( resp. multiple) m > 0 of a 1 , a2 , . . . , an that is divisi ble by any common divisor ( resp. divides any common multiple) is called the greatest common divisor ( resp. least common multiple) of the numbers a� , a2 , . . . , an and is denoted by (a� , a2 , . . . , an ) (resp. [a 1 , a2 , . . . , an]). We can easily convince ourselves that we have •
•
.
(6) (a� , . . . , an- b an ) = ((ab . . . , an- 1), an ) , (7) [a 1 , . . . , an- 1 , an] [ [a 1 , . . . , an - 1L an] · Indeed, the greatest common divisor (a 1 , . . . , an ) divides all numbers a 1 , . . . , an ; hence it is a common divisor of a1 , . . . , an- 1 , and therefore it divides the greatest common divisor (a�, . . . , an - 1 ) , that is, (ab . . . , an ) I ((a�, . . . , an- 1 ), an ) · Conversely, the greatest common divi sor of the numbers (a�, . . . , an- d and an divides an , but also all numbers a�, . . . , an- 1 ; hence it divides their greatest common divisor, which means that ((a� , . . . , an- 1 ) , an ) I (a 1 , . . . , an ) · Together, this implies equation (6), and (7) can be obtained in complete analogy. With the help of (6) and (7) we can easily obtain the existence of the greatest common divisor and the least common multiple of any n integers. Indeed, we use induction on n: For n = 2 the existence is guaranteed by 1.7 and 1.9, and if for some n > 2 we know that the greatest common divisor and the least common multiple exist for any n - 1 numbers, then by (6) and (7) they exist also for any n integers. =
1. 1 1
Relative Primality
Definition. The numbers a 1 , a2 , . . . , an E Z are called relatively prime (or coprime) if they satisfy (a 1 , a2 , . . . , an ) = 1. The numbers a� , a2 , . . . , an E Z are called pairwise relatively prime if for any i, j with 1 < i < j < n, we have (ai, ai ) = 1. In the case n = 2, these two concepts coincide, and for n > 2 pairwise relative primality implies relative primality, but not conversely: For exam ple, 6, 10, and 15 are relatively prime, but they are not pairwise relatively prime, since no two of them are relatively prime: ( 6, 10) = 2, (6, 15 ) = 3,
(10, 15) = 5.
1 . 12 Examples (i) Find the greatest common divisor of 263 -
1 and 29 1 - 1 .
1 Basic Concepts
SOLUTION .
181
Using the Euclidean algorithm:
29 1 - 1 = 228 (263 - 1) + 228 - 1, 263 - 1 = (235 + 27 ) (2 28 - 1) + 27 - 1, 228 - 1 = (22 1 + 2 14 + 27 + 1)(2 7 - 1) . 0 The desired greatest common divisor is therefore 2 7 - 1 = 127. (ii) Suppose that the natural numbers m, n satisfy m < n. Show that any set of n consecutive integers contains two distinct elements whose product is divisible by m · n. SOLUTION. Let M be the given set, M = {a + 1, a + 2, . . . , a + n}, with some a E Z. By 1.4.(ii) there exists exactly one i E { 1, 2, . . . , n} such that n I a + i, and exactly one j E { 1 , 2, . . . , m } such that m I a + j. In the case i 1= j the solution is easy, since we have m n I (a + i)(a + j), where a + i, a + j are distinct elements of M.. Therefore, we now assurhe i = j. We set (m, n) = d , [m, n] q; since by 1.9 we have mn = dq, the problem will ·
=
be solved if we can find two distinct elements of M such that one is divisible by q and the other by d . The first one is easily found: Since the number a+ i is a common multiple of m and n, we have q I a + i. Next we show that M also contains the number a+i+d, which is divisible by d. Indeed, since d I m and d I n, there exist r, s E N such that m = dr, n = ds. The inequality m < n implies r < s; thus r + 1 < s and m + d = d(r + 1) < ds = n. Since i < m, we also have i + d < m + d < n; hence a + i + d E M. It is now easy to verify that d I a + i + d: From d I m and m I a + i it follows that 0 d I a + i, and thus d I a + i + d.
(ill) Show that there are infinitely many numbers of the form tn = n(n2+ 1) ,
n E N , that are pairwise relatively prime.
SOLUTION . We will show that whenever we have k numbers t i1 , t i2 , . . . , ti1e that are pairwise relatively prime, we can always find another index i k+ 1 such that tile+ l is relatively prime to all of them. Let c denote the product of ti 1 , ti2 , , ti1e and set i k + 1 2c + 1. Then •
•
=
•
t ik+l
=
1 (2c + 1)(2c + 2) 2
=
(c + 1 )(2c + 1) = 2c2 + 3c + 1
has the desired property. Indeed, for ( ti; , ti 1c+ 1 ) = d > 1 to hold for some index j E { 1, 2, . . . , k } , we would need to have d I ti; , which would imply d I c = ti1 · • · ti1e , and thus d would be a co�on divisor of c and 2£? + 3c+ 1; this, however, is impossible, since ( c, 2£? + 3c + 1) = 1. 0
1 . 13 Exercises In ( i) - ( iv) , find the greatest common divisor of the given numbers for an arbitrary n E N:
3. Number Theory
182
(i) (2n + 1, 9n + 4) . (ii) (2n - 1, 9n + 4). (iii) (36n + 3, 90n + 6) . (iv) (2n + 3, n + 7) . (v) Show that there are infinitely many numbers rn = n(n+1)(n+2)/6, n that are pairwise relatively prime. (vi) Show that any integer n > 6 is the sum of two relatively prime integers greater than 1. (vii) Show that for m, n m > n, the numbers 2 2m + 1 and 22n + 1
E N,
E N , 0 are relatively prime. (viii) Given any a, b E Z, show that if d ka + lb 0, where k , l E Z, satisfies d I a and d I b, then d (a, b). *(i.x) For any m, n E N, determine the greatest common divisor of 2m - 1 a d 2n - 1. >
=
=
n
1 . 14 Further Properties of the Greatest Common Divisor Theorem. For arbitrary natural numbers a, b, c we have (i} (ac, be) = (a, b) · c, (ii} if (a, b) = 1 and a I be, then a I c, (iii) d = (a, b) if and only if there exist ql , q2 such that a = dqb b = dq2 , and (q1, q2 ) = 1 . PROOF. ( i ) Since (a, b) is a common divisor of a and b, then (a, b) · c is a common divisor of ac and be; hence (a, b) · c I (ac, be). By 1.8 there exist k, l Z such that (a, b) = ka + lb. Since (ac, be) is a common divisor of ac and be, it also divides kac + lbc = (a, b) · c. We have thus shown that (a, b) · c and ( ac, be) are two natural numbers that divide one another, and so by ( 4) they are equal. ( ii ) We assume that (a, b) = 1 and a I be. By 1.8 there exist k, l Z such that ka + lb = 1, which implies that c = c( ka + lb) = kca + lbc. Since a I be, it follows that also a I c. ( iii) Let d = (a, b); then there exist q1 , q2 with a = dq 1 , b = dq2 . Then by ( i ) we have d = (a, b) = (dq1 , dq2 ) = d · (q 1 , q2 ), and thus (q1 , q2 ) = 1. Conversely, if a = dq1 , b dq2 , and ( ql , q2 ) = 1, then (a, b) = (dq 1 , dq2 ) = 0 d(q�, q2 ) = d · 1 = d ( again using ( i)) .
EN
E
E
EN
=
1. 15 Exercises Prove ( i) - ( v ) for arbitrary natural numbers a, b, c, d:
(i) (a, b) · (c, d) = (ac, ad, be, bd) . (ii} if (a, b ) = (a, c) = 1, then (a, be) = 1. (iii) if (a, b) = 1, then (ac, b) = (c, b).
2 Prime Numbers
183
(iv) abc = [a, b, c] · (ab, ac, be) . (v) abc = (a, b, c) · [ab, ac, be] .
Solve the systems of equations (vi) x + y = 150, (x, y) 30. (viii) xy 8400, (x, y) 20. =
=
=
2
(vi)-(ix) in positive integers: (vii) (x, y) = 45, 7x = 11y. (ix) xy = 20, [x, y] = 10.
Prime Numbers
Prime numbers are among the most important objects in elementary num ber theory. Their importance comes mainly from the theorem on unique factorization of a natural number into a product of primes, a strong and efficient tool for solving many problems in number theory.
2. 1
Primes and Composite Numbers
Definition. Any integer n > 2 has at least two positive divisors: 1 and n . If it has no other positive divisors, it is called a prime number (or simply a prime). Otherwise, it is called a composite number. In
the remainder of this book we will , as a ruler denote a prime by the letter p. The smallest primes are 2, 3, 5, 7, 1 1, 13, 17, 19, 23, 29, 31.
2.2 An Equivalent Condition
The integer p > 2 is a prime if and only if the following holds: For any two integers a and b, the condition p I ab implies p I a or p I b. Theorem.
(i) We assume that p is a prime and p I ab, where a, b E Z. Since (p, a) is a positive divisor of p, we have (p, a) = p or (p, a) = 1. In the first case p I a, while in the second case p I b, by 1 . 14. ( ii ) (ii) If p is not a prime, it must have a positive divisor different from 1 and p. We denote it by a; then obviously b = pfa and p = ab, which implies 1 < a < p, 1 < b < p. We have thus found integers a, b such that D p I ab but p divides neither a nor b. PROOF.
.
EN
2. 3 Examples (i) Find all primes that are at the same time the sum and the difference of appropriate pairs of primes.
184
3. Number Theory
SOLUTION. We assume that the prime p is, at the same time, the sum and the difference of two primes. Then, of course, p > 2, and thus P is odd. Since p is both the sum and the difference of two primes, one of them must always be even, namely 2. Thus we require primes p, p 1 , P2 such that p = P 1 + 2 P2 - 2, therefore p 1 , p, p2 are three consecutive odd numbers, which means that exactly one of them is divisible by 3 (this follows, for example, from 1 .4.(ii); of the three consecutive integers P2 - 3, p, P l + 3 exactly one is divisible by 3) . Of course, 3 itself is the only prime divisible by 3, which in view of p1 > 1 implies that p 1 = 3, p = 5, P2 = 7. The only 0 prime number that satisfies the condition is therefore p = 5. =
No
for which among the ten consecutive integers (ii) Find the numbers k E k + 1 , k + 2, . . . , k + 10 there are the most prime numbers. SOLUTION . For k = 1 the set contains five primes: 2, 3, 5, 7, 1 1 . For k = 0 and k 2 there are only four primes. If k > 3, the set in question does not contain the number 3 . By 1.4.(ii) , among ten consecutive integers there are five even and five odd numbers, and among the latter at least one is also divisible by 3. Among the integers k + 1 , k + 2, . . . , k + 10 we have therefore found at least six composite numbers; thus there are at most four primes 0 in this set. The only solution to the problem is therefore k 1. =
=
(iii) Show that given an arbitrary natural number consecutive natural numbers none of which is a prime.
SOLUTION.
n,
there exist
n
We consider the numbers ( n + 1 ) ! + 2, ( n + 1) ! + 3, . . . , ( n + 1 ) ! + ( n + 1 ) .
Among these n consecutive integers there is no prime number because any k E {2, 3, . . . , n + 1 } satisfies k I ( n + 1)!, and thus k I ( n + 1 ) ! + k, which 0 means that ( n + 1) ! + k cannot be a prime.
(iv) Show that for any prime p and any k E
coefficient
SOLUTION.
(�) is divisible by p.
N, k < p, the binomial
By definition of the binomial coefficient,
()
p p! p · (p - 1 ) · · · (p - k + 1) = = k k! (p - k) ! 1 ·2···k
E
N'
and thus k! I p · a, where we have set a = (p - 1) · · · (p - k + 1 ) . Since k < p, none of the numbers 1 , 2, . . . , k is divisible by the prime p, and so 2.2 shows that k! is not divisible by p, which means that (k! , p) = 1 . By 1 .14.(ii) we have k! I a; hence b = ajk! is an integer. Since (k) = pajk! = pb, the o number (�) is divisible by p.
2 Prime Numbers
2.4
185
l?xercises (i) Show that there is no natural number n such that 6n + 5 can be
expressed as a sum of two primes. (ii) Find all natural numbers n for which n , n + 10, and n + 1 4 are all primes. (iii) Find all primes p such that 2p2 + 1 is also a prime. (iv) Find all primes p such that 4p2 + 1 and 6p2 + 1 are also primes. (v) Find all n E N such that 2n - 1 and 2n + 1 are both primes. (vi) Show that if p and sr + 1 are both primes, then 8p2 + 2p + 1 is a prime. (vii) Find all n E N such that n + 1 , n + 3, n + 7, n + 9, n + 13, and n + 1 5 are primes. * (viii) Show that the number 520 + 2 30 is composite. * ( ix) Show that there exist infinitely many natural numbers n such that every number of the form m4 + n, where m E N, is composite. (x) Show that for any prime p > 2 the numerator m of the fraction
m 1 1 1 - = 1+ - +- +···+ 2 3 n p-
1'
where m, n E N, is divisible by p. * (xi) For any n E N, find n pairwise relatively prime natural numbers a1 , . . . , an such that for every 1 < k < n the sum of any k of them is composite. * (xii) Show that if a, b, c, d E N satisfy ab = cd, then the sum a + bn + C"' + tJ:'l is composite for any n E N.
n
2. 5
Unique Factorization
Theorem. Any natural number n > 2 can be expressed as a primes. This expression is unique up to the order of the factors. is a prime, then by ''product" we mean just this prime).
product of (If n itself
First we prove by induction that every n > 2 can be decomposed into a product of primes. If n = 2, then the product is just the prime 2. We now assume that n > 2 and that we have already shown that any n', 2 < n' < n, can be written as a product of primes. If n is a prime, then the product consists of just this one prime. If n is not prime, then it has a divisor d, 1 < d < n. If we set c = n/d, then also 1 < c < n. The induction hypothesis implies that c and d can be expressed as products of primes, and therefore their product c · d = n can also be expressed in this way. PROOF.
3. Number Theory
186
To prove uniqueness, we assume that we have equality between the prod are primes such ucts ··· · · · where m s. We use that and 1 ··· induction on m to show that m s, would In the case m = 1 , is a prime. If s > 1 , then have a divisor such that 1 > 1 ) , which is (since ·· impossible. Hence s 1 and = We now assume that m > 2 and that the assertion holds for m - 1 . Since = divides the product the prime · ··· · ·· which by 2.2 is possible only when divides a qi for an appropriate i {1, 2, . . . , s } . But qi is a prime, so it follows that i (since > 1). In complete analogy it can be shown that for an appropriate j { 1, 2, . . . , m}. Hence
P1P1 P<2 P P<m q<1 qP2 , qq18 ,< q
·
·
·
=
=
·
·
=
=
·
=
·
=
=
=
=
·
·
s -
=
=
=
=
s
=
=
=
=
2. 6 Consequences (i} If are distinct primes and n 1 , . . . , nk
, , then every pos E N , . . o . P Pk 1 itive divisor of the number a p� 1 p �k is of the form p1.{"1 • pf:k , with m 1 , . . . , mk E No and m 1 < n 1 , m2 < n2 , . . . , m k < nk . The number a has therefore exactly (n 1 + 1) ( n2 + 1) · · (nk + 1) positive divisors. (ii} Let P1 , . . . ,pk be distinct primes and n�, . . . , nk , m 1 , . . . , mk E No . If we set ri min{ mi}, ti max{ ni, mi} for all i 1, 2, . . . , k, then (pn1 t • • • Pn1c Pm t · · · Pmk �c ) Pr1 t · · · Prk�c , 1 ' k [pnt 1 · · Pnk1c ' Pm1 t · · · Pmk 1c ] Ptt1 · · · Ptk1c · (iii} If a, b, c, m are natural numbers such that (a, b) 1 and ab em, then there exist relatively prime natural numbers y such that a m , b ym . =
•••
••
·
=
nt ,
=
=
=
·
=
=
x
x,
=
=
=
The proofs of these consequences are left to the reader; hints can be found in the appendix.
2. 7 Examples (i} Show that for each integer n > 2 there is at least one prime between n
and n!
2 Prime Numbers
187
Let p denote
any prime dividing n! - 1 ( it exists by 2.5, since n! - 1 > 1 ) . If p < n, then p would have to divide n! and could therefore not be a divisor of n! - 1. Hence n < p. Since p I ( n! - 1 ) , we have p < n! - 1, 0 and thus p < n!. The prime p therefore satisfies the given condition. SOLUTION.
(ii) Show that there exist infinitely many primes of the form 3k + 2, where
k E No .
SOLUTION .
We assume the contrary, namely that there exist only finitely many primes of this form, and we denote them by Pl = 2, P2 = 5, P3 = 11 , . . . , Pn· We set N = 3p2 · P3 · · · Pn + 2. If we write N as a product of primes according to Theorem 2.5, then this decomposition must contain at least one prime p of the form 3k + 2, since otherwise N would be a product of primes of the form 3k + 1 ( note that N is not divisible by 3) , and so by 1.4. ( i) , N would also be of the form 3k + 1 , which is not true. Now it follows from the particular form of N that the prime p cannot be among D the primes P l , P2 , . . . , Pn , and this is a contradiction. We note that the examples in 2. 7 allow for considerable generalizations. In the book [ 11 ] W. Sierpinski proves the theorem: "For any natural number n > 5 there are at least two primes between n and 2n," which generalizes Chebyshev's theorem: "For any integer n > 3 there is at least one prime between n and 2n - 2." The proof uses only elementary methods, but is relatively long ( pp. 131-137) . Example 2.7. (ii) is generalized by Dirichlet's theorem on primes in arith metic progressions: "If a and m are relatively prime natural numbers, there exist infinitely many natural numbers k such that mk + a is prime." This is a deep theorem, and its proof requires methods that go well beyond elementary number theory.
2. 8 Exercises (i} Find ( a + b, ab) , where a, b are relatively prime integers. (ii) Given integers a and b, find ( a + b, [a, b]) . (iii) Show that if a > 4 is a composite integer, then a I ( a - 1 ) !. * (iv) Show that if p > 5 is a prime, then there is no m E N such that (p - 1 ) ! + 1 = pm . ( v) Show that there exist infinitely many primes of the form 4k + 3, where k E No. (vi) Show that a prime of the form 22n + 1 , where n E N, cannot be expressed as a difference of fifth powers of two natural numbers. *(vii) Suppose that a and n are natural numbers with the property that there exists an s E N such that (a - 1 ) 8 is divisible by n. Show that 1 + a + · · · + an- l is also divisible by n.
188
3. Number Theory
(viii) Show that if a, b E Z are such that (a, b) = 1 and 2 I ab, then (a + b, a2 + b2 ) = 1. 2. 9 Exponents in a Factorization To any prime p and any natural number n there is, according to The orem 2.5, a uniquely determined number of appearances of p in the decomposition of n into prime factors (if p does not divide n, we take this number to be zero) . We denote this number by the symbol Vp (n). For a negative integer n we set vp (n) = vp ( -n) . According to 2.6.(i) we can characterize this notation by saying that vp (n) is the exponent of the largest power of the p�ime p that divides n, or by n = pvp(n) · m, where m is an integer not divisible by p. From this it easily follows that any nonzero integers a, b satisfy
Vp (ab) = Vp (a) + Vp (b), vp (a) < vp (b) 1\ a + b 1= 0 ==? vp (a + b) > vp (a ) , Vp (a) < Vp (b) ==? Vp (a + b) = Vp (a), Vp (a) < Vp (b) ==? Vp ((a, b)) = Vp (a) 1\ Vp([a, b]) = Vp (b).
(8) (9) (10) (11)
2. 10 Example Show that any natural numbers a, b, c satisfy
([a, b], [a, c], [b, c]) = [(a, b), (a, c), (b, c)]. SOLUTION. By 2.5, we are done if we can show that vp (L) = vp (R) for any prime p, where L, resp. R, denotes the term on the left, resp. on the right. Now let p be any prime. In view of the symmetry on both sides, we may without loss of generality assume that vp (a) < vp (b) < vp (c). By (11) we have vp([a, b]) = vp (b), vp([a, c]) = vp([b, c]) = vp(c); vp ((a, b)) = vp ((a, c)) = vp (a), vp ((b, c)) = vp (b), and this implies vp (L) = vp( b) 0 vp (R), which was to be shown.
2. 1 1 Exercises (i} Give new proofs of 1.15.(i)-(v) , using the method of 2.10. (ii} Show that any natural numbers a, b, c, such that (a, b) = 1 , satisfy (iii)
(ab, c) = (a, c) · (b, c). Show that if for m, n E N the number yin is rational, then it is in
fact a positive integer. (iv) Show that if n, r, s E N, ( r, s) = 1 and \fiiT E N, then n = m8 for an appropriate m E N.
3 Congruences
189
(v ) Show that if for some positive rational numbers a and b the number
Va + v'b is rational, then ya and v'b are also rational. * (vi) Let a, b, c, d be integers such that ac, bd, be + ad are all divisible by the same natural number m. Show that then the numbers be and ad are also divisible by m. ·
3
Congruences
The concept of congruence was introduced by Gauss . Although it is a very simple notion, its importance and usefulness in number theory are enor mous. This is particularly obvious in that even complicated arguments can be presented in a concise and clear manner .
3. 1
Definition of Congruence Definition. If the two integers a, b have the same remainder r upon divi sion by the natural number m, where 0 < r < m, then a and b are called congruent modulo m, and we write
a = b ( mod m) . Otherwise, we say that a and b are not congruent, or incongruent, modulo m, a ¢. b ( mod m) .
3.2 Equivalent conditions
E
E
For any numbers a, b Z and m N the following conditions are equivalent:
Theorem. (i) (ii) (iii)
a = b ( mod m) , a = b + mt for an appropriate t E Z, m I a - b.
I. If a = q1 m + r and b = q2 m + r, then a - b = (q1 - q2 ) m, and therefore ( i) implies (iii ) . II. If m I a - b, then there exists a t Z such that m · t = a - b, that is, a = b + mt, and so ( iii) implies ( ii) . III. If a = b + mt, then it follows from b = mq + r that a = m(q + t) + r, so a and b have the same remainder r upon division by m, that is, a = b 0 ( mod m ) ; hence (ii) implies ( i) . PROOF .
E
190
3. Number Theory
3. 3 Basic Properties of Congruences It follows directly from Definition 3.1 that congruence modulo .m is reflexive (i.e., a = a (mod m) for any a E Z), symmetric (i.e., for each a, b E Z, a = b (mod m) implies b = a (mod m)) and transitive (i.e., for each a, b, c E Z, a = b (mod m) and b = c (mod m) imply a = c (mod m)). We now prove some further properties: (i) Congruences with the same modulus can be added . Any summand can be moved, with the opposite sign, fro:rp. one side of the congruence to the other. To any side of the congruence we can add an arbitrary multiple of the modulus. If a 1 = b1 (mod m) and a2 = b2 (mod m), then by 3.2 there exist h , t 2 E Z such that a 1 = b 1 + mh, a2 = b2 + mt2 . Then a 1 + a2 = b1 + b2 + m(t 1 + t2 ), and again by 3.2 we have a 1 + a2 = b1 + b2 (mod m). If we add a + b = c (mod m) and the obviously valid congruence -b = -b (mod m), we obtain a = c - b (mod m). If we add another obviously valid congruence, mk = 0 (mod m), to a = b (mod m), then we get a + mk = b D (mod m). PROOF.
(ii) Congruences with the same modulus can be multiplied together. Both sides of a congruence can be raised to the same positive integer power. Both sides of a congruence can be multiplied by the same integer. If a 1 = b1 (mod m) and a2 = b2 (mod m), then by 3.2 there exist t 1 7 t2 E Z such that a 1 = b1 + mt1 and a2 = b2 + mt 2 . Then PROOF .
a 1 a2 = (b1 + mt 1)(b2 + mt 2 ) = b 1 b2 + m(hb2 + b1 t 2 + mt 1 t 2 ), and from 3.2 we obtain a1a2 = b 1 b2 (mod m) . If a = b (mod m) , we prove by induction on n that an = bn (mod m) . For n = 1 there is nothing to show. If an = bn (mod m) for some fixed n, we multiply this congruence with a = b (mod m) and obtain an . a = bn . b (mod m), hence an+ l = bn+ l (mod m), and this is the assertion for n + 1 . The proof by induction is now complete. If we multiply the congruences a = b (mod m) and c = c (mod m), we o obtain ac = be (mod m).
(iii) Both sides of a congruence can be divided by a common divisor, as long as this divisor is relatively prime to the modulus. PROOF. We assume that a = b (mod m) , a = a1 d, b = b 1 . d, and ( m, d) = 1. By 3.2 the difference a - b = ( a1 - b 1 ) d is divisible by m. Since (m, d) = 1, by 1. 14.(ii) the number a1 - b1 is also divisible by m, and with 0 3.2 it follows that a1 = b 1 (mod m) . ·
·
(iv) Both sides of a congruence and its modulus can be simultaneously multiplied by the same natural number.
3 Congruences
191
If a = b (mod m), then by 3.2 there exists an integer t such that a = b + mt; hence for e E N we have ae = be + me · t, and using 3.2 again 0 we get ae = be (mod me) . PROOF.
(v) Both sides of a congruence and its modulus can be divided by a positive
common divisor.
We assume that a = b (mod m), a = a 1 · d, b = b 1 · d, m = m 1 · d, where d E N. By 3.2 there exists a t E Z such that a = b + mt, that is, a1 · d = b 1 · d + m 1 dt, which implies a1 = b1 + m 1 t; this means, by 3.2, that 0 a 1 = b 1 (mod m 1 ). PROOF.
(vi) If the congruence a = b holds with various moduli m 1 ,
it also holds modulo numbers.
[m 1 ,
•
•
•
, mk ] ,
•
•
.
, mk , then
the least common multiple of these
(mod m 1 ), a = b (mod m2 ), . . . , a = b (mod mk ), then by 3.2 the difference a - b is a common multiple of the mod uli m 1 , m2 , , mk , and is thus divisible by the least common multiple 0 [mb m2 , . . . , mk], which implies a = b (mod [m1, . . . , mk] ). PROOF.
If
.
a = b
•
•
(vii) If a congruence holds modulo m, then it also holds modulo d, where
d is any divisor of m.
If a = b (mod m) , then a - b is divisible by m, and therefore also D by the divisor d of m, which means that a = b (mod d). PROOF.
(viii) If one side of a congruence and its modulus are divisible by some
integer, then the other side will also be divisible by this integer.
We assume that a = b (mod m), with b = b1d, m = m 1d. Then by 3.2 there exists a t E Z such that a = b+ mt = b 1 d+m 1 dt = (b 1 +m 1 t)d, 0 and thus d I a . PROOF.
We remark that we have already used several properties of congruences without having taken note of this fact. For instance, 1.4. (i) can be rewritten as "if a = 1 (mod m) and b = 1 (mod m), then also ab = 1 (mod m) , '' which is a special case of the property in (ii) . This is, of course, not a coincidence. Any statement using congruences can easily be rewritten in terms of divisibilities. The usefulness of congruences lies therefore not in the fact that one could solve problems that could not be solved otherwise, but in the fact that they provide a very convenient notation. By making consistent use of this notation we can significantly simplify not only the exposition, but also certain arguments. This is a typical situation: Appropriate notation plays a very important role in mathematics.
192
3. Number Theory
3.4 Examples (i} Find the remainder when 5 20 is divided by 26. SOLUTION. Since 52 = 25 = -1 (mod 26) , we have by 3.3.(ii),
5 20 = ( -1) 10 = 1 ( mod 26), 0 so the desired remainder is 1. (ii) Show that for any n E N, 3�+ 2 + 16n+ 1 + 23n is divisible by 7. SOLUTION. Since 37 = 16 = 23 2 ( mod 7), by 3.3. (ii) and (i) we have 3�+2 + 16n+ 1 + 23n = 2n+2 + 2n+ 1 + 2n = 2n (4+2+1) = 2n 7 = 0 ( mod 7), =
·
0
which was to be shown.
(iii) Show that n = (8355 + 6) 18 - 1 is divisible by 112.
SOLUTION. We factor 1 12 = 7 16. Since (7, 16) = 1, it suffices to show that 7 1 n and 16 1 n. We have 835 = 2 ( mod 7), and thus by 3.3, ·
38 18 - 1 = 3 18 - 1 ( mod 7); = 276 - 1 = ( - 1) 6 - 1 = 0 hence 7 1 n. Similarly, 835 = 3 ( mod 16) , and thus n = (35 + 6) 18 - 1 = (3 81 + 6) 18 - 1 = (3 1 + 6) 1 8 - 1 1 = 9 8 - 1 = 819 - 1 = 1 9 - 1 = 0 ( mod 16); hence 16 I n . Together, 1 12 1 n , which was to be shown. n = (25 + 6) 18 - 1
=
·
·
0
(iv) Show that no number of the form 8k ± 3, k E N, can be expressed in the form x2 - 2y2 for any integers x, y. SOLUTION. Assume that x2 -2y2 = 8k±3 for some x, y E Z. Then x must be an odd number, and therefore x2 = 1 ( mod 8) by 1.5 . ( ii). If y is also odd, then x2 - 2y2 = 1 - 2 = -1 ( mod 8). If y is even, then 2y2 = 0 ( mod 8), and thus x2 - 2y2 - 1 ( mod 8). In neither case do we have x2 - 2y2 = ±3 0 (mod 8), and this is a contradiction.
(v} Show that for any prime p and any a, b E Z we have
aP + QP = (a + b) P (mod p). SOLUTION. By the binomial theorem we have
(a + b)P = aP +
(i) ap- 1 b + (;) aP- 2b2 + . . . + � P 1 ) ab"- 1 +
b" .
3 Congruences
For any k E { 1, . . . , p - 1 } we have implies the assertion.
(�) = 0
193
(mod p) by 2.3. (iv ) , and this D
(vi) Show that for any natural number m and any a, b E
(mod mn ), where n E N, we have am = bm (mod mn+ 1 ).
Z such that a = b
SOLUTION. By identity (5) in Chapter 1 we have
am - bm = (a - b)(am- 1 + am-2b + · · · + abm- 2 + bm - 1 ).
(12)
E N it follows that m I mn, and so by 3.3. (vii) we have a = b ( mod m). Hence all the summands in the right-hand expression in parentheses in ( 12) are congruent to am - 1 modulo m, and thus
From
n
am- 1 + am-2 b + + abm- 2 + bm - 1 = m · am- 1 = 0 ( mod m). Therefore, am- 1 + am- 2 + · · · + abm- 2 + bm- 1 is divisible by m. From a = b ( mod mn ) it follows that mn divides a - b, and thus mn+ 1 di vides the product, which by (12) leads to the conclusion that am = bm D (mod mn+ 1 ). ·
·
·
3. 5 Exercises Show that (i) the number 260 + 730 is divisible by 13; (ii) for any n E N, 722n+ 2 - 472n + 282n- 1 is divisible by 25; (iii} for any k, m, n E N, 55k+ 1 + 45m+2 + 35n is divisible by 11; (iv) for any integers a, b, the congruence a2 + b2 = 0 ( mod 3 ) implies a = b = 0 (mod 3) ; (v) for any integers a, b, the congruence a2 + b2 = 0 ( mod 7) implies a = b = 0 ( mod 7); (vi) there exist integers a, b such that a2 + b2 = 0 ( mod 5), while a = b = 0 ( mod 5) does not hold; (vii) for any integers a , b, c, the congruence a3 + b3 + c3 = 0 ( mod 9) implies abc = 0 ( mod 3) ; (viii) for any integers a�, a2 , . . . , a7, the congruence a� +a� + · · · +a� = 0 ( mod 9) implies a 1 a2 · · · a7 = 0 (mod 3) ; * (ix) no integer a satisfies a2 + 3a + 5 = 0 ( mod 121). (x) Find all natural numbers n such that n · 2n + 1 is divisible by 3. (xi) Determine whether there exists a natural number n such that the difference 4n - 2n- 1 is the third power of an integer.
194
3. Nwnber Theory
1, 2, . . . , 12 on the circum ference of a circle in such a way that for any three neighbors a, b, and c, with b between a and c, the number b2 - ac is divisible by 13. Show that 19 sn + 17 is composite for any natural number n. Show that (n - 1) 2 is a divisor of nn - n2 + n - 1 for any natural number n. Let a, ao , a h . . . , an be integers (n E No ). Determine whether it is
(xii) Show that one ca'il place the numbers
* (xiii) * (xiv) * (xv)
·
true that the integer
(a2 + 1) 0 a0 + (a2 + 1) 3 a 1 + (a2 + 1) 6 a2 + · · · + (a2 + 1) 3k ak is divisible by a2 + a + 1 (resp. a 2 - a + 1) if and only if ao - a1 + a2 · · · + ( -1) k - l ak- 1 + ( -1) k ak ·
-
is divisible by a2 + a + 1 (resp. a2 - a + 1).
3. 6 Euler's 1) are distinct primes and n�, . . . , nk E N, we define � (m) as follows: •
•
•
(13) If, in addition, we define �(1) = 1, we have a function � : N ---? N. We can easily convince ourselves that (13) can also be written as
( : J (1 - : J
� (m) = m · 1 -
···
and that for any relatively prime natural numbers m 1 , m2 we have � (m1 m2 ) = � (m1 ) � (m2 ). The reader should verify that the condition of relative primality of m 1 , m2 is indeed necessary. The clearest and most sug gestive representation of Euler's �function is given later by the assertion in 3.10.
3. 7 Examples (i) Show that for any n
E N we have � (4n + 2) = � (2n + 1).
SOLUTION. Since 2n + 1 is odd, the numbers 2 and 2n + 1 are relatively prime, and thus we have �(2 (2n + 1)) = � (2) · � (2n + 1). We are done if we realize that � (2) = L (More generally, for each prime p we have D �(p) p - 1.) ·
=
195
3 Congruences
E
m N for which cp( m) is odd. SOLUTION. We have cp(1) = cp(2) = 1. If m > 3, then m is divisible by an odd prime p, or m = 2n , n > 2 ( this follows from the decomposition of m into a product of primes) . In the first case, cp ( m) is divisible by the even number p - 1, and in the second case we have cp(m) = 2n- l , so cp(m) is always even. Therefore, the number cp(m) is odd only when m = 1 or D m = 2. (iii) Solve the equation cp(5 x ) = 100, where x is a natural number. SOLUTION. By (13) we have cp(5x ) = 4 · 5x- 1 ; we therefore have to solve the equation 4 · 5 x - 1 = 100, i.e., 5x - 1 = 5 2 , which means x - 1 = 2, or D x = 3. (iv) Show that for any m, n N and d = ( m, n ) we have (ii) Find all
E
cp(mn) = cp( m) · cp(n) · d . cp(d) SOLUTION. We first assume that m = pa and n = pb , where p is a prime and a, b No. H a = 0, then m = 1, d = 1, cp(d) = 1, and the assertion clearly holds. Similarly for b = 0. If a, b E N, then cp ( mn) = cp(pa+ b) = (p 1)pa+ b- 1 , and if we set c = min { a, b} ( i.e., c is the smallest of the numbers a, b), then d = pc and cp( m ) cp (n) . cp d) = (p - l)p" - 1 . (p - l)pb- 1 . P"- 1 - 1) = (p _ 1)pa+b- 1 ,
E
_
�
r;
E
and thus the assertion holds. Let now m, n N be arbitrary. We write m = pa1 1 · · · Pak�e , n = pb11 · · · Pbk�e , where a� , . . . , ak , b� , . . . , bk .11M"qo and Pb . . . , Pk are distinct primes. If we set <; = min { ai , bi} for i = 1, . . . , k, then c�e c1 · · Pk d · P 1 �e �e b b1 a a1 cp ( m) cp (n ) · -cp( d) = cp(P1 · · · Pk ) cp(P1 · · · Pk ) · cp(pc11 · · · Pck�e )
E
el P1 b1e b . a a = cp(P1 1 ) · · · cp (pkn ) cp (p11 ) · . · cp (pk ) cp(p l ) � =
c1e Pk
cp(p��e )
(cp(p�' )cpM' ) cp�;, ) ) . . . (cp(p�· )cp(p�· ) cpr;�. ) )
•
and so by the first part of the proof we have cp( m) cp (n) · cp(dd) = cp(Pa1 1 Pb11 ) · · · cp (Pak�e Pbk�e )
= cp(Pa1 1 Pb11 · · · Pak�e Pbk�e ) = cp (mn) ,
which was to be shown.
D
196
3. Number Theory
3. 8 l?xercises (i) Evaluate �(1000) , �(635) , �(1 80), �( 360 ) , �(1001) . (ii) Show that for any n E N we have either �(5n) = 5�(n) , or �(5n) = 4�( n) . When does each case occur? Solve the equations ( iii)- (xiv ) , where x, y E No " m E N and p, q are primes: ( iii} (v} (vii) (ix) (xi} (xiii)
�(px ) = px- 1 . �(px ) = 6px - 2 . �(pm) = � (m). �(pm) = � (qm). �(m) = 16. �(m) = m/3.
(iv) (vi) (viii) (x) (xii) (xiv)
�( 3 X5Y) = 600. �(pq) = 120. �(pm) = p� (m). �(m) = 14. �(m) = m/2. �(m) = m/4.
(xv) Show that �(m n) = (m, n) · �([m, n] ) for any m, n E N. + �(pn ), where p is a (xvi) Evaluate the su m �(1) + �(p) + �(p2 ) + prime and n E N. * (xvii) Show that ·
·
where d�, d2 , number m.
.
.
•
·
·
, ds are all the positive divisors of the natural
3. 9 Another Property of Euler 's
Let t and m be natural numbers. Among the integers 1, 2, . . . , there are exactly t · �(m) that are relatively prime to m. PROOF. We write m = p� 1 • p�k , where Pl , . . . , Pk are distinct primes and n �, . . . , nk E N. We prove the theorem by induction on k. If k = 0, then m = 1, �(m) = 1, and the theorem is clearly true, since
Theorem. tm - 1, tm
•
•
any integer is relatively prime to 1 . We now assume that k > 1 and that the theorem is true for m' = p�1 • • • p�:_11 • Then tm = tp�k · m', and by the induction hypothesis, among the integers 1 , 2, . . . , tm - 1, tm there are exactly tp�k �(m') num bers relatively prime to m'. Since Pk is prime, the numbers that have a factor in common with p�k are exactly those divisible by Pk , namely Pk , 2pk , . . . , (tp:k - 1 m' - 1)pk , tp:k - 1 m'Pk · Since (pk , m') 1 , by 1 .15. ( iii) we have (apk , m') = (a, m') for any a E Z, and thus among these integers there are exactly as many relatively prime to m' as there are among the integers 1 , 2, . . . , tp:k- 1 m1 - 1, tp:k - 1 m'; by the induction hypothesis their number is exactly tp:k - �( m') . We have thus shown that among the in tegers 1, 2, . . . , tm there are exactly tp�k �(m') that are relatively prime ·
=
.l
•
·
3 Congruences
to m', and remaining
tpa lc - 1cp(m')
of tho�e have a factor in common with
p�lc ;
197
the
numbers are thus relatively prime to p�lc . It remains to convince our selves that a number is relatively prime to m if and only if it is relatively prime to m' and at the same time to p�lc ; this follows, for example, from
0
2.11.(ii).
3. 1 0 An A lternative Definition Consequence.
prime to m. PROOF.
Exactly cp(m) of the numbers 1, 2, . . . , m are relatively
The statement follows from 3.9 with t
0
= 1.
We remark that usually the property in 3.10 is used as definition of the number cp(m), and then there is no need to prove it. This approach, however, requires the proof of formula ( 13), which is just as difficult as the proof of our Theorem 3.9.
3. 1 1
Fermat 's Theorem
For any prime p and any integer a we have aP = a (mod p) . If furthermore (a, p) = 1, then aP- 1 1 (mod p) . Theorem.
=
We first assume that a > 0, and we prove the assertion by induction on a . H a = 0, then aP = 0 = a , so certainly aP = a (mod p). We now assume that a > 1 and that (a - 1) P = a - 1 (mod p), i.e., the statement of the theorem holds for a - 1. Then by 3.4.(v) we have PROOF.
and so the statement is also true for a. It remains to show that aP = a (mod p) for a < 0 . By 1.3 there exist q Z, r { 0, 1, . . , p - 1 } such that a = qp + r. Then by 3.3.(ii) and the fact that the theorem was proved for any r > 0, aP = (qp + r)P = rP = r = a (mod p).
E
If furthermore (a, p) = 1, then from 3.3. (iii) that aP- 1 = 1 (mod p) .
E
a · aP- 1
.
=
a
(mod p) we see with
0
198
3. Number Theory
3. 12 Fermat 's Theorem for Prime Powers
For any prime p, any n E N, and an arbitrary integer a relatively prime to p we have
Consequence.
We use induction on n. If n = 1, then this is the seco�d part of Theorem 3. 11. We assume now that n > 1 and that the statement holds for n 1, i.e., PROOF .
-
By 3.4. (vi) we have
(aPn - 2 (p- l) ) P = aPn- l (p- 1 )
=
1 (mod pn ),
0
which was to be shown.
3. 13 Euler's Theorem
For any natural number m and any integer a relatively prime to m we have a'P(m) = 1 (mod m). PROOF. We write m = p� 1 · p� k , where Pl , . . . , Pk are distinct primes and n 1 , . . . , nk E N. Then for any i E {1, . . . , k} we have by 3.12,
Theorem.
·
·
Raising this to the positive integer power cp(m/p�i ), with 3.3.(ii) we obtain
a'P(m)
=1
(mod p�i ) ,
since from t4e definition of Euler' s function it follows that
(�)
'P p '
·
pf' - 1 · (pi - 1) =
In view of the fact that [p� \ . . . , p�k ]
=
m, with 3.3.(vi) we now obtain
a'P(m) = 1 (mod m). 3. 14 Examples (i) Show that for any integers a, b satisfying (a, 65) a12 - b12 is divisible by 65.
0
=
(b, 65), the number
3 Congruences
199
SOLUTION. Since 65 = 5 13, it suffices to show that (a, 13) = (b, 13) implies 13 I a 1 2 - b12 an