Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
1K views343 pages

Problem Solving PDF

Uploaded by

Cindy Bonono
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
1K views343 pages

Problem Solving PDF

Uploaded by

Cindy Bonono
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 343
Problem Books in Mathematics Series Editor: P.R. Halmos Unsolved Problems in Intuitive Mathematies, Volume I: Unsolved Problems in Number Theory by Richard K. Guy 1981. xviii, 161 pages. 17 illus. ‘Theorems and Problems in Functional Analysis by A.A. Kirillov and A.D. Gvishiani (trans. Harold H. MeFaden) 1982. ix, 347 pages. 6 illus. Problems in Analysis by Bernard Gelbaum 1982. vii, 228 pages. 9 illus. A Problem Seminar by Donald J. Newman 1982. viii, 13 pages. Problem-Solving Through Problems by Loren C. Larson 1983. xi, 344 pages. 104 illus. Loren C. Larson Problem-Solving Through Problems With 104 Iustrations Springer-Verlag S$ New York Berlin Heidelberg Tokyo Loren C, Larson Department of Mathematics St. Olaf College ‘Northfield, MN 55057 USA. Editor Paul R. Halmos Department of Mathematics Indiana University Bloomington, IN 47405 USA. AMS Classification (1981): 00407 Library of Congress Cataloging in Publication Data Larson, Loren C,, 1937- Problem-solving through problems. (Problem books in mathematics) 1. Mathematies—Problems, exereses, etc. 1. Title, IL Series. QAGL37 1983 51082-19493 Problem solving. (© 1983 by Springer-Verlag New York Inc. All rights reserved. No part of this book may be translated or reproduced im any form without writen permission from Springer-Verlag, 175 Fifth Avenue, New York, New York 10010, USA. ‘Typeset by Computype, St. Paul, Minnesota Printed and bound by R. R. Donnelley & Sons, Harrisonburg, Virginia. Printed in the United States of America. 987654321 ISBN 0-387-90803.X Springer-Verlag New York Berlin Heidelberg Tokyo ISBN 3-540.90803-X Springer-Verlag Beclin Heidelberg New York Tokyo To Elizabeth Preface ‘The purpose of this book is to isolate and draw attention to the most important problem-solving techniques typically encountered in undergradu- ‘ate mathematics and to illustrate their use by interesting examples and problems not easily found in other sources. Each section features « single idea, the power and versatility of which is demonstrated in the examples and reinforced in the problems. The book serves as an introduction and snide to the problems literature (€.. as found in the problems sections of undergraduate mathematics journals) and as an easily accessed reference of, ‘essential knowledge for students and teachers of mathematics. “The book js both an anthology of problems and 2 manual of instruction, Ir contains over 700 problems, over one-third of which are worked in de Each problem is chosen for its natural appeal and beauty, but primasily for its unique challenge. Each is included to provide the context for illustrating 4 given problem-solving method. The sim throughout is to show how a basic set of simple techniques can be applied in diverse ways to solve an enormous variety of problems. Whenever possible, problems within sections are chosen to cit across expected course boundaries and to thereby strengthen the evidence that a single intuition is capable of broad applica tion, Each section concludes with “Additional Examples" that point to other contexts where the technique is appropriate. ‘The book is written at the upper undergraduate level. Tt assumes a rudimentary knowledge of combinatorics, number theory, algebra, analysis, ‘and geometry. Much of the content is accessible to students with only a year of calculus, and a sizable proportion does not even require this. However, most of the problems are at 2 level slightly beyond the usual contents of textbooks. Thus, the material is especially appropriate for students preparing for mathematical competitions. vm Preface ‘The methods and problems featured in this book are drawn from my ‘experience of solving problems at this level. Each new issue of The American Mathematical Monshly (and other undergraduate journals) con- tains material that would be just right for inclusion. Because these ideas ‘continue to find new expression, the reader should regard this collection as a starter set and should be encouraged to create @ personal file of problems and solutions to extend this beginning in both breadth and depth. Obvi- ‘ously, we can never hope to develop a “system” for problem-solving; however, the acquiring of ideas is a valuable experience at all stages of development Many of the problems in this book are old and proper referencing is very difficult. 1 have given sources for those problems that have appeared more recently in the literature, citing contests whenever possible, I would appreci- ate receiving exact references for those Ihave not mentioned. T wish to take this opportunity 10 express my thanks to colleagues and students who have shered many hours of enjoyment working on these problems. In this regard I am particularly grateful 10 O. E. Stenaitis, Professor Emeritus of St. Olaf College. Thanks to St. Olaf College and the Mellon Foundation for providing two summer grants to help support the ‘writing of this manuseript. Finally, thanks 0 all individuals who contcib- uted by posing problems and sharing solutions. Special acknowledgement goes to Murray $. Klamkin who for over a quarter of a century has stood 4s a giant in the area of problem-solving and from whose problems and solutions T have Jeamed a great deal. March 21, 1983 Lowes C. Larson Contents lagter 1. Howie th 13. 14. 1s. 16. 17. 18, 19. 110, LLL. Search for a Pattern Draw a Figure Formulate an Equivalent Problem Modify the Problem Choose Effective Notation Exploit Symmetry Divide into Cases Work Backward ‘Argue by Contradiction Pursue Parity Consider Exireme Cases 1.12. Generalize Copter 2. wo laportant Principles: Induction snd Pigsonhole Fry 23. 24. 25, 26. Induction: Build on P(A) Induction: Set Up P(E + 1) Strong Induction Induction and Generalization Recursion Pigconhole Principle Chapter 3. Arithmetic 3. 32. Greatest Common Divisor Modular Arithmetic PSSSSSSOR Gene 38 o 4 7” 84 a x Contents 3.3. Unique Factorization 100 3.4. Positional Notation 106 3.5. Arithmetic of Complex Numbers 14 120 I 42. Unique Factorization of Polynomials 125 43. ‘The Identity Theorem 132 44, Abstract Algebra 144 ‘Chaner 5. Sammaton of Series 154 Binominal Coefficients 154 52, Goomeure Sres 164 5.3. Telescoping Series 170 5A. Power Series 176 (Chapter 6. Intermediate Real Analysis 192 6.1. Continuous Funetions 192 62. The Intermediate-Value Theorem 198 63, The Derivative 203, 64. The Extreme-Value Theorem 206 6.5. Rolle’s Theorem 20 6.6. The Mean Value Theorem 216 67. L’H6pital’s Rule 25 68. The Integral 227 69, The Fundamental Theorem 234 ager. Nnaien m1 Basic Inequality Properties 241 72, Ashmetee Mean. Geomere-Mesn Inequality 248 73. Cauchy-Schwarz Inequality 254 7.4. Functional Considerations 259 73, Inequalities by Series 268, 76, ‘The Squeeze Principle mn ‘Chapter 8 Geometry 230 8.1. Classical Plane Geometry 280 82. Analytic Geometry 291 8.3. Vector Geometry 299 84, Complex Numbers in Geometry 312 ‘Conese xi Glossary of Symbols and Definitions 37 ‘Sources 319 Index 331 Chapter 1. Heuristics Strategy or tactics in problem-solving is called heuristics. In this chapter we will be concerned with the heuristies of solving mathematical problems. ‘Those who have thought about heuristics have described a number of basic ideas that are typically useful. Among these, we shall focus on the follow- ing: (0) Search for a pattern, (2) Draw a figure. 3) Formulate an equivalent problem. (4) Modify the problem, (5) Choose effective notation, (6) Exploit symmetry. (2) Divide into cases. (8) Work backward. (9) Argue by contradiction. (10) Pursue parity. (UD Consider exireme cases. (12) Generalize. ‘Our interest in this list of problem-solving ideas is not in their descrip- tion but in their implementation. By looking at examples of how others have used these simple but powerful ideas, we can expect to improve our problem-solving skills. Before beginning, a word of advice about the problems at the end of the sections: Do not be overly concemed about using the heuristic treated in that section. Although the problems are chosen to give practice in the use ‘of the heuristic, a narrow focus may be psychologically debilitating.“ A single problem usually admits several solutions, often employing quite 2 1. eoristies different heuristics. Therefore, itis best to approach each problem with an ‘open mind rather than with a preconceived notion about how a particul heuristic should be applied. In working on a problem, solving it is what ‘matters. It is the accumulated experience of all the ideas working together that will result in a heightened awareness of the possibilities in a problem. 1.1. Search for a Pattern Virtually all problem solvers begin their analysis by getting a feel for the problem, by convincing themselves of the plausibility of the result. This is best done by examining the most immediate special cases; when this exploration is undertaken in a systematic way, patterns may emerge that will suggest ideas for proceeding with the problem, AA. Prove that a set of m (different) elements has exactly 2" (different) subsets, ‘When the problem is set in this imperative form, a beginner may panic and not know how to proceed. Suppose, however, that the problem were cast as a query, such as (i) How many subsets can be formed from a set of n objects? Gi) Prove of disprove: A set with m elements has 2” subsets. In either of these forms there is already the implicit suggestion that one should begin by checking out a few special cases. This is how each problem should be approached: remain skeptical of the result until convinced. Solution 1, We begin by examining what happens when the set contains 0,1,2,3 elements; the results are shown in the following table: Elements Number of n of S Subsets of S subsets of S 0 none @ T Tox 2 (x1) 2 2 oxye {xi Ga} (te ¥a) 4 Boxpxpta (my) (rhs (utah 8 Aaah nas}, Cents) (ta) (Our purpose in constructing this table is not only to verify the result, but ‘also to Took for patterns that might suggest how to proceed in the general 1, Seareh fora Patera 3 case. Thus, we aim to be as systematic as possible. In this case, notice when = 3, we have listed first the subsets of (x,,x3} and then, in the second line, each of these subsets augmented by the element x,. This is the key idea that allows us to proceed to higher values of n. For example, when n= 4, the subsets of S = (xy, x3,%),%2} are the eight subsets of {x,%3,%3} ‘(shown in the table) together with the eight formed by adjoining x, to cach of these. These sixteen subsets constitute the entire collection of possibili- ties; thus, a set with 4 elements has 2* (= 16) subsets. ‘A proof based on this idea is an easy application of mathematical induction (see Section 2.1). Solution 2, Another way to present the idea of the last solution is to argue as follows. For each n, let 4, denote the number of (different) subsets of a set with 1 (different) elements. Let $ be a set with + elements, and designate one of its elements by x. There is a one-to-one correspondence between those subsets of $ which do not contain x and those subsets that do contain x (namely, a subset 7 of the former type corresponds to T U(x). The former types are all subsets of S— {x}, a set with elements, and therefore, it must be the case that Ayes = 2Ay. ‘This recurrence relation, true for =0,1,2.3,---, combined with the fact that 4j= 1, implies that A,— 2". (4, = 24,;= 24, pees = 2g =2) Solution 3. Another systematic enumeration of subsets can be cartied out by constructing a “tree”. For the case n = 3 and S= (a,b,c}, the tree is as shown below: Sate ¢ a3 a =, “The final step in this chain of equalities follows from the binomial theorem, Gtyt= BE)" &o pon setting x = Tandy = 1. Solution 5. Another systematic beginning is illustrated in Table 1.1, which lists the subsets of S= (x,,p,.t5}. To understand the pattern here, notice the correspondence of subscripts in the leftmost column and the occurrence Table 1 Subset Tale Binary number Decimal number 6 0.0.0) ° ° bs) 0, 1 i b} @.1.0) 10 2 Gre} OLD u 3 Gy (1.0.0) 100 4 (xn) 4.0, 01 3 (122) a1,0) 10 6 Gas) OED m 7 1. Search for ® Pause 5 of 1's in the second column of triples. Specifically, if A is a subset of SH (xy pee yh define g, for d= 1,2,.-..m BY Uf if ge, "lo it g@a Itis clear that we can now identify a subset 4 of S with (ay,aq, ~~, a,), am ntuple of 0's and I's. Conversely, each such n-tuple will correspond to a unique subset of S. Thus, thé number of subsets of 5 is equal to the umber of n-tuples of 0's and I's. This latter set is obviously in one-to-one correspondence with the set of nonnegative binary numbers less than 2". Thus, each nonnegative integer less than 2" corresponds to exactly one subset of S, and conversely. Therefore, it must be the case that S has 2° subsets Normally, we will give only onc solution to each example—a solution which serves to illustrate the beuristic under consideration, In this first example, however, we simply wanted to reiterate the carlier claim that a single problem can usually be worked in a variety of ways. The lesson to be earned is that one should remain flexible in the deginning stages of problem exploration. If an approach doesn’t seem to lead anywhere, don't despair, but search for a new idea. Don't get fixated on a single idea until you've had a chance to think broadly about a variety of alternative approaches. LI.2. Let S,o, S,.. and S,» denote the sum of every third element in the nth row of Pascal's Triangle, beginning on the left with the first element, the second clement, and the third element respectively. Make @ conjecture concerning the value of Sq. Solution, We begin by examining low-order cases with the hope of finding patterns that might generalize, in Table 1.2, the nonunderlined terms are those which make up the summands of 5,9; the singly underlined and Table 12 6 1. Hewistes doubly underlined terms are those of S, and S,», respectively. The three ‘columns on the right show that, in each case, two of the sums are equal, ‘whereas the third is either one larger (indicated by a superscript +) or one smaller (indicated by a superscript —). It also appears that the unequal term in this sequence changes within a cycle of six. Thus, from the pattern established in the first rows, we expect the anomaly for n= 8 to occur in the middle colurnn and it will be one’ n the other two. We know that Syo+ Sy + Syq = 2" (see I.1). Since 100= 6x 16 +4, we expect the unequal term to occur in the third column (Sigo,) and to be cone more than the other two. Thus Sioo0 = Stn1 = Stoo2— 1. and Sion + Syooa + Signi + |= 2", From these equations we are led to conjecture that =2 at Sq = +. A formal proof of this conjecture is a straightforward application of mathematical induetion (see Chapter 2). 13, Let xy, %2,3, be a sequenice of nonzero real numbers satisfying. Saati n=34,5, em Establish necessary and sufficient conditions on x, and x, for x, to be an integer for infinitely many values of 2. Solution. To get a feel for the sequence, we will compute the first few terms, expressing them in terms of x, and x2. We have (omitting the algebra) ‘We are fortunate in this particular instance that the computations are manageable and a paitern emerges. An easy induction argument establishes hat x 2% "GDR Om which, on isolating the coefficient of », takes the form *iX2 "Ga aet a LA, Search for Pattern 7 In this form, we see that if x1 % x2, the denominator will eventually exceed the numerator in magnitude, so x, then will not be an integer. However, if x, = X, all the terms of the sequence are equal. Thus, x, is an integer for infinitely many values of m if and only if x, = x3. 1,14, Find positive numbers n and aj,a;,-..,a, such that a, + +--+ a, = 1000 and the product aa, - a, is as large as possible Solution, When 2 problem involves a parameter which makes the analysis complicated, itis often helpful in the discovery stage to replace it temporar- ‘iy with something more manageable, In this problem, we might begin by ‘examining a sequence of special cases oblained by replacing 1000 in turn with 2,3,4,5,6,7.8,9, .... In this way we are led to discover that in a maximurn product (i) no a, will be greater than 4, Gi) 20 a, will equal t, Gi) all a's can be taken to be 2 or 3 (because 4= 22 and 4=2-+ 2), (Gv) at most two as will equal 2 (because 2X2. 2<3X3and2+2+2 =34+3), Each of these is easy to establish. Thus, when the parameter is 1000 as in the problem at hand, the maximum product must be 3? x 2% LAS, Let $ be a set and + be binary operation on S satisfying the two das xexex for all x in S, (eryprze(yezyex — forallx, yzinS. Show that xe) = yx for all x, yin S. Solution, The solution, which appeats so neatly below, is actually the end result of considerable scratch work; the procedure can only be described as, 4 search for pattern (the principle pattern is the cyclic nature of the factors in the second condition). We have, for all x, y in S, x+y = (x+y)+(x*y) = [etGeylex = (epeatey = (eexexdey = [aexyeyley = [ey leea) apex Problems Develop a feel for the following problems by searching for patterns. Make appropriate conjectures, and think about how the proofs might be carried out, 8 1. Heuristics 1.1,6, Beginning with 2 and 7, the sequence 2,7,1,4,7,4,2,8... is con- structed by multiplying successive pairs of its members and adjoining the result as the next one or two members of the sequence, depending on whether the product is a one- or a two-digit number. Prove that the digit 6 appears an infinite number of times in the sequence. LA,7, Let $, denote the sequence of positive integers 1,2,3,4,5,6,--. 5 and define the sequence S, ., in terms of S, by adding | to those integers in S, which are divisible by m. Thus, for example, S, is 2,3,4,5,6,7,..., Sy) is 3,3,5,5,7,7, ..... Determine those integers with the property that the first n'— I integers in S, are n. 1.1.8, Prove that a list can be made of all the subsets of a finite set in such away that (i) the empty set is First in the list, (i) each subset occurs exactly once, and Gi) each subset in the list is obtained either by adding one element to the preceding subset or by deleting one element of the preceding subset, 1.1.9, Determine the number of odd binomial coefficients in the expansion of (x + yy! (ee 4.3.5.) 1.1.10, A well-known theorem asserts that a prime p > 2 can be written as a sum of two perfect squares (p= m? + n?, with m and integers) if and only if p is one more than a mulliple of 4. Make a conjecture concerning which primes p >2 can be written in each of the following forms, using (not necessarily positive) integers x and y: (a) x? + 16,2, (b) 4x? + 4xy + 572, (See 1.5.10.) LALIL. If (a,> is @ sequence such that form > 1, 2—a,)a,44= 1, what happens toa, as n tends toward infinity? (See 7.6.4.) ‘1.1.12, Let S be a set, and let * be a binary operation on § satisfying the laws yex xe(xey)=y — forallx, yin S, Gexexsy — forallx,yins. © eT PG Show that x¢y = ye.x forall x,y in S. nat 4) ye oral = sifpers sou 3 Most induction problems are based on the discovery of a pattern. Thus, the problems in Sections 2.1, 22, 23, 2.4 offer additional practice im this heuristic, Also see 1.7.2, 1.7.7, 1.78, 2.5.6, 3.11, 346, 43.1, 44.1, 443, 44.15, 44.16, 4.4.17. Additional Examples * 1.2. Draw a Figure 9 1.2. Draw a Figure ‘Whenever possible it is helpful to describe a problem pictorially, by means ‘of a figure, a diagram, or a graph. A diagrammatic representation usually makes it casier (0 assimilate the relevant data and to notice relationships and dependences. 1.21, A chord of constant Iength slides around in @ . The midpoint of the chord and the projections of its ends upon the base form the vertices of a triangle. Prove that the triangle is isosceles and never changes its shape. Solution, Let AB denote the base of the semicircle, et XY be the chord, M the midpoint of XY, C and D the projections of X and ¥ on AB (Figure 1.1), Let the projection of M onto AB be denoted by N. Then W is the midpoint of CD and it follows that A CMD is isosceles. To show that the shape of the triangle is independent of the position of the chord, it suffices to show that 2 MCD remains unchanged, or equiva- Jently, that 2 XCM is constant, for all positions of XY. To see that this is the case, extend XC to cut the completed circle at Z (Figure 1.2). Then CM is parallel to ZY (C and M are the midpoints of XZ and XY, respectively), x tee “x 10 1, Heoristies and consequently ZXCM = 2 XZY. But 2 XZY equals one-half the arc XY, and this are depends only on the length of the chord XY. This ‘completes the proof. ‘One might ask: How in the world did anyone ever think to extend XC in this way? This is precisely the step that makes the argument so pretty, and itis indeed a very difficult step to motivate. About all that can be said is that the use of auxiliary lines and ares (often found by reflection, extension, cr rotation) is a common practice in geometry. Just the awareness of this fact will add to the possible approaches in a given problem, ‘Another interesting approach to this problem is to coordinatize the points and to proceed analytically. To show that the shape of the triangle is, independent of the position of the chord, it suffices to show that the height-to-base ratio, MN'/CD, is constant, Let © denote the midpoint of AB, and let @ = 2 YOB, ICis clear that the entire configuration is completely determined by @ (Figure 1.3). Let a= ZXOY. Using this notation, €D = c0s8 ~ cos(0 + a), sind + sin(@ + a) —_{ MN = and the height-base ratio is sin# + sin(@ + «) eos — cos(+ ah) * is not immediately clear that this quantity is independent of @; this is the content of 1.8.1 and 646.7. Fo) = 0<8 [*] = 4(No. of lattice points in the interior of ABCD ) ms (a= =) or. 1.24 (The handshake problem). Mr. and Mrs. Adams recently attended a party at which thete were three other couples, Various handshakes took place, No one shook hands with his/her own spouse, no one shook hands with the same person twice, and of course, n0 onc shook his/her own hand. ‘After all the handshaking was finished, Mr. Adams asked each person, including his wife, how many hands he or she had shaken, To his surprise, cach gave a different answer. How many hands did Mrs. Adams shake? Solution. Although a diagram is not essemtial to the solution, it is helpful to view the data graphically in the following fashion. Represent the eight individuals by the eight dots as shown in Figure Now the answers to Mr. Adams’ query must have been the numbers 0,1,2,3,4,5,6. Therefore, one of the individuals, say 4, has shaken hands with six others, say B,C, D, E, F,G. Indicate this on the graph by drawing line segments from A to these points, as in Figure 1.8. From this diagram, we see that H must be that person who has shaken no one’s hand. Furthermore, 4 and H must be spouses, because 4 has ‘shaken hands with six others, not counting his/her own spouse. 12, Draw a Figure 13 A Figure 1.10, By supposition, one of B,C,D,£,F,G, has shaken five hands. By relabeling if necessary we may assume this person is B. Also, we may assume without loss of generality that the five with whom B has shaken bands are labeled A,C,D,£,F. This is shown in Figure 1.9. From this sketch we easily sce that G is the only person who could have answered “one”, and B and G must be spouses, Again, as before, by relabeling the points C,D,& if necessary, we may assume that C shook four hands and shat they belonged t0 4, 8,D,E. The corresponding diagram is given in Figure 1.10, Using the same reasoning as, above, F and C ate spouses, and consequently, D and £ are spouses. Each of D and £ has shaken hands with three others. Since Mr, Adams did not receive two “three” answers, D and E must correspond to Mr. and Mrs. Adams; that is to say, Mrs. Adams shook hands with three others. Problems 1.25, Two poles, with heights @ and b, are a distance d apart (along level wound). A guy wire stfetches from the {op of each of them to some point P fn the ground between them. Where should P be located to minimize the total length of the wire? (Mint: Let the poles be erected at points C and D, and their tops be labeled 4 and 2, respectively. We wish to minimize AP + PB. Avgment this disgram by reflecting it in the base line CD. 4 1. Heuristics Suppose B reflects to 8” (PB = PB‘). Now the problem is: Where should P be located to minimize AP + PB”) 1.2.6. Let ABC be an acute-angled triangle, and let D be on the interior of the segment AB, Locate points £ on AC and F on CB such that the inscribed triangle DEF will have minimum perimeter. (Hint; Reflect D in line AC to a point D’; reflect D in CB to a point D” and consider the line segment D'D",) 1.2.7, A rectangular room measures 30 feet in length and 12 feet in height, and the ends are 12 feet in width. A fly, with a broken wing, rests at a point ‘one foot down from the ceiling at the middle of one end. A smudge of food is located one foot up from the floor at the middle of the other end. The fly ‘has just enough energy to walk 40 feet. Show that there is a path along which the fly can walk that will enable it to get to the food. 1.28, Equilaterai triangles ABP and ACQ are constructed externally om the sides 4B and AC of triangle ABC. Prove that CP = BQ. (Hint: For a nice solution, rotate the plane of the triangle 60° about the point A, in a direction which takes B in the direction of C. What happens to the line segment CP?) 1.29, Let a and b be given positive real numbers with a < b. If two points are selected at random from a straight line segment of length b, what is the probability that the distance between them is at least a? (Hint: Let x and y denote the randomly chosen numbers from the interval [0,6], and consider these independent random variables on two separate axes. What area corresponds to |x — y| > a) 1.2.10. Give a geometric interpretation to the following problem. Let f be differentiable with f° continuous on [2,6]. Show that if there is a number ¢ in (a,b) such that f'(c) = 0, then we can find a number d in (a,b) such that fed) ~ fea) boa 12.11. Let a and b be real numbers, a O and ‘n> 0, (The latter number corresponds to the center of gravity of a system of two masses—one, of mass m, located at a, and the other, of mass m, located at b) 1.2.12, Use the graph of y = sinx to show the following. Given triangle ABC, (0) SDBESNC & gin BEC, f@= (0) Bbq tin + sinc < sin A B+ HAC) > 0,0 >0 13, Formulate an Equivalent Probie Is 1.2.13, Use a diagram (a rectangular array (a,2,)) to show that @) 3 Sag=F Sao, Bofo'? foizo 0) Be Sag. © (34) -3, Sae-23 Sag- Se re) Ba me Additional Examples Most of the problems in Chaper 8 (Geometry); also 1.3.11, 1.92, 11.3, 2.1.3, 25.5, 26.11, $12, 62.2, 6.4.1, 663, 681, 7.1.14, 7.4.19, 7.6.1, 81.1. 1.3. Formulate an Equivalent. Problem ‘The message of the preceding section is that the first step in problem solving is 10 gather data, 10 explore, to understand, to relate, to conjecture, to analyze, But what happens when it is not possible 10 do this in @ ‘meaningful way, either because the computations become to0 complicated for because the problem simply admits no special cases that shed any insight? In this section we will consider some problems of this type. The ‘recommendation of this section is to try to reformulate the problem into an equivalent but simpler form. The appeal is to one’s imagination and creativity. Some standard reformulation techniques involve algebraic or igonometric manipulation, substitution or change of variable, use of ‘one-to-one correspondence, and reinterpretation in the language of another subject (algebra, geometry, analysis, combinatorics, etc.) 13.1, Find a general formula for the,nth derivation of f(x) = 1/(1~ 2?) Solution. A common simplifying step when working with rational functions is to write the function as a sum of partial fractions. In this case, feo=a[ pty t Tes 16 1, Heres ‘and in this form it is easy to show that py aon ata 2| asa 13.2, Find all solutions of x44 x74 x7 +x +1=0. Solution. This equation can be solved by dividing by x7, then substituting yr x+1/x, and then applying the quadratic formula. Thus, we have 244 L x4 beet pt lag, (er2eb)s(ert}ea-ae (erdfelertyorne ‘The roots of this equation are ait ae 8, na temas 0 determine by soving he equations stlay and xttoy, hich ar equate tayxtl=0 and P-yxt1=0. The four roots found by solving these are -148 ,, lors ee +8 _ Vins 2s => 1-8 4 MIO 25 2 _ Yio- 25 a Another approach to this problem is to multiply cach side of the original equation by x = 1. Since (x — 1x4 + 2? 4 aF+ x+ 1) =x? = 1, an equiv x 1.3. Formolate an Equvaleat Problem 0 alent problem is to find all x (other than x = 1) which satisfy x* = 1, These are the Five fifth roots of unity, given by x = c0sir + ising, xy = cos $x + isindr, xy cos$a + isin$n, xy = costa + isin, As a by-product of having worked this problem two different ways, we see that det ininte 2 ES, 0+ OT conga + sings = EE 4 YAS Equating real and imaginary parts yields “128 nee Yio+35 cos 72° = 7 (Similar formulas can be found for x2, x3, and %,.) 13,3, P is a point inside a given triangle ABC; D, E,F are the feet of the perpendicular from P to the lines BC, CA, AB, respectively. Find all P for which Bl, A, AB PD * PE* PF is minimal. Solution, Denote the lengtbs of BC, AC, AB by a,b,c, respectively, and PD, PE, PF by p,qur, respectively (see Figute 1.11), We wish to minimize a/p+b/q+e/r. Figure 1.1, 18 1. Heoriti Notice that ‘Area ABC = Area ABCP + Area ACAP + Area AABP ~ fap + bbq + her grater 2 ‘Thos, ap + bq + cr is a constant, independent of the placement of P. ‘Therefore, instead of minimizing a/p+b/q+c/r, we will minimize (ap + bq + crka/p + b/q+c/n). (This step will appear more natural after a study of inequalities with constraints taken up in Section 7.3.) We have a en(S bad errorven(te des) wats he crt ab( 244) 4 bef 242) +ac( 244 sPreedlSs states a) re s+ 5) > abt tel + ab + 2be + 2ae =(atbtey. The inequality in the second step follows from the fact that for any two positive numbers x and y we have x/p +y/x > 2, with equality if and only if xy, As result of this fact, (ap + bg + crXa/p + 6/q + e/r) will tain its shinimum value (a+ 6+ ¢) when, and only when, p= q=r. Equivalently, a/p + b/q + ¢/7 attains a minimum value when P is located at the incenter of the triangle. 1.3.4, Prove that if m and n are positive integers and 1 < k < m, then Ss ynyy me ” ZTE") ‘Solution. The staterient of the problem constitutes one of the fundamental identities involving binomial coefficients, On the left side is a sum of products of binomial coefficients. Obviously, a direct substitution of facto- Fials for binomial coefficients provides no insight. ‘Quite often, finite series (especially those which involve binomial coeffi- cients) can be summed combinatorially. To understand what is meant here, transform the series problem into @ counting problem in the following manner. Let S= A U B, where A is a set with n elements and B is set, disjoint from 4, with m elements. We will count, in two different ways, the number of (distinct) A-subsets of 5, On the one hand, this number is ("2"). On the other hand, the number of k-subscts of S with exactly 7 elements 1.3. Formulaye an Equivalent Probes 9 from A (and k ~ / clements from B)is (7%¢%,). Ut follows that mon ("£") = No. of kesubsets of § = D (No. of k-subsets of S with i elements from 4) Paes ‘(Another solution to this problem, based on the properties of polynomials, is given in 4.3.2.) Counting problems can often be simplified by “identifying” (by means of & one-to-one correspondence) the clements of one set with those of another set whose elements can more easily be counted, The next three examples illustrate the idea, 1.35, On a circle n points are selected and the chords joining them in pairs are drawn. Assuming that no three of these chords are concurrent (except at the endpoints), how many points of intersection are there? Solution. The cases for 1 = 4,5,6 are shown in Figure 1.12. Notice that cach (interior) intersection point determines, and is determined by, four of the given n points along the circle (these four points will uniquely produce two chords which intersect in the interior of the circle). Thus, the number of intersection points is @)- 1.3.6. Given 2 positive integer m, find the number of quadruples of integers (a,b,e,d) such that 0< a2, a(n)=a(n- 1) + a(n 2). o 1.3.14. By finding the area of a triangle in two different ways, prove that if Pu Pa. Ps ate the altitudes of a triangle and r is the radius of its inscribed Sirele, then 1/p, + 1/p2 + V/py= l/r. 1.3.15, Use 2 counting argument to prove that for integers r,n,0< + T). Finally, let A(s) denote the depth of the snow at time f. ‘We are now ready to translate the problem into symbolic terms. The fact, ‘that the snow is falling at a constant rate means that the depth is increasing at a constant rate; that constant. cy a Integrating each side yields A(t) =er+d, ed constants, Since 4(0) = 0, we get d = 0. Thus h(i) = et ‘The fact that the plow removes snow at a constant rate means that the speed of the plow is inversely proportional to the depth at any time 1 (for ‘example, twicg the depth corresponds to half the speed). Symbolically, for eT, k-constant k= constant. ¢ Integrating each side yields x()= Klogr+C, — Ceonstam. ‘We are given three conditions: x= Owhen t= T, x =2when f= T +1, and x=3 when (= T+ 2. With two of these conditions we can evaluate the constants X and C, and with the third, we can solve for 7. It turns out (the details are not of interest here) that 8 r= Bot 2 ‘Thus it started snowing at 7:22:55 AM. 06618 hours ~37 minutes, 5 seconds, 15.2, (@) If nis a positive integer such that 2n + 1 isa perfect square, show that n+ Lis the sum of two successive perfect squares. (b) If 3n + 1 isa perfect square, show that 2 + 1 is the sum of three perfect squares, Solution. By introducing proper notation, this reduces to a simple algebra problem. For part (a), suppose that 2n + I = s?,s an integer. Since sis an odd number, #0 also is s. Let ¢ be an integer such that 5 = 2¢+ 1, Then In + 1= 2+ 1), and solving for n we find vad 2 ne CN staat ara 15. Choose Bitetive Notion 2 e 8 + © Figure 118 Consequently, . ne le2eaa ar a(ed ty (b) Suppose 3n + 1 = s?, s an integer. Evidently, s is not a multiple of 3, so $=31 + 1 for some integer 2, Then 3 +1 = (3¢ + 1)', and therefore 3rt1y—1 + OWA N s826 spam, ne Hence, melas eels Ws (ed RPO e (re YF 1.83, In triangle ABC, AB = AC, D is the midpoint of BC, F is the foot of the perpendicular drawn D to AC, and F is the midpoint of DE (Figure 1.15), Prove that 4F is perpendicular to BE. Soution, We can transform the problem into algebraic terms by coordi tizing the relevant points and by showing that the slopes mpg and my are negative reciprocals. ‘One way to proceed is to take the triangle as it appears in Figure. 1.15: take D as the origin (0,0), 4 = (0,a), B= (~ b,0), and C = (6,0), This is a natural labeling of the figure because it takes advantage of the bilateral symmetry of the isoseeles triangle (see the examples in Section. 1.6). How- ‘ever, in this particular instance, this notation leads to some minor complica tions when we look for the coordinates of E and F. A better coordinatization is to take A = (0,0), B = (40,46), C = (4e,0), as in Figure 1.16. Then a? + 6? =e, D= (2a-+ 2c,2b), E= 2a + 2c,0), and F~= (2a +2c,). (Almost no computation here; all relevant points arc coordinatized,) It follows that mame ( sag) a= dirag) ~ a and the proof is compicte. 28 1. Heanties > * Ee Figure 1.16 LSA, Let ~1 < ag <1 and define recursively a,\2 + n>0. Let A, = 4°(1 ~ a,). What happens to 4,, asm tends to infinity? Solution, Direct attempts to express a, in terms of dy lead to hopelessly complicated expressions containing nested sequences of radicals, and there is no way to condense themn into a closed form. ‘The Key insight needed is to observe that there is a unique angle @, O<@ 1 as x->0), and therefore, 4, converges to 62/2 as n tends to infinity. - aneo( £), 1.5. Choose Elective Notation » Problems 1.5.5. Write an equation to represent the following statements: (a) At Mindy’s restaurant, for every four people who ordered cheesecake, there were five who ordered sirudel. (b) There are six times as many students as professors at this college. 1.5.6. Guy wires are strung from the top of each of two poles to the base ‘of the other. What is the height from the ground where the two wires cross? 15.7. A piece of paper 8 inches wide is folded as in Figure 1.17 so that one ‘corner is placed on the opposite side. Express the length of the crease, L, in terms of the angle @ alone, LSB. Let P..Pp,-. +, Pip be the successive vertices of a regular dodecs- gon (twelve sides), Are the diagonals P,P), P,P,,.P4Pi2 concurrent? 15.9, Use algebra to support your answers to each of the following. (a) A car travels from 4 to B at the rate of 40 miles per hour and then returns from B to 4 at the rate of 60 miles pet hour. Is the average rate for the round trip more or less than 50 miles per hour? (b) You are given a cup of coffee and & cup of cream, each containing the ‘same amount of liquid. A spoonful of cream is taken from the cup and put into the coffee cup, then a spoonful of the mixture is put back into the cream cup. Is there now more or less cream in the coffee eup than ‘coffee in the cream cup? (This problem has an elegant nonalgebraic solution based on the observation that the coffee in the cream cup has displaced an equal amount of cream which must be in the coffee cup.) (©) Imagine that the earth is a smooth sphere and that a string is wrapped around it at the equator. Now suppose that the string is lengthened by six feet and the new length is evenly pushed out to form a larger circle just over the equator. Is the distance between the string and the surface of the earth more or less than one inch? Figure 1.1. 30 1 Hewristies 1.5.10. A well-nown theorem asserts that a prime p > 2 can be written as 4 sum of two perfect squares (p= m? + n®, with m and m integers) if and only if p is one more than a multiple of 4. Assuming this result, show that: (a) Every prime one more than a multiple of 8 can be written in the form x? + I6y2, x and y integers. (b) Every prime five more than a multiple of 8 can be written in the form Qe + yF + 4y2, x and y integers. Additional Examples L110, 2.5.10, 32.15, 33.11, 33.28, 342, 344, 41.5, 642, 7.24, 8.1.15, 823, 8.2.17. Also, see Sections 2.5 (Recurrence Relations), 3.2 (Modular Arithmetic), 3.4 (Positional Notation), 8.3 (Vector Geometry), 8.4 (Complex ‘Numbers in Geometry). 1.6. Exploit Symmetry The presence of symmetry in a problem usually provides a means for reducing the amount of work in arriving at 2 solution, For cxample, consider the product (a+ b+ ea? + 6? +c? ~ ab — ac ~ bc), Since each factor is symmetrical in a, b, ¢ (the expression remains unchanged when- ‘ever any pair of its variables are interchanged), the same will be true of the product, As a result, if a? appears in the product, so will & and c?. Similarly, if a% appears in the product, so will a’c, Ba, 0%, ca, c%, and cach will occur wilh the same coefficient, etc. Thus, a quick check shows the produet will have the form AO +P +0) + Bla’ + aie + bia t Be + Ca + cb) + C(abe), Ins an easy matter to check that A = 1, 8 =0, and C= ~3. 1.6.1, Equilateral triangles BK, BCL, CDM, DAN are constructed inside the square ABCD. Prove that the midpoints of the four segments KL, LM, MN, NK and the midpoints of the eight segments AK, BK, BL, CL, CM, DM, DN, AN are the twelve vertices of a regular dodecagon, Solution. The twelve vertices are indicated in Figure 1.18 by heavy dots; ‘wo of these vertices are labeled a and b as shown. Using the symmetry of the figure, it suffices to show that / BOK = 15°, La0b = 30°, and [a0{ = |60|. ‘Note that AN is part of the perpendicular bisector of BK, and therefore [KN |= |B], Using symmetry it follows that MBN is ‘an equilateral 16. Exploit Symmetry 31 Figure 18, triangle, say of side length s, and that £ CBN = 15%. Now consider triangle DBN; note that Ob joins the midpoints of DB and DN, so Ob is parallel to BN and half its length. Thus |O6| = s/2 and 2 BOK = 15°. From this itis ‘easy to cheek that 2 a0b = 2 DOK ~ 2 bOK = 45° ~ 15° = 30°, and | Oa} = |KNI/2=5/2. The presence of symmetry in a problem also provides a clarity of vision which often enables us to sce and discover relationships that might be more difficult to find by other means. For example, symmetry considerations alone suggest that the maximum value of xy, subject to x+y = 1, x > 0, y>0, should occur when x= y=] (x and y are symmetrically related). ‘This is an example of the principle of inswfcient reason, which can be stated briefly as follows: “Where there is no sufficient reason to distinguish, there cant be no distinction,” Thus, there is no reason to expect the maximum will occur when * is anything other thar $, that is, closer to 0 or to L. To verify this, let x= 4 +e. Then y=4—e, and, xy (4 +eX$ —e)= fe, In this form it is clear that the maximum occurs when ¢ = 0; that is, x= y “4 ~ ‘The nest problem offers several additional examples of this principle 1.6.2. {@) Of all rectangles which can be inscvibed in a given circle, which has the ‘greatest area” 32 1. Heuratis Figure 1.19. - (b) Maximize sind + sin B + sin C, where A, B, C are the measures of the three angles of a triangle. (©) Of all triangles of fixed perimeter, which has the greatest area? (@) Of all parallclepipeds of volume 1, which has the smallest surface area? (©) OF all n-gons that can be inscribed in a given circle, which has the ‘greatest arca? Solution. (a) The principle of insufficient reason leads us 10 suspect the rectangle of maximum area that can be inscribed in a circle is a square (Figure 1.19). To verify this, let x and y denote the length and width of the rectangle, and suppose without loss of generality that the units are chosen so that the diameter of the citclt is unity. We wish to maximize xy subject tox? +9? = 1. Its equivalent to maximize x77" subject 10 x? + y*= 1. But this is the same problem as that considered prior to this example, the ‘maximum value occurs when x"= y?=, that is, when the rectangle is a square. (b) Notice that the sum, sin A + sin B + sin C, is always positive (since each of the terms is positive), and it can be made arbitrarily small magnitude) by making A arbitrarily close to 180°. There is no reason to expect the maximum will occur at any point other than A= B= C= 60° (an equilateral triangle). A proof of this follows from the discussion in 2.4.1 Ina similar manner, we suspect the answers to (c), (d), and (e) are an equilateral triangle, a cube, and a regular n-gon, Proofs for these conjec- tures are given in 7.2.1, 7.2.12, and 2.4.1. 1.63, Evaluate (— 1+ (anxy® Solution. Here is a problem that cannot be evaluated by the usual tech- niques of integration; that is to say, the integrand does not have an 16, Exploit Syeumetry 33 Ww a wa 2 Figure 1.20. antiderivative. However, the problem can be handled if we happen to notice that the integrand (Figure 1.20) is symmetric about the point (3-7, ‘To show this is so (it is not obvious), let f(x) = 1/(t + (tanx)”), It suffices to show that fla) + f(n/2~ x)= 1 for all x, 06 x< 4/2. Thus, we compute, for r = ¥2, S02) +40)" Tat L 1 TF core + + tan’x tnx 1 T+ tans * tan = It follows from the symmetry just demonstrated that the area under the curve on [0,17] is one-half the area in the rectangle (see Figure 1.20); that is, the integral is (#/2)/2 = =/4, Another way to take advantage of symmetry is in the choice of notation. Here are a couple of illustrations. LGA, Let P be a point on the graph of y = f(x), where fis a third-degree polynomial; let the tangent at P intersect the curve again at Q; and let A be the area of the region bounded by the curve and the segment PQ. Let B be the area of the region defined in the same way by starting with Q instead of P. What is the relationship between 4 and B? Solution. We know that 2 cubic polynomial is symmeiric about its inflec- tion point (see 8.2.17). Since the areas of interest are unaffected by the choice of coordinate system, we will take the point of inflection as the origin, Therefore, we may assume the equation of the cubic is sojrar+bx, ard (soe Figure 1.21). Suppose o is the abscissa of P. It turns out that the abscissa of Q is —2xq. (We will not be concerned with the details of this straightforward 34 1. Heariiet Figure 1.21 ‘computation. There is, indeed, a very elegant way to arrive at this fact, but it uses ideas found in Section 4.3 (see 4.3.7).) A straightforward integration shows that the area 4 is equal to Kxd, where Kis independent of xo. (Again, the details of this computation are not of concern here.) We now can apply our previous conclusions to the point Q, The tangent at Q will imersect the curve at R, the abscissa of which evidently is =2(— 2x) = Axo, and the area B is equal to K(— 2x9)" = 16Kx$ = 164 1.65. Detetmine all values of x which satisfy tane = tan(x + 10°)tan(x + 20°)tan(x + 30°). Solution, We witl introduce symmetry by a simple change of variable. Thus, set y= x + 15°, The equation then is tan(y— 15°) = tan(y — 5°ytan(y + 5°ytan(y + 15°), which is equivalent to singy — 18*)oos,y + 15°) __sincy —S*)sincy + 5 cox(y = 15")sin(y + 15%) ~ vos(y = 5? )cost y +5") Using the identities sind cos B = j[sin(A — B) +sin(d + By), sind sin B = }[cos(d — B) —cos(4 + B)], cos cos B = }[cos(d ~ B) + c05(d + B)], we get +sin2y _ c0s(— 10°) ~ cos2y ‘sin(30") + sin 2y ~ con —10°) + cosdy * 16. Exploit Sysnmetry 35 or equivalently, 2sin 2y — 1 __ €08 10° — cosy. ‘Fsin2y +1 ~ cos 10 + cos2y * ‘This simplifies to sin dy = cos 10°, which implies that 4y = 80° + 260°, 100° +360°k, ke 0 +220... x= 5° +90%K, 10° + 90°, ke0, 41,42, Problems 1.6.6, {a) Exploit symmetry to expand the product (xy + y'e + Aggy tas! (b) It'x+y +2 =0, prove that state sty ate yty ct) xt eyes? (SRE) Zz (Sudstituie z= —x — y and apply the binomial theorem. For another approach, see 4.3.9.) 1.6.7, The faces of each of the fifteen pennies, packed as exhibited in Figure 1.22, are colored either black or white, Prove that there exist three pennies of the same color whose centers are the vertices of an equilateral triangle. (There are many ways to exploit symmetry and create “without loss of generality” arguments.) 1,68. Make use of the principle of insufficient reason to minimize x?-+ xd +--+ +33) subject to the condition that 0< x)< 1, and x) +x) + +x, = 1, Prove your conjecture. (For the proof, take x= 1/n + ¢,) 1,69. A point P is located in the interior of an equilateral triangle ABC. Perpendiculars drawn from P mect cach of the sides in points D, E, and F, respectively. Where should P be located to make PD + PE + PF a maxi- mum? Where should P be located to make PD + PE+ PF a minimum? 36 1, Hearinis Figure 1.23. Justify your answers. (int: Its helpful to refleet the figure about one of the sides, What happens to PD + PE + PF as P moves parallel to the line of reflection?) 1.6.10, In Figure 1.23, ABCD is a square, < ECD = £ EDC = 15°, Show that tiangle AEB is equilateral. (The key to this very beautiful problem is to create central symmetry. Specifically, add identical 15° angles on sides AB, BC, and AD (as on side-CD) and ereate a diagram much fke that constructed in 1.6.1.) 1.6.11, The product of four consceutive terms of an arithmetic progression of integers plus the fourth power of the common difference is always a perfect square. Verify this identity by incorporating symmetry into the notation. Additional Examples 14.1, 8.14, 815, 81.8, 823. 1.7. Divide into Cases It often happens that a problem can be divided into a small number of subproblems, each of which can be handled separately in a case-by-case ‘manner, This is especially trie when the problem contains a universal quantifier (“for all x ...”), For example, the proof of 2 proposition of the form “for all integers .. ." might be carried out by arguing the even and odd cases separately. Similarly, a thoorem about triangles might be proved by dividing it into three cases depending upon whether the triangle is acute, 117. Dive into Cases ” Bo0G@ o @ o Figure 1.24. right, or obtuse, Occasionally, the subproblems can be arranged hierarchi- cally into subgoals, so that the first eases, once established, ean be used to verify the succeeding stages. Such a procedure is called hillclimbing. Tin the early stages of analysis it is good 0 think about how a problem might be subdivided into a small number of (hopefully) simpler subprob- lems, The heuristic of this section is often given in the following form: “IE you can’t solve the problem, find a simpler related problem and solve it.” 1.7.1, Prove that an angle inscribed in a circle is equal to one-half the central angle which subtends the same arc. Solution, We are given a circle, say with center O, and an inseribed angle APB; some examples are shown in Figure 1.24. We are to prove that in all instances 2 APB = 12 AOB. The three preceding figures represent three essentially different situations. Specifically, the center of the circle, O, is either inside 2 APB (diagram 2), or outside 2 APB (diagram 3), or on one of the rays of APB (diagram 1), We shall prove the theorem by considering each of these cases separately. ‘Case 1. Suppose the center O is on PA. Then 2 AOB= COPB + COBP (exterior angle equals sum of opposite interior angles) = 22 OPB (QB is isosceles) =2./ APB. The result follows. ‘Case 2. If 0 is interior to Z APB (diagram 2), extend line PO to cut the circle at D. We have just proved that 22 APD = 2 AOD and 22 DPB = ZDOB. Adding these equations gives the desired result. Case 3. If O is exterior to 2 APB (diagram 3), extend PO to cut the circle D. Then, using case 1, 22 DPB = 2 DOB and 22 DPA = Z DOA. Subtracting the second equation from the first yields the result. This completes the proof, 1.7.2, A real-valued function f, defined on the rational numbers, satisfies I+) = $0) +40) for al rational x and y, Prove that f(x) = /(I)- x for all rational x. 38 1. Heuristics ‘Solution, We will proceed in a number of steps. We will prove the result first for the positive integers, then for the nonpositive integers, then for the reciprocals of integers, and finally for all rational numbers. Case 1 (positive integers). The result holds when x= 1, For x =2, we have f2)= fC + 1) = fl) +f) = 2ft). For x=3, f)= f+) = fQ) + fl) = 2f1) + fl) = 3f(1). Te is clear that this process can be continued, and that for any positive integer m, f(m) = nf(). (A formal proof can be given based on the principle of mathematical induction—see Chap- ter 2). Case 2 (nonpositive integers). First, f(0) = f(0 + 0) = f(0) + f(0). Sub~ tract f(0) from each side to get 0= (0); that is, (0) =0-/(1). Now, 0= 0) = fl +(—I) = f+ f(b), From this, we see that /(— 1) = — fl). Similarly, for any positive integer n, f(n) + f(—n) = fin + (-”)) =f) = 0, so that f(—n) = nf). ‘Case 3 (reciprocals). For x = }, we proceed as follows: f(I) = f(4 +4) =f) + $4) = 2f()- Divide by 2 to get f(4) = f1)/2. For x= 4, fl) HIG +4 + =I +I) + IG) = BAP OF equivalently, f5) = ‘f(1)/3. In a similar way, for any positive integer n, f./n) = f(1)/n. For x= —I/n, we have f(1/n) + f(1/n) = f(l/n+ (= 1/n)) =f) =0, 80 S-May= ~fQy/n. Case 4 (all rationals). Let n be an integer. Then f(2/n) = f(1/n + 1/n) = f/m) + f/m) = 2f(1/n) = 2/m)f\l). Similarly, if m/n is any rational number, with m a positive integer and m an integer, then A)-H(se- Aad) 48) -m})= B10 th elise wll ape iti, 1.7.3. Prove that the area of a lattice triangle is equal to 1+ $8 — 1, where J and B denote respectively the number of interior ané boundary lattice points of the triangle, (A lattice triangle is a triangle in the plane with lattice points as vertices.) Sotution, This is a special case of Pick's theorem (sce 2.3.1} There are a number of ingenious proofs, each of which divide the set of lattice triangles into a few special types. One way to do this is to “circumscribe” about the ‘wiangle a rectangle with edges parallel to the coordinate axes. At least one vertex of the rectangle must coincide with a vertex of the triangle. Now it ccan be checked thal every lattice triangle can be classified into one of the nonequivalent classes sketched in Figure 1.25, LA (7 Figure 1.25. In the first class are those right triangles whose legs are parallel to the coordinate axes. The second class includes acute-angled triangles one of whose sides is parallel to a coordinate axis, Such triangles are the “sum” of (wo triangles from the first class, In the third class are the obtuse triangles which have one side parallel to a coordinate axis, They are the “difference” ‘of two triangles from the first class. The fourth and fifth classes cover those triangles having no sides parallel to the coordinate axes. ‘The proof of the result follows a hillclimbing pattern. To get started, let us consider the rectangle ABCD in case 1. Suppose that line segments AB and AD contain a and 6 lattice points, respectively, not counting their endpoints. Then, with J and B the interior and boundary points of ABCD, T44B- 1m cb + 42a +2b+4)-1 wabtatbtl =(a4 1+) = Area ABCD. Now suppose that AB, BC, and AC contain a, b ¢ lattice points, respectively, not counting their endpoints, and suppose that ABC contains i interior points, ‘Then rectangle ABCD has 2/ + c interior points, and we have, with J and B the interior and boundary points of ABC, TH pB-lart lato ter sya wi@itatb+eth =H[Qi+ p+ 4 a+ 2044) 1) = }Arex ABCD = Area ABC, ‘The other cases can be handled in a similar way; we leave the details to the reader. 40 1, Heusisties Problems 1.74 (Triangle inequality). (a) Prove that for all real numbers x and y; |x + y| < [x] + [74 (b) Prove that for all real numbers x, y, and 2, [x ~ yl < |x 2] + Ly 2h. 1.7.8, Find all values of x which satisty 3 2 yo S¥4T° 1.76, Let S= (13,8) +), ~1) + kS,4)| j,k are integers}, and T = (mi(1,5) + 1(0,7)| m,n are integers}, Prove that $= T. (Note: Ordered pairs of integers are added componentwise: (5.1) +(s'1)= (545.041), and m(s,1) = (s,m) 1.7.7. A real-valued function f, defined on the positive rational numbers, satisfies f(x + 3) = ff») for all pos Prove that f(x) = {f(}* for all positive ra LTB, Determine F(x) if, for all real x and y, F(a)F(y) — Flay) = x 4+ y. Additional Examples 147, 25.16, 2.5.12, 2.5.13, 263, 3.2.14, 32.15, 3.2.16, 32.17, 32.18, 3.4.1, 413, 414, 44.14, 44.29, 5.2.1, 53.14e, 65.4, 7.4.3, 7.62, 764, 7.6.10, 8.24. Some particularly nice examples which reduce to the study of very special cases are 3.3.8, 3.3.9, 33.21, 33.22, 33.26. 1.8. Work Backward To work backward means to assume the conclusion and then to draw deductions from the conclusion until we arrive at something known or something which can be easily proved. After we arrive at the given or the known, we then reverse the steps in the argument and proceed forward to the conclusion, This procedure is common in high-school algebra and trigonometry. For example, 10 find all real numbers which satisfy 2x +37, we argue as follows. Suppose that x satisfies 2x +3= 7. Then, subtract 3 from each side of the equation and divide each side by 2, to get x = 2. Since each step in this derivation can be reversed, we conclude that 2 does indeed satisfy 2x+3=7 and is the only such number. 18, Work Backward 4 Often, in routine manipulations, such as in the previous example, an explicit rewriting of the steps is not done. However, it is important 19 be aware of what can, and what cannot, be reversed. For example, consider the equation yx+1 —Ve—T=2, (Here, a8 usual, the square root is interpreted as the positive square root.) Write the equation in the form vet =ie=1 +2, and square each side to get x+1=x-1+ 4d —T +4, or equivalently, yx—T = 1. Square @ second time to get —I=f, or We conclude that if there is a number x such that FT —\e—T =2, it has to equal 4. However, # does not satisfy the original equation, The reason for this is that the steps are not all reversible. ‘Thus, in this example, we proceed from yx —T = —4 tox —1=4. When this is reversed, however, the argument goes from x ~ 1= 4 to ¥¥—T = 4. 18,1, Let a bea fixed real number, 0< a 0 since 0< 8 < 9 +a <7. The proof therefore can be carried out; that is, starting with the known identity at (5), wwe can argue (via steps (4), (3), (2), (I) that for all #, OX 0<7—a, F (0) = sina/(\ — cosa) = constant. a 1, Hearisties 1.8.2, If a,b,c denote the lengths of the sides of a triangle, show that ab + be + ca) <(a+ b+ 0)? Mab + be + ca), Solution. Consider the leftmost inequality: Bab + be + ca) <(a+ b+ 6), Bab + be + ca) < a+ P+ B+ Yah + be + ca), abt bet ca sate BSc, 4B Cab — be ca >0, 2a? + 26? + 2c? — Zab ~ be ~ 2ea > 0, (e2 = 2ab + 8%) + (02 = 2be + 2) +(e? — Dea + a4) > 0, (a~ bY 4 (b= of 4 (ea)? 90. This last inequality js true for all values of a,b,c. Now consider the right inequal (a+ b+ 6) < Kab + be + ca), @ +b +c? + 2(ab + be + ca) < Mab + be + ca), a4 BP + 6? < 2(ab + be + ca, PAP LAK a(b4 op + bate) + e(b +a). This final inequality is true, sinee the sum of any two sides of a triangle is larger than the remaining side. Thus, a? < a(b +c), 6° < b(a +), and eX cb +a). The steps in each of these arguments can be reversed, so the proof is complete. 1.8.3. Given: AOB is a diameter of the circle O; BM is tangent to the circle at B; CF is tangent to the circle at E and meets BM at C; the chord AE, shen extended, meets BM at D. Prove that BC = CD. (See Figure 1.26) Solution. Suppose BC = CD, Then CE = CD, since BC = CE (tangents from C to the circle at £ and B arc equal), Thus, 2 CED = 2. CDE (base angles of an isosceles triangle are equal). We are led to consider the angles as labeled in Figure 1.26. Now, £d is complementary to Za since ABD is a tight triangle, and Ze is complementary to Ze since £ BEA is a tight angle (AOB is a diameter). Therefore, Za = £¢. But we know that 2a =< c, since they both cut off the equal are BE on the circle O. 18, Work Backwaed 43 Figuee 1.26. The proof can now be completed by reversing these steps. Thus (omit- (ing reasons), a= 4, and therefore, Le = £d. Hence CD = CE, CE = BC, and therefore BC = CD. 1.84, In a round-robin tournament with m players P,,P;,..., P,, where > I, each player plays one game with each of the other players and rales are such that no ties can occur. Let W, and L, be the number of games won and lost, respectively, by player P,. Show that Suede. Solution, Suppose D7_,W? = 3%. ,£2. Then, Sw 1)~0, Son ma, 4 y= But W, + L, =n for each r, 0 (DEH, by 20. Zhe) =o, Sun Se This test equation is crue, since the total umber of games won by the players has to equal the total number of games lost. The proof follows on reversing the preceding argument, 44 1 Heuristics Probiems 185. (2) Given positive real numbers x and y, prove that kay cH Tei 9 (6) Given positive real numbers a and b such that a + 6 = 1, prove that 2 > aE StI PO y>O 18.6. (a) If a,b,¢ are positive real numbers, and a < b + ¢, show that aoc b ye Tea (a, — a) is an even number. 1.109, Show that @*~ 1)2'~ 1) = 2" +1 is impossible in nonnegative integers a, 6, and c. (Hint: Write the equation in the equivalent form 2015 28 2 = 2 and investigate the possibilities for a, band.) 10.10. Show that x? y?= a? always has integral solutions for x and y whenever a is a positive integer. 50 1. Heuristics a o Figure 1.28 Additional Examples 1.5.10, 1.9.1, 2.2.7, 32.13, 33.4, 33.20, 4.2.16(a), 43.4, 7.4.6, See Section 3.2 for a generalization of this method, 1.11. Consider Extreme Cases Im the beginning stages of problem exploration, it is often helpful to ‘consider the consequences of letting the problem parameters vary from one extreme value to another. In this section we shall see that the existence of extreme positions are often the key to understanding existence results (problems of the sort “prove there is an x such that P(x)"). LULL. Given a fis prove there is a st number of points in the plane, not all collinear, ight line which passes through exactly two of them. ‘Solution, If P is a point and Fa line, let d(P, L) denote the distance from P to L. Let $ denote the set of positive distances d(P, L) as P varies over the ‘given points, and varies over those lines which do not pass through P but 1. Consider Exueme Cases st e OF, *, Figure 1.29, which do pass through at least two of the given points. The set 5 is nonempty (because the given points are not all collinear) and finite (there are only a finite number of points and a finite number of lines which pass ‘through at Icast two such points). Therefore S has a minimal clement, say (P.M), We claim that M passes through exactly two of the given points. ‘Suppose that M passes through thrce of the given points, say P,P. and P,, Let Q denote the point on M which js closest to P. At least two of the points P,, Pz, Py lie on the same side of Q (one may equal Q), say P, and P, (see Figure 1.29). Suppose the points are labeled so that P, is closer to P than P,. Now let V denote the line through P and P,, and note that 4(P,,N) < d(P,M), a contradiction to our choice of P and M. It follows that M can only pass through two of the given points, LIL, Let A be a set of 2n points in the plane, no three of which are collinear. Suppose that m of them are colored red and the remiaining n blue. Prove of disprove: There are n closed straight line segments, no two with a point in common, such that the endpoints of each segment are points of A having different colors. Solution. If we disregard line crossings, there are a number of ways the sven m red points can be paired with the given blue points by 7 closed straight line segments. Assign to each such pairing the total length of all the Tine segments in the configuration. Because there are only a finite number of such pairings, one of these configurations will have minimal total length This pairing will have no segment crossings. (If segments R,B, and R:By intersected, R,, R; being red points and B,, B, blue points, then we could reduce the total length of the configuration by replacing these segments with R,By and R,B,,) (For another solution, see 6.2.3.) 1,113, Ata party, no boy dances with every gitl, but each girl dances with at least one boy. Prove there are two couples bg and 6's’ which dance, whereas & does not dance with g” nor does g dance with 6” Solution, Although not necessary, it may make the problem more under- standable if we interpret the problem in matrix terms. Let the rows of a 2 1. Heuristics matrix correspond to the boys and the columas to the gils. Enter a 1 or 0 in the b-row and g.column according to whether & and g dance or don't dance with one another. The condition that no boy dances with every git] implies that (i) every tow has at least one 0 entry. Similarly, (ii) every ‘column has at least one 1 entry. We wish to prove that there are two rows, 6 and 6’, and two columns, g and g’, whose entries at their intersection points have the pattern Now, we'te done if there is a column which contains a 1 in row f and 2 0 in column m. In general, such a column may not exist. However, if h had been chosen in advance as a row with 2 maximal number of 1's, then such a column would have to exist, and the problem would be solved. With this background, we can rewrite the solution in tanguage indepen- dent of the matrix interpretation. Let b be a boy who dances with a maximal number of girls. Let g’ be a girl with whom b does not dance, and a boy with whom g’ dances. Among the partners of b, there must be at least one girl g who does not dance with b' (for otherwise &' would have more partners than 6), The couples bg and b'g’ solve the problem. 1.11.4, Prove that the product of 1 successive integers is always divisible by al. Solution. First, notice that it suffices to prove the result for m successive positive integers. For the result is obviously true if one of the integers in the product is 0, whereas if all the integers are negative, it suffices to show that x! divides their absolute value. LAL, Consider Exteme Cases 3 So suppose there are n successive positive integers whose product is not divisible by nt, Of all such numbers n, choose the smaltest; cal jt N. Note that N > 2, since the product of two successive integers is always even. We are supposing, therefore, that there is a nonnegative integer m such that (m+ 1m + 2)--- (m+ N) is not divisible by N1. OF all such numbers m, let Mf be the smallest. Note that Mf > 0, since N? is divisible by N!. Thus, Wwe are supposing that (Af + IX.M + 2)-+ + (M+) is not divisible by N!. Now, (M4 0042) (EN NUE NY = M[(ae+ 1NCM+2) 1) EN[(M+ IM 42)--- (M4 ND] By our choive of Af, nt divides M[(M + IM + 2}-++ (M+ .N— D} By cour choice of N. (N — 1)! divides (M + 1,(Mf +2)+ ++ (M+ N—1), and consequently, N! divides M[(M + 1)(M +2):+- (M4 N~1)}. Combi ing, we see that NI divides the right side of the last equation, contrary to ‘our supposition. This contradiction establishes the result, {A slick proof of this result is to recognize that the quotient (rm + Xm + 2) ++ (m+ n)/n! is equal to the binomial coefficient (°%"), and is there- fore an integer if m is an integer.) Problems LALS. Let f(x) be a polynomial of degree n with real coefficients and such that f(x) > 0 for every real number x. Show that f(x) + /"(x)+ +++ +(x) 2 0 for all real x. (f(x) denotes the kth derivative of fy 1.11.6. Give an example to show that the result of LILI docs not necessarily hold for an infinite number of points in the plane. Where does the proof of 1.11.1 break down for the infinite casc? 1.11.7. Show that there exists a rational number, ¢/d, with d < 100, such that 1.118. Suppose that P, ther that () Pris true, and Gi for each positive integer m, Py. is true if P., is true, 4]=[ki for k= 1,2,3,. a statement, for 2 = 1,2,3,... . Suppose fur- 34 1. Bewisties Prove that P, is true for all n. (Hint: Let § denote the set of all positive integers for which P, is not true. Let m denote the smallest element in S, assuming that S is nonempty.) Additional Examples 3.19, 33.11, 33.28, 44.7, 44.10, and the referrals given in 6.3.7. Also, see Sections 7.6 (The Squeeze Principle) and 6.2 (The Intermediate-Value Theorem) for examples which require consideration of “extremelike” cases, 1,12, Generalize It may seem paradoxical, but it is often the case that a problem can be simplifed, and made more tractable and understandable, when it is general- ized. This fact of life is well appreciated by mathematicians; in fact, abstraction and generalization are basic characteristies of modern mathe- matics. A more general seiting provides a broader perspective, strips away nonessential features, and provides a whole new arsenal of techniques. LAZA, Bvaluate the sum 33..,4?/2! Solution. We will instead evaluate the sum S(x) = S_,k2x* and then ealeulate S(1). The reason for introducing the variable x is that we can ‘ow use the techniques of analysis. We know that xe Differentiating each side we get Se ggh tee DTM De C= ae oF (nt lets ne anxy Multiplying each side of this equation by x, differentiating a second time, and multiplying the result by x yields x1 +x) Ieee? soy= 3 ke 12. Generalize 3s 1 fellows that sae 3 Ba 6~ satan n= 1,12.2. Evaluate the following determinant (Vandermonde’s determinant): Loa, at owe 1 a, a} Solutlow, We will assume that a, # a), 17, for otherwise the determinant is zero. In order (o more clearly focts on the main idea, consider the case nad: lad dell bb?) lee In this determinant, replace ¢ by a variable x. Then, the determinant is a polynomial P(x) of degree 2. Moreover, P(a)=0 and P(b)=0, since the corresponding matrix, with ¢ replaced by a or b respectively, then has two identical rows, Therefore, P(x) A(x ays 6) for some constant A. Now, A is the coefficient of x7, and, returning to the determinant, this coefficient js if! 2 (| 3): ‘Thus, 4 = 6 — a, and the original 3-by-3 determinant is P(e) (b~ ayl(e~ aye ~ by). ‘The general case is analogous. Let D, denote the desired determinant (of ‘order n). Replace a, in the bottom row of the matrix by the variable x, The resulting determinant is a polynomial P(x) of degree ~ 1, which yanishes al aydz,...,a,.,. Hence, by the Factor Theorem (see Section 4.2), Pax) = AG ~ ai)(X = a3) te, The final result will be We can repeat the argument for D, ae ft) Tea »} wool ist 1.123. Given that [3(sinx)/xdx = 4m, evaluate {(sin?e)/x7de. Solution, We will evaluate the more general integral May= [7 Bas, a 20, (ay= f° SBP a, by using a technique called parameter differentiation. Differentiating each side of the previous equation with respect to a, we get a) [7 Bananas a = [ee a Now, with y= 2a, we get dy = 2adx, and ray = [SAD dy= be. Tea)~ [PP aye Integrating each side gives Ha)=}ra+C, — C constant. Since 1(0)= 0, we get C= 0. Thus I(a) = } 7a, a > 0, Setting a= 1 yields 1) = [F¢sin'x)x7 dx = 4, (Incidentally, the value of j#(sin x)/xde can ‘be found by evaluating a more gencral integral—an integral of a complex- valued function over a contour in the complex plane.) Problems 1.124. By setting x equal to the appropriate values in the binomial expansion 112. Geneatiae 37 (or one of its derivatives, ete.) evaluate each of the following: oH) om EM) > @ 3 Qk 4 3 © Seat 1AZS, Evaluate bag a det]! 6 6 6 leee 1d a as (Replace d by a variable x: make use of the fact that the sum of the roots of a fourth-degree polynomial is equal to the coefficient of x? (See Section 43)) 1.126, (a) Evaluate [(e~‘sinxy/xdx. (Consider G(k) = J@(e*sin kx)/x dr and use parameter differentiation.) (b) Evaluate Jo(x — 1)/inxdx. (Consider (m) = (4x ~ Y/Inxdx and use parameter differentiation.) (©) Evaluate ne arctan(ax) — arctan f srctan(nx) ~ arctan Te (Consider Fa) = f@(arctan(ax) ~ aretanx)/xde and use parameter differentiation.) 1.12.7. Which is farger 80 or 2 +477 (Cubing each number leads to complications that are not easily resolved. Consider instead the more ‘eneral problem: Which is larger, Ya(x +) or Ye + YP, where xy > 0) Take x= a?,y = 53) Additional Examples 142, 226, 22.7, 4.14, 5.13, 5.14, 5.19, 5.111, 544, 54.5, 5.4.6, 5.4.7, 69.2, 744, Also, see Section 2.4 (Induction and Generalization). Chapter 2, Two Important Principles: Induction and Pigeonhole Mathematical propositions come in two forms: universal propositions. ‘which state that something is true for all values of x in some specified set, and existential propositions which state that something is true for some value of x in some specified set. The former type are expressible in the form “For all x (in a set S), P(x)", the latter type are expressible in the form “There exists an.x (in the set $) such thatP(x),” where P(x) is a statement about x. In this chapter we will consider two important techniques for dealing with these two kinds of statements: (i the principle of mathemati- cal induction, for universal propositions, and (ii the pigeonhole principle, for existential propositions. 2.1. Induction: Build on P(k) Let a be an integer and P(n) a proposition (statement) about m for each integer 1 > a, The principle of mathematical induction states thats a (i) PCa) is true, and i) for each integer k > a, P(k) true implies P(k +1) true, then P(n) is true for all integers n > a. Notice that the principle enables us, in two simple steps, to prove an infinite number of propositions (namely, P(x) is true for all integers n > a). The method is especially suitable when a pattern has been established (see Section 1.1, “Search for a Pattern”) for the first few special cases (P(a), 39, 2.1. Indvetion: Build on PCR) P(a +1), Pla +2), ...). In this section we consider induction arguments which, in step (i), proceed directly from the truth of P(K) to the teuth of P( + Y—that is, the truth of P(k + 1) is “built on” an initial consider- ation of the truth of P(&). This is in slight contras} to arguments (consi- dered in the next section) which begin with a consideration of PUK + 1). 2.1.1, Use mathematical induction to prove the binomial theorem: (ar tym 3 (Mar, ‘n. positive integer. Bh ‘Solution, It is easy to check that the result holds when = 1. Assuming the result for the integer k (we wil) build on the trath of P(k)), multiply each side by (a + 6) to get ve al Sein a (a+8y ero[ Bier I +b) ‘ 2 aS harping Sk Borers Bf mahi In the first sum, make the change of ve “E(A oredr aoe set] e] 3 (Rewer +] woo [Heme doe wot (AA Tapert veel lab, lable j= i+ 1, 10 get -‘S( Naeem, where we have made use of the basie identity (,4,) + ¢) = 1!) (see 2.52). ‘This is the form for P(k + 1), so by induction, the proof is complete. 22 Le 0< a, a. We must show that we can generate (*3%) distinct sums. There are already (*$") distinct sums (generated by a, ..., a): we need to generate 2) (5!) = k +1 additional sums. These can be found in the following manner: let S= Sia, (60 S > S'.,¢,4, for all choices of 2), and note that $+ a4 SF Cag py = GuS + (Op 41 — Oy 1), == S+ yay ~ Gy), are distinet and greater than S. There are k-+ 1 numbers in this lst, so the result follows by induction. Mathematical induction is a method that can be tried on any problem of the form “Prove that P(n) holds for all n > a.” The clue is often signaled by the mere presence of the parameter n. But it should be noted that ‘induction also applies to many problems where the quantification is over more general sets. For example, a proposition about all polynomials might be proved by inducting on the degree of the polynomial. A theorem about all matrices might be handled by inducting on the size of the matrix Several results concerning propositions in symbolic logie are earried out by inducting on the number of logical connectives in the proposition. The list of unusual “inductive sets” could go on and on; we will he content to give Just {wo examples here; other examples are scattered throughout the book (eg, see the next four sections and the listings in the “Additional Exam- ples”), 2.13. If V, E, and F are, respectively, the number of vertices, edges, and faces of a connected planar map, then V-E+Ps Solution. Your intuitive understanding of the terms in this result are probably accurate, but to make certain, here are the definitions. ‘A network is a figure (in a plane or in space) consisting of finite, nonzero number of ares, no two of which intersect except possibly at their end~ points, The endpoints of these ares are called vertices of the network. A parh in a network is a sequence of different arcs in the network that can be traversed continuously without retracing any arc. A network is connected if every two different vertices of the network are vertices of some path in the network. A map is a network, together with a surface which contains the network. If this surface is a plane the map is ealled a planar map. The arcs of a planar map are called edges. The faces of a planar map are the regions that are defined by the boundaries (edges) of the map (dhe “ocean” is counted as a face), Figure 2.1 shows three examples of connected neworks. The firs two are planar maps. In the first, ¥=4, £4, F = 2; in the second, 7 = 5, £ = 6, F=3. The third network is not a planar map. However, if we should 2.1, duction: Build om PCA) 6 Figure 21 flatten it onto @ plane and place vertices at the intersection points, we would have V = 10,5 = 20, F = 12. ‘Now return to. consideration of the theorem. The key idea in the proof of this result is to realize that connected planar maps can be built from a single vertex by a sequence of the following constructions (each of which leaves the map connected) (i) Add a vertex in an existing edge (e.g. becomes -—+—-), (ii) Add an edge from a vertex back 40 itself (eg. + becomes ©) ). (iii) Add an edge between the two existing vertices (e.g. J Becomes —J. (iv) Add an edge and a vertex to an existing vertex (e.g. + becomes ——+). ‘We will induct on the number of steps required to construct the connected planar map. If the network consists of a single point, then ¥ = 1, Fai,b=0.and ¥~ E+ F=2. Suppose the result holds when k steps are required in the construction, The net change for each of the steps is given in the following table: Since the quantity 7 ~ E + F emains unchanged when the (k + Ist step is taken, the proof is complete by induction. 2.1.4. Given a positive integer m and a real number retefes Lees 2]t a fee prove that Ue is Solution, Although there is an integer parameter 7 in this problem, it will ‘not work to induct on 7 for a fixed x. Also, of course, we cannot induct on 6 2. Two Important Principles: Induction and Pigcombote x, Since x ranges over the real numbers (for # given real number x, there is ro next larger real number y). Therefore, it is not clear that induction can be applied to this problem. The idea is to prove the result for all x in the subinterval [&/,(k + 1) /n) for k = 0, +1, +2, First, supposs x belongs to the subinteval [0,1/n). Then Ex +i/n] =O fori =0,1,...,m—L, so that S725 [x + i/n ]=0. Also [nx ]=0, so the result i true in the “First” subfaterval Now suppose the result holds in the interval [(k — 1)/,k/), where k is ‘positive integer, and let x be any real number in this interval. Then bape Tepe d]+ ce +p] tr}. By adding 1/n to x (thereby getting an arbitrary number in [k/n,(k + 1) 7/1), each of the terms, except the final term, on the left side of the previous ‘equation is “shifted” one term to the right, and the final term, [x-+ (1 — 1)/n J, becomes [x + 1], which exceeds [x ] by 1, Thus, replacing x by x4 L/n increases the left side of the previous equation by 1 ‘At the same time, when x in [ax J is replaced by x + 1/n, the value is, increased by 1. Since each side of the equation increases by | when x is replaced by x + 1/n, the result continues to hold for all numbers in the interval [k/1,(k + 1)/n). By induction, the result is true for all positive values of x. A similar argument shows it is true for all negative values of x (replace x by x= 1/m. ‘The next example is a good illustration of “building” P(K + 1) from P(k). 24S. If a>0 and b>0, then (n—1)a" +b" > nat", ma positive intoger, with equality if and only if a= 6. ‘Solution. The result is true for n = 1; assume the result true for the integer k. To build P(K + 1), we must, to get the proper left side, (@ multiply by a: (k= 1a?! 4 Bfa > kat, (ii) add a"; kat" + bta > kath + at, (iii) subtract Ba: kat" > kath + a**! — bla, iv) ada BA kat 4 BA > kal + alt! — bla BEN, ‘We are assuming that this inequality is an equality if and only if a= 6. It 21, faducton: Build on P(A) 6 only remains to show that ka‘ + at*!— lay 4+! > (K+ 1)a% with equality if and only if a = b. To do this we work backwards: kath + at") — bha + DE! > (k + Lat, malt att) — bla t BED 0, at(a— 6) + bb — a) >0, (at — bea by >0, and this is true (a ~ b and a* ~ 5* have the same signs) with equality if and only if a = b. Thus, the proof follows by induction. (Note: This result is a special case of the arithmetic mean-geometric mean inequality; see ‘Section 7.2.) Problems 2.1.6. (2) Use induetion to prove that 14 1/2 41/3 +--+ + 1/i < Din. (b) Use induction to prove that 2148 = -- Qnyl> (n+ DY". 2.1.7. The Euclidean plane is divided into regions by drawing a finite number of straight lines. Show that it is possible to color each of these regions either red or blue in such a way that no two adjacent regions have the same color. 21.8, Prove that the equation x?+ y= 2" has a solution i integers (x, yz) for all a = 1,2,3, ..... (For a nice proof, cases: even m and odd n. For a noninductive proof, see 3.5.1.) 2.1.9. A group of m people play a round-robin tournament. Each game ‘ends in either a win or a loss, Show that it is possible to label the players P\P2,Ps.-.+, 2, im such a way that P, defeated P,, P, defeated Py defeated P,. 2.1.10, If each person, in a group of » people, is a friend of at least half the people in the group, then it is possible to seat the m people in a circle so that everyone sits next to friends only. 2.1.11, The following steps lead to another proof of the binomial theorem. We know that (a + xY' can be written as a polynomial of degree 1, so there are constants 49,4,,.-., 4, such that (4A HARE AEH HALEY, (a) Use induction to describe the equation which results upon taking the kth derivative of each side of this equation (k = 1,2,.....). (b) Evaluate 4, for k=0,1,..., by setting x=0 in the kth equation found in part (a). 64 2. Two Important Principles: Induction and Pigeonboke 12, Suppose that f: RR is a function for which f(2x ~ f(x)) = x for all x, and let r be a fixed real number. (a) Prove that if x) = x + r, then f(x ~ nr) = (x nr} + r For all positive integers 0, (b) Prove that if f is a one-to-one function (ie. fx) = f(y) implies x = y) then the property in (a) also holds for aif integers m. Additional Examples: 1.12, 1.18, 328, 65.13, 71.4, 2.2. Induction: Set Up P(k + 1) In this section we consider induction arguments which begin with a direct assault on P(k + 1) and which work backwards to exploit the assumed ‘ruth of P(&). Theoretically, the arguments in this section could all be fecast into the form of the previous section, and vice versa. However, from ‘practical standpoint, it is often much more convenient to think the one way rather than the other. 22H. Prove that n'/5.+ 04/2 + 1/3—n/30 is an integer for n= 0,1, dee. Solution, The result is obviously true when 1 = 0. Assume the result holds for n= k, We need to prove that (e+e (ket keh KEY st is am integer. We expand, HS 4 SK* + 10K 10K? + Sk 41, ASE AKT 6? 4 Ske 3 rr 4 RAS eSeL kd 3 30" and recombine (to make use of P(A): Beek [ st rts 4] + [A 2k + 2k? + y+ 2+ BIE + 28) + U2 +) ‘The first grouping is an integer by the inductive assumption, and the second grouping is an integer because it is a sum of integers. Thus, the 22. Induetion: Set Up P(E 1) Y 6s proof follows by induction. (Notice how difficult it would have been to arrive at P(k + 1) by starting from P(K).) 2.2.2, Let a), py, prs --- Py be real numbers with a, Define f(x) = (Py 802 — XK Po 2)" (Py — %)- Show that Dea ee bP ee al de OP a | BO bb Ae Ce rn ‘Solution, This is similar to many determinant problems that can be worked by mathematical induction, When n=, we have f(x)=p,—x, and det(p) = py, and bflay— afd) _ bp ® 4) —a(ry- B)_ 4 - 0 the result holds. Assume the resull holds for k~ 1, & > 1, and consider the case for & real numbers pj... py. (We begin by sciting up the situation for P(K) and plan to fall back on the truth of P(k ~ 1) to complete the inductive step.) We wish to evaluate a a a aoe aoa a bbb be Raa bbb bh Subtract the second column from the first (this docs not change the determinant): pia a@ a o-p mo 0 6 pa da] Ob Ob py Been ees Be ° o 66 2. Two Important Principles: Induction and Pigeonhole and expand down the first column to get na aoe bom aoa (pi @ydet] : bob bob $ ‘ =(e= piaet] i boGh bbe my a tN The latter two determinants (on (k — W-by-(k — 1) matrices) are of the form for which we can apply the inductive assumption P(k ~ 1). To do this, we will need to introduce some notation. For the first determinant, set. F(x) = (p2— Xps— X)*- + (py) and for the second, set G(x) = (a= xy ~ ¥)-** (ae =). Then, by the inductive assumption, the last ‘expression equals (o- a F(b) ]-o-rf aste)= ot } But G(a) = 0 and (p, — a) F(a) = f(a), and therefore we have fa) ~ a(Pi— @)(Pa~ 5) + (Pa =) = (4 = PM Pr— 8) (Pe 5) 44a) ~ a(p2 ~ by (Pe ~ BL (Pi = 4) + (a — 89) bra , af(a) ~ af(®) bra ‘The result follows by induction. Problems 2.2.3, Give a proof for the inductive step in 1.13. 2.2.4, For all x in the interval 0 < x < , prove that Isinnx| < nsinx, 7a nonnegative integer. 22.5, Let @ denote the st of rational numbers. Find all fonctions f from @ to @ which satisfy the following two conditions: (i) f(l) = 2, and Gi) {op = ff) f+ + Vor all, yin Q. 23, Strong Indvetion 0 2.26. Uf a,b,c > 1, prove that (abe + 1) > (1 + a}{l + OXI +c). (Hint: Prove, more generally, that 2""'(a4; +++ ay + 1)> (1 + ay)(l + a3) -*+ +a) 2.2.7. Given a set of 51 integers between | and 100 (inclusive), show that at least one member of the set must divide another member of the set. (Hint: Prove, more generally, that the same property will hoki whenever n+ 1 integers are chosen from the integers between I and 2n (inclusive),) For a noninductive proof, see 2.6.1, 2.2.8. Criticize the proof given below for the following theorem: An nebyon matrix of nonnegative integers has the property that for any zero entry, the sum of the row plus the sum of the column containing thai zero is at least n. ‘Show that the sun of all elements of the array is at leat m?/2 Proof (%}: ‘The result holds for m= 1. Assume the result holds for n= k~1, and consider a k-by-k matrix. If there are no zero entries, the result obviously holds. Ifa, = 0, the sum of row / and column jis atleast k, by assumption, and the sum of the elements in the (k~Ipby-(k ~ 1) submatrix obtained by deleting row i and column j is at least (K — 1)°/2 (by the inductive assumption). It follows that the sum of the elements in the A-by-k matrix is at least (K ~ 1)f/2-+ k= (K?~ 2k + I)/2+ k= (K+ 1) 7/2 > 7/2. The result follows by induction, Additional Examples Lit, 1122/81 73, ° | 42.21, 43.57, 43.24, 65.12, 6.6.1, 7.1.6, 7.1.13, 7.2 2.3. Strong Induction Let @ be an integer and P(n) a proposition about n for each imteger n > a The strong form of mathematical induction states that: y @ PCapis ame, and (i for each integer k > a, P(a), Pa 1),..., P(R) true implies Pk + 1) ue, then P(ni) is rue for all integers n > a. This differs from the previous induction principle in that we are allowed 4 stronger assumption in step (i), namely, we may assume P(a), Pla + 1),.--, PQ, instead of only P(A), to prove P(k + 1), Theoretically, the 68 2. Two Important Principles: Indection and Pigeonhole two forms of induction are equivalent, but in practice there are problems which are more easily Worked with this stronger form. 23.1 (Pick’s theorem). Prove that the area of a simple lattice polygon (a polygon with lattice points as vertices whose sides do not cross) is given by 1+ 4B~ 1, where J and B denote respectively the number of interior and boundary lattice points of the polygon. Solution, We will induct on the nuraber of sides in the polygon. The case of a triangle is given in 1.7.3. Consider, then, a simple latice polygon P with k sides, k > 3. We first establish that such a polygon has an interior diagonal. This is clear if the polygon in convex (equivalently, if all the interior angles are less than. 180°). So suppose the interior angle at some vertex, say ¥, is more than 180°. Then a ray emanating from ¥ and sweeping the interior of the polygon must strike another vertex (otherwise the polygon encloses an ite area), and this determines an interior diagonal D with ¥ as one endpoint Suppose that our polygon P has J interior points and B boundary points ‘The interior diagonal D divides P into to simple lattice polygons P, and P, with 1, and I, interior points respectively, and B, and 8, boundary Points respectively. Suppose there are x lattice points on D, excluding its endpoints. Then B = B, + B,~2—2x, and I= 1, + y+ x Now, let A, A, and 4, denote the areas of P,'P,, and Py respectively. ‘Then AnAtA, = (1 448,-)+(h+58,- 0 = (A +h) + (8) + B)-2 = (Uy fy +x) + )(B, + By 2x) -2 214+ B42)-2 a+ 4-1 ‘The result follows by induction. ‘Notice in this example that it is the first step of the induction argument which ig the most difficult (done in 1.7.3); the inductive step (step (i) is, ‘conceptionally very simple, Problems 23.2. 8) Prove that every postive integer greater than one may be writtcn as a product of prime nanbers. () Bertrand’s postulate, once a postulate but now a known theorem, states, 24, laduetion and Generalization 69 that for every number x > 1, there is a prime number between x and 2x. Use this fact to show that every positive integer can be written as a ‘sum of distinct primes. (For this result, assume that one is a prime.) 2.33. (2) Show that every postive integer can be written as « sum of distinet Fibonacci mumbers. (b) Let &:> m mean that k > m +2. Show that every positive integer m has a representation of the form n= Fy, + Fi. +--+ + Ay, where F, are Fibonacci numbers and k,> k,>*"- k, 0. (6) Show that the representation in part (b) is unique. Additional Examples BALA, 3.12, 3.1.18, 35.5, 62.3, 2.4. Induction and Generalization ‘We have seen (in Section 1.12) that a problem is sometimes easier to handle when it is recast into a more general form. This is true also in induction, problems. For example, it may happen that the original propositions P(), PQ), PG), ... do not contain enough information to enable one to cary out the inductive step (step (i)). In this ease it is natural to reformu- late the propositions into a stronger, more general form Q(1). QQ), .. (where Q(n) implies P(m) for each n), and to look again for an inductive proof. 2AL TA +A, 904, 67h then indy +--+ +sind, < nsin = sind, +--+ +sind, < nsinZ Solution, Let P(k) be the statement of the theorem for a given k, and suppose P(K) is true. For the inductive step, suppose A, + --° + 4, + ep =m OCA; < mi 1... A+ 1 Tn this form, it is not clear how to make use of P(k), We might, for example, group 4, and 4, together, 30 that Apt + + Avy (Ay+ Ap.)= x, and then apply the inductive assumption to get sind) +--+ Sindy, + sin(dy + 4g) < kin Z But now it js not at all clear that this implies P(k + 1): Sindy too Hsin dy + Sindy, Se Din eZ. 70 2. Two Important Principles: Induction and Pigeonhole ‘The requirement that the 4's add to seems too restrictive. Consider instead the following proposition O(n): HO 1. Prove that f(x) > 0 for odd n and FG) <0 for even n. Solution. We might expect to be able to express {°**(x) in terms of fC). But a look at the first few derivatives makes this plan appear hopeless: fey Gaye Pena “4 in inal re-set we (yx) = 6Ox3 + 31x i S22x* + 266%? + 31 aye Toya Tee Consider instead the following reformulation: It f(x)= (x? ¥, > 1, then Bel) where g,(x) is a polynomial of degree a ~ 2, and [an odd funetion all of whose gxcx) in| Oellcients ae nonnegative ifm ino, Jan even function all of whose coefficients are nonpositive if mis even. This proposition can be established by induction (we omit the messy details), and this implies the original result. n 2. Two Important Principles: Induction and Pigrombote 2.43, Let F; denote the ith term in the Fibonacci sequence. Prove that Fei + Fam Faget ‘Solution. The result holds for n= 1, so suppose the result holds for the integer k. Then Flat Fly) = Fert By + Fl SA tt At Fe = (Rit FE) + OFF + FR) = Fert QAaihit Raab the last step by the inductive assumption. ‘We would be done if we could show 2F;, Fy + F2,, = Fess, for we could then continue the previous argument, Fry ,, + 2FesiFi + Fe.,) = Fayci + Frcs Faeys, and this completes the inductive step. Taere- fore, it remains to prove that 2F,,Fi + Fi. = Fu... We proceed by induction. It is true for n= 1, and assuming it true for k, we have 2FoarFeas + Fla Fiei + FFs + Flas ADR + Fe Fat Fer CFF t Has) + (Flas + Fis) = Fat (Fie + le) But now we are back to the earlier problem: does Fi. + Fi, = Fu.3? It 80, Fagya + iar + Feq2)™ Foca + Facca = Farca and the induction is complete. Thus, the problems are interrelated: the truth of the first depends upon the truth of the second, and conversely, the truth of the second depends upon the truth of the first. We can resolve the difficulty by proving them both in the following ‘manner. Consider the two propositions Pon): Ft Fem Fane O(n): aaa t Flas Fane ‘P(1) and Q(1) ate each true, The previous arguments show that P(k) and QU) imply Pik+ 1), and that P(k-+ 1) and Q(K) imply Qk +1). It follows that P(k) and Q(&) imply P(E + 1) and Q(k + 1), and the proof is complete. 2AM, Let f(x) aysinx + assin2x +--+ + a,sinmx, where ay... 5 dy ‘are real numbers and where 1 is 4 positive integer. Given that |f(x)] {sinx| for all real x, prove that |a, + 2a, 4 +++ + na, <1. 24, Induction and Generalization B Solution, Suppose we try inducting on the number of terms in f(x). When 1. f= aysinx, and since |f(x)] < |sinx|, it follows that [|= jay sing /2)] = | fr/2)| < |sia(r/2)| = 1. ‘Suppose the result holds for k, and consider the function S(x)= asin + asin2x + +++ + a,sinky + a, sin(k + Ix, for some choice of real numbers @,,43,...,,,,, and suppose that |/(¥)] < {sinx| for all real x. Since sin(K + I)x = sinkxeosx + sinxcoskx, We can write HO) = (a1 + 4. cos kx)sin x + asin2dx + + tay ysin (= Ix + (a, +, yeosx)sin kx. We have now rewritten f{x) as a sum of k terms, more or less of the type from which we can apply the induction assumption. The difficulty is that the coefficients ofthe sine terms in this expression are not constants; rather they contain functions of x. This suggests considering the following rore general problem. Let (2), ..,a,(x) be differentiable functions of x, and let f(%) = a(x)sinx + axx)sin2x + ++ + a,(xsinnx. Given that |f(x)| < i+] for all real x, prove that 1ay(0) + 20,(0) 4 ++ + na,(0)) < 1. If we can prove this proposition, we will have solved the original problem also, because, taking a,(+) =4,, 4, a constant, i= 1,2... for all x, we recover the original problem, Again we proceed by induction. We are given |a,(x)sin x| < [sin.x|. AS * approaches 0, sinx #0, so that for these x, |a,(x)] <1. Since a(x) is continuous at x = 0, it follows that |a,(0)| < 1. This implies that the result is true for the case n= 1, Now suppose the result is tre for n= k, and consider the function AA) ay x)sinx + ag(xysin2x + ay, xpsin(k + 1x, where | f()] < [sin x] and a(x) are differentiable. As before, this can be rewritten in the equivalent form $0) = [ay() — a4 (x)e0skxJsinx + a,(x)sindx + + tag (nysin(k = Ix + [a,(x) + a5, (2)C08%]sinkx. ‘We may now apply the inductive assumption, and conclude that I4x(0) + 4¢41(0)] + 24500) + +» FR = Nay (0) + KL aC) + 24 1(0)]} 6 1 But this is the same as Jay(0) +200) + +++ + hay(0) + (K+ Lay, (0)] < 1. which is the desired form. (A noninductive proof of this resull is given in 632) ™ 2. Two Important Principles: Induction and Pigconhole Problems 2458, Let S denote an n-by-n lattice square, n 2 3. Show that it is possible to draw a polygonal path consisting of 2n—2 segments which will pass through all of the n? lattice points of S. 2AG. Let fol) = 1/(1— 3), and define fi, (x) = xfi(x). Prove that Jos (2) >0 for OC x <1 2.5. Recursion In the sevond solution to 1.1.1, we let 4, denote the number of subsets of @ set with m elements. We showed that 4,,,=24,, 4o= I. This is an example of @ recurrence relation. Even thotigh we do not have an explicit formula for A, (@s the method of induction requires), the recurrence relation defines a “loop” or algorithm which shows us how to compute p.- Tthis section we look at problems that can be reduced to equivalent problems with smaller parameters. The idea is to apply the reduction argument recursively until the parameters reach values for which the prob- Jem can be solved. 2.5.1 (Tower-of-Hanoi problem). Suppose m rings, with different outside diameters, are slipped onto an upright peg, the largest on the bottom, to form a pyramid (Figure 2.3). Two other upright pegs are placed sufficiently far apart. We wish to transfer all the rings, one ata time, to the second peg to form an idemtical pyramid. During the transfers, we are not permitted to place a larger ring on a smaller one (this necessitates using the third peg). ‘What is the smallest number of moves necessary to complete the transfer? Solution. Let M, denote the minimal number of moves for a stack of 1 rings. Clearly My = 1, $0 suppose m > 1. In order to get the largest ring on the bottom of the second peg, it is necessary to move the topmost m— 1 ings to the third peg. This will take a minimum of Mf,.., moves (by our Figure 23, 25, Recursion 5 s| R 4 R ale afk y R Tas 4s Figure 24, choice of notation). One move is necessary to transfer the largest rng to the second peg, and then M,_., moves are necessary to transfer the n — I rings to the second peg. Thus M2, jth M, ‘An casy induction, based on this recurrence, shows that M,=2"*'—1 (ya) = 2M, +1222 Wt b= =D. Let ay, dy,.+-, a, be a permutation of 1,2,...,m We can interpret this permutation geometrically in the following way. Take an n by 1 chess- board, and for each i, place a rook in the ith column (from the left) and the ath row (from the bottom). For example, the permutation 3,2,5,4, is represented in Figure 2.4. In this way we sec that a permutation of 1,2, ..., corresponds (0 a placement of n “nonattacking” rooks on the m by m chessboard. This correspondence enables one to think of permutations. geometrically and to use the language and imagery of nionattacking rooks on a chessboard. 25.2, Let Q, denote the number of ways of placing m nonattacking rooks ‘on the n-by-n chessboard so that the arrangement is symmetric about the diagonal from the lower left corner to the upper right corner. Show that Q. = Drs (R= NY Qy ae Solution. A rook in the first column may or may not occupy the square in the lower Jeft comer of the board. If it does, there are Q,. ways of placing the remaining m — | rooks. If it doesn’, it can occupy any'n— I squares in the first column, Once itis placed, it uniquely determines the location of a symmetrically placed rook (symmetric with respect to the given diagonal) in the first row. The remaining —2 rooks can be placed in Q,_, ways Putting these ideas together gives the result 2.5.3. A coin is tossed n times. What is the probability that two heads will turn up in succession somewhere in the sequence of throws? 16 2. Two Important Prineptes: Induction and Pigeonhole ‘Solution. Let P, denote the probability that two consecutive heads do not appear in n throws. Clearly P, = 1, P=}. If # > 2, there are two cases. If the first throw is tals, then two consecutive heads will not appear in the remaining n~ 1 tosses with probability 2,.. (by our choice of nota- tion), If the frst throw is heads, the second toss must be (ails to avoid two consecutive heads, and then two consecutive heads will not appear in the remaining 1 ~ 2 throws with probability P,_,. Thus, Pedy thPn, >? ‘This recurrence can be transformed to a more familie form by multipy- ing each side by 2": BPA PP, y+ DP ya, and setting S, = 2"P, for each n: B= Sit Sas This is the recurrence for the Fibonacci sequence (note that S, = F,,2) Thus, the probability we seek is Q, = 1 — Py = 1— Fy.2/2". The next example doesn’t tead to an explicit recursive formula, but it illustrates the “working backward” thinking that is characteristic of the recursive concept, 2.5.4, Prove that any positive rational number can be expressed as a finite sum of distinet terms of the harmonic series. Solution. Let m/n be any positive rational. Then melyly gd ante a is a sum of harmonic terms with m— 1 duplications. Recursively expand all ‘duplicates by the identity 1/n = 1/(m + 1)-+ 1/a(a + 1) until all terms are distinet. Problems 2.55, Let P, denote the number of regions formed when m fines are drawn fn the Euclidean plane in such a way that no three are concurrent and no two are parallel. Show that P,., = P, +(n-+ 1). 256. (a) Let £, denote the determinant of the n-by-n matrix having ~1’s below the main diagonal (from upper left to lower right) and 1's on and above the main diagonal, Show that E,= 1 and E, = 2£,_, for n> 1. 25, Recursion n (b) Let D, denote the determinant of the n-by-n matrix whose (i jth clement (ihe clement in the ith row and jth column) is the absolute value of the difference of # and j. Show that D, = (—1)"""(n— I)2"™ (©) Let F, denote the determinant of the n-by-n matrix with a on the main diagonal, 6 on the superdiagonal (the diagonal immediately above the in diagonal—having n— I entries), and ¢ on the subdiagonal (the diagonal immediately below the main diagonal—having n — 1 entries) Show that F, = aF,_,— BeF,., n> 2. What happens when a= b= 1 and e= — 17 (@) Evaluate the n-by-n determinant A, whose (f,/)th entry is aA by finding a recursive relationship between A, and 4, 25.7. (@) Let ayas,. ive real numbers and A, =(a,+ --- +4,) 7m. Show that 4, 2" with equality if and only if A,.., = 4,, (Hint: Apply the inequality of 2.1.5.) (b) Arithmetic-mean—geometrie-mean inequality. Using part (a), show that BRE Ga) agin with equality if and only if a, = =a, 2.5.8. Two ping pong players, 4 and B, agree to play several games, The players are evenly matched; suppose, however, that whoever serves first has probability P of winning that game (this may be player 4 in one game, or player B in another). Suppose A serves first in the first game, but thereafter the loser serves first. Let P, denote the probability that A wins the nth ‘game, Show that Py, = P,Ct— P)+ (1 — BP. 2.5.9, A gambling student tosses a fair coin and scores one point for each head that turns up and two points for each tail, Prove that the probability of the student scoring exactly points at some time in a sequence of tosses is 4[2 +(—$)"], (Hint: Let P, denote the probability of scoring ‘exactly 7 points at some time. Express P, in terms of B,_., oF in terms of P,-. and P, ..- Use this recurrence relation to give an inductive proof.) 2.5.10 (Josephus problem). Arrange the numbers 1,2, tively (say, clockwise) about the circumference of a circle, Now, remove ‘number 2 and proceed clockwise by removing every other number, among thoee that remain, until only one number is let. (Thus, for a= 5, numbers are removed in the order 2, 4, 1, 5, and 3 remains alone.) Let fn) denote the final number which remains. Show that FQn)=2f(m) ~1 fOn+1) = 3m) +1. (This problem is continued in 3.4.5.) 8 2, Two Imponant Principles: Induction and Pigeonhole 28.11, (a) Let R, denote the number of ways of placing nonattacking rooks on the r-by-n chessboard so that the arrangement is symmetric about a 90° clockwise rotation of the board about the center. Show that Ran = (An —2)Re ay Raae = Rae Raver =O Rass (b) Let S, denote the number of ways of placing n nonattacking rooks on the n-by-n chessboard so that the arrangement is symmetric about the center of the board. Show that Soy = Sy, 3 Sanat = Sane (©) Let T, denote the number of ways of placing » nonattacking rooks on the n-by-m chessboard so that the arrangement is symmetric about both iagonals. Show that S1=2, Sreei™ Sine Sag * Saya + 2M = 2)Soq_ 2.5.12. A regular 2n-gon is inscribed in a circle. Let T, denote the number of ways it is possible to join its vertices in pairs so that the resulting segments do not intersect one another. If we set Ty I, show that Ty = Toy y+ T)Tu_2 + ToTyy °° + TaaiTo ‘(For a continuation of this problem, see 5.4.10.) 25.13, Let a,,a,,..., a, be a permutation of the set $,= (1,2... ‘An clement j in S, is called a fixed poimt of this permutation if a, (a) A derangement of S, is a permutation of S, having no fixed points. Let & be the number of derangements of S,. Show that B= mel and eA (—WRert Byzh for > 2. (Hint: a derangement either interchanges the first clement with another or it doesn’t) (®) Let f, be the number of permutations of S, with exactly one fixed point. Show that |, — gy = | 25.14, Suppose » men check in their hats as they arrive for dinner. As they leave, the hats are given back in a random order. What is the probability that no man gets back his own hat? (Hint: Let p, denote this 2.6, Pigeonhole Principle 7» probability. Then p, = g,/nt, where g, is as in 2.5.13. Let C= py — Py ‘Use the recurrence relation found in 2.5.13a) to show that C; =, C, = = Cy./m Use this to show that py = 1/21 1/314 0+: (“I /nt. ‘Then for large m, py 1/e.) 2.5.15. (@) Let J, = fe @) Show that "sax. Find a recurrence relation for J, 1x3X SX +++ XQn= 1) ™"TKaREX KOR 2" (©) Show that 2xdx6x--- x @n—2) feet" Ty 3KSR = RRM)” Additional Examples 1.1.1 Golution 2), 4.3.9, 535, 53.14, $3.15, 548, $4.9, 5.424, 54.25, 5.4.26. Closely related to induction and recursion are arguments based on “repeated arguments”. Examples of what is meant here are 444, 4.4.17, the proof of the intermediate-value theorem in 6.1, 6.1.5, 6.1.6, 6.3.6, 6.8.10, and the heuristic for the arithmetic-niean-geometric-mean inequality given, in Section 7.2. 2.6. Pigeonhole Principle When a sufficiently large collection 6f objects is divided into a sufficiently small number of classes, one of the classes will contain a certain minimum number of objects. This is made more precise in the following self-evident proposition: Pigconhole Principle. if kn + | objects (k > 1) are dsributed among n boxes, one of the boxes will comain at least k + | objects. ‘This principle, even when k=, is a very powerful tool for proving existence theorems. I takes some experience, however, to recognize when and how to use it. 2.6.1. Given a set of n+ 1 positive integers, none of which exceeds 2n, show that at least one member of the set must divide another member of the set 80 2 Two Important Principles: Induetion and Pigeonhole Solution. This is the same as 2.2.7, where it was done by induction on 1; However, the problem is really an existence problem for a given n, and it can be carried out very nicely by the pigeonhole principle, as we shall see. Let the chosen numbers be denoted by x... X,44, and for each 4, write x= 2y;, where 1, is nonnegative integer and y, ts odd. Let T= {yjst= L2.++., m+ 1), Then 7 is @ collection of n + 1 odd integers, each less than 2m, Since there are only m odd aumbers less than 2n, the Pigeonhole principle implies that (wo numbers in Tare equal, sayy; = yj. i m,, then x divides x,. This completes the proof 2.6.2. Consider any five points P,, Py, Py, Pq, Ps in the interior of a square ' of side length 1. Denote by d, the distance between the points P, and P,. Prove that at least one of the distances d, is less than ¥2 /2. Solution, Divide S into four congruent squares as shown in Figure 2.5. By the pigeonhole principle, two points belong to one of these squeres (a point ‘on the boundary of two smaller squares can be claimed by both squares). The distance between these points is less than {3 /2. 2.6.3. Suppose that each square of a 4-by-7 chessboard, as shown below, is ‘colored either black or white. Prove that in any such coloring, the board must contain a rectangle (formed by the horizontal and vertical lines of the board), such as the one outlined in the Figure 2.6, whose distinct corner squares are all the same color. Sokution, Such a rectangle exists even on a 3-by-7 board. The color configurations of the columns each must be of ome of the types shown in Figure 2.7, Figure 25. 26, Pigeonhote Principle 81 ’ 2 3 4 s 6 7 Figure 2.7, Suppose one of the columns is of type 1. We are done if any of the remaining six columns are of type I, 2,3, or 4, So suppose each of the other columns is of type 5, 6, 7, or 8. Thea, by the pigeonhole principle, two of these six columns must have the same type and we are done, ‘The same argument applies if one of the columns is of type 8. So suppose none of the columns are of type 1 oF type 8. Then we have seven columns but only six types. By the pigeonhole principle, two columns have the same type and the proof is complete 2.64, Prove that there exist integers a,5,¢ not all zero and cach of absolute value less than one million, such that la + 6/2 +e¥3| < 10°", Solution. Let $ be the set of 10'* real numbers r + s/Z +23 with each of 148,t in (0,1,2, .-., 10°~ 1}, atnd let d= (1 +) + ¥3 10% Then each x in Sis in the imterval 0 < x 2, and suppose the claim has been shown for all smaller sums. By (3) and (i), these is no loss in generality in supposing that x 0, there are unique integers q and ? such that angbtr, Oarcd By repeated use of the division algorithm we can compute the greatest common divisor of two integers. To see how this goes, suppose that b, and +z are positive integers, with b, > 83. By the division algorithm there are integers q and b, such that Bem ght hy, 06 by 0, we can repeat the procedure, using b, and 2, instead of b and by, to produce an integer 6, such that ed(b,,bs) = godly, B, > b, > 0. 6 3. Avitumesi By continuing in this way, we will generate a decreasing sequence of nonnegative integers b> b> dy>e such that ged(b,.b,) = god{by,bs)— - + = godt bay). 6=1,2,3,. Since such a sequence cannot decrease indefinitely, there will be a first such that &,.., =0. At this point god(b,,b,) = Bed(B,, by) = By. ‘This procedure for finding ged{(b,,b,) is called the Euclidean algorithm. Before giving an example of this algorithm, we will state and prove the major result of this section. 3.1.2. Given’ positive integers a and 6, there are integers s and f such that sa + th = ged(a,b). Solution. We will prove the result by inducting on the number of steps required by the Euclidean algorithm to produce the greatest common divisor of a and &. (Another proof is outlined in 3.1.9.) Suppose a > 6. If only one step is required, there is an integer q such that a = 6g, and in this ease ged(a,b) = b. Also, in this case, ged(a,b) = b = a+(1—9)b, so sel s= I, tl —g, and the proof is complete. Assume the result has been proved for all pairs of positive integers which require less than k steps, and assume that a and 6 are integers that require A steps, k > 1, By the division algorithm, there are integers g and r such that aagbtr O 2, are relatively prime, iven that T; = 2, and T,..,= 72-7, +1, n> 0, prove that 7, and Tra are relatively prime whenever # m. (oy BAL. For positive integers ay,.-.,d,, prove there exist integers Fey such that kya, fo oF kya, = gel, 8 3.112. Prove that (a+ b)/(c + d) is irreducible if ad ~ be = 1 3.1.13, Prove that ged(a,,..., a,.)20d(b1, «5 By) = Beda yby,dabs, --- 4a,b,), where the parentheses on the right include all mn products a), Ghee mpele sm 3.14, When Mr. Smith cashed a check for x dollars and y cents, he received instead y dollars and x cents, and found that he had two cents more than twice the proper amount. For how much was the check written? 3.1.15, Find the smallest positive integer a for which 1001 x + 770y = 1,000,000 + a {s possible, and show that it has then 100 solutions in positive integers. 3.116. A man goes to 2 stream with a 9-pint container and a 16-pint ‘container. What should he do to get 1 pint of water in the 16-pint container? (Hint; Find integers s and ¢ such that 9s + 16¢= 1), 3.1.17. There is more than one integer greater than 1 which, when divided by any integer k such that 2.< < 11, has a remainder of 1, What is the difference between the two smallest such integers? 3.18, Let b be an integer greater than one. Prove that for every nonnega- tive integer NY, there is a unique nonnegative integer and unique integers 4,49 9,1,...,2%06 a b, Use induction.) Additional Examples 324, 3221, 33.11, 33.19, 33.28, 41.9, 42.1, 42.2, 424, corollary (i) of Lagrange's theorem in Section 4.4, 445, 4.4.6, 448. 32. Modular Arithmetic of 3.2, Modular Arithmetic ‘The parity of an integer tells us how that number stands relative to the number 2. Specifically, a number is even or odd according to whether its remainder when divided by 2 is zero or one respectively. This formulation. of parity makes i{ natural to generalize the idea in the following manner. Given an integer x > 2, divide the set of integers into “congruence” classes according to their remainders when they are divided by m; that is to say, two integers are put into the same congruence class if they have the same remainders when they are divided by x. For example, for m=4, the integers are divided into four sets identified with the possible remainders 0.1,2,3, For an arbitrary a > 2, there will be congruence classes, labeled O12. .50= ‘Two integers x and y are said to be congruent modulo n, written *=y (mod n), if they each give the same remainder when they are divided by 1 (or, equivalently, and more conveniently in practice, if x — y is divisible by n). Tris easy to prove that (i) x= x (mod n), (ii) x= y (mod 1) implies y = x (mod n), and Gi) [x= y (mod n) and y > z (mod 2)] imply x = 2 (mod n) These properties mean that congruence has the same characteristics as equality, and we often think of congruence as a kind of equality (in fact we sometimes read x = y (mod n) as “x equals y modulo n”). 3.2.1. Prove that any subset of $5 numbers chosen from the set {1,2,3, 4,..., 100) must contain wo numbers differing by 9. Solution. There are nine congruence classes modulo 9: 0,1,2,3,4,5,6,7,8. By the (generalized) pigeonhole principle, seven numbers from the chosen 55 are in the same congruence class (if each congruence class had six or less, this would account for at most $4 of the 55 elements). Let ay, ay be these numbers, and suppose they are labeled so that a, < ay < a3 < * Kay. Since dj, =a, (mod 9}, a,,,— 4, © (9.18... }. We claim that G14, ~ 9,= 9 for some i, For if not, then for each i, 4, — a, > 18, and this would mean that a;— a, 76x 18= 108. But this is impossible, since 2 — ay < 100. Thus, two of the elements (among a,,... .,.a3) differ by 9. The real power of congruences is a consequence of the following easily proved property. 2 3. Arithmetic Modular Arithmetic. 1f x = y (mod n) and u =e (mod n) ther xtusyto(mod), xou=y- v (mod n). This result allows us to perform arithmetic by working solely with the “remainders” modulo n. For example, since 17=5 (mod 12) and 40=4 (mod 12), we know that 1744055449 (mod 12) and 17x 40:= 5 x 4=8 (mod 12), Let m be a positive integer, > 1, and let Z,=(0,1,2,...,"—1). Observe that if x and y are elements of Z,, there are unique elements r,s, in Z, such thet (mod n), x+y =s (mod n), x+y = 1 (mod n). ‘The sot Z, together with these operators of subtraction, addition, and muniplication is called the set of integers modulo n. In this system, ‘computations are carried out as usual, except the result is always reduced {modulo 2) to an equivalent number in the set Z, xn) 322, Let N #2231411 X 17+ 13x 19, Determine (a) the parity of (WN; (0) the units digit of N; (c) the remainder when N is divided by 7. (Of course, the idea is to make these determinations without actually comput ing N) ‘Solution. For part (a), 22 x 31 is even, since 22 is even, 11 x 17 is odd, and 13 X 19 is odd, so the sum is even + odd + odd, and this is even. Notice that this reasoning is equivalent to computing modulo 2; RQXN+NKITHIDXID=OXLFIX1 41X11 +120 (mod 2), For part (b), we need only keep track of the units digit: 22x 31 has a units digit of 2, 11 X 17 has a units digit of 7, and 13 x 19 has a units digit of 7. Therefore, the units digit of W is the units digit of 2+ 7 + 7, or 6. Here again, this analysis is equivalent to computing N modulo 10: 2Ux BLAM ITH ISK I9=2% 1417 +39 (mod 10) =247+7= 6 (mod 10). 23.2, Modulae Arithmetic 93 Whereas parts (a) and (b) can be done without an awareness of modular arithmetic, it is not so apparent what should be done in part (c). The point of the example js that part (c) can be handled as a natural extension of the modular approach used in the previous eases. We work modulo 7: 2X B+ HAT #19 x 19S 1344 x3-+(—1) X55 (mod 7) 4+5—S=3 mod 7). ‘Thus is 3 more than a multiple of 7. (As a check: N= 1116 = 4597 +3) 423, What are the last two digits of 3° Solution, We work modulo 100, There arc many way to build up to 3™. For example, 3? = 9 (riod 100), 3 = 81 (mod 100), 3° = 81 x 81 = 61 (mod 100), 37 =9 x 61 =49 (mod 100), 3° =49x49=1 (mod 100). Since 1234= 2061+ 14, we have 3 = (9°13)! = 3! = 349! = BI x 49 = 69 (mod 100), The last two digits are thus seen to be 69. 3.24. Show that some positive multiple of 21 has 241 as its final three digits, Solution, We must prove that there is a positive integer » such that 21m = 241 (mod 1000) Since 21 and 1000 are relatively prime, there are integers s and ¢ such that 2s + 10001 = 1, Multiply each side of this equation by 241, and rearrange in the form 212415) — 241 = —241 x 10001. In congruence notation, the last equation means that 21 x 241s = 241 (mod 1000). If sis postive, we are done, for we cam set n = 24s. If sis not positive, let n= 2415+ 1000K, where & is an integer large enough to make m positive (by choosing & in the appropriate manner, we may even assume that 7 is between 0 and 1000). It follows that 2In = 212415 + 1000k) 1x 2415 = 241 (mod 1000). 3.2.5. Prove that for any set of m integers, there is a subset of them whose sum is divisible by m. 4 3. Arithmetic Solution. Let x),x,,...-%, denote the given integers, and let Dimas DEM t a, MeP tet bay If y,=0 (mod 1) for some i, we're done, so suppose this is not the case ‘Then we have n numbers y),.. Jay and 1 — 1 congruence classes modulo namely, 1,2, ...,2— 1), 80 bY the pigeonhole principle, (wo of the y/’s ‘must be congruent to one another modulo n, Suppose y, = y, (mod n), with i 1. Solution, We will look at a very special case fist, but the pattern for the general case is @ simple generalization which will be clear. Begin by choosing nine distinct primes p,, p.,..-,Py- We now look for a lattice point (a,b) such that 4~ 150 (mod pi paps). 0 (mod papspe)- Oo 0 (mod psPePs). ati= and b+ 1=0 (mod pipap,). b= 0 (mod p2PsPa), e b~ 150 (mod pspsPs)- ‘Geometrically, (a, 2) is a point characterized by the following diagram: Matte of Dib PP PPP Pipa bet Muttpleot —{ popsze . Pameps bo at a att 98 3. Anithmete Since p1P:ps paPsPos PrPaps are relatively prime, the Chinese remainder ‘theorem says that an integer a exists which satisfies equations (1). Similarly, since p, PaPs P2PsPs, PaBePs ate relatively prime, an integer b exists which satisfies (2). By the way a and b are chosen, it is clear that the eight lattice points closest to (a,b) are invisible. Take, for instance, the point (a,b + 1), ‘which has the form (k, ppss, 2p pap) for some integers &, and k,. Since 4's common factor of the coordinates, this point is invisible. A similar argument applies to the other seven closest lattice points. ‘The general case can be handled in exactly the same way, and we leave this as Problem 3.2.26, Problems 3.211. Prove that any subset of 55 numbers chosen from the set (1,2, 3,..., 100} must contain numbers differing by 10, 12, and 13, but need not contain a pair differing by 11. 3.2.42, The elements of a determinant are arbitrary integers. Determine that the value of the determinant is odd. (Hint: Work (a) Determine whether the following matrix is singular or nonsingular: 54401 $7668 15982 103790) 33223 26563 23165 71489 36799 37189 16596 46152|" 21689 55538 79922 $1237, (Hint: A matrix 4 is nonsingular if deta 70. Examine the party of the determinant of the given matrix; that is, compute its determinant modulo 2.) (b) Determine whether the following matrix is singular or nonsingular: (sago9 91185 42391 44350 161372 26563 23165 71489 82561 39189 16596 46152 39177 $538 79922 51237, 3.214 (a) Show that 2+! + 1 is divisible by 3. {b) Prove or disprove: 2° =2 (mod i) if x = y (mod a), (6) Show that 47" 4 25+! 41 is divisible by 7. (@) If n> O, prove that 12 divides n— dn? + 5? — 2, (@) Prove that (2903)" — (803Y" — (464)" + (261)" is divisible by 1897. 32, Modular Arithmetic 9 3215. (@) Prove tht no prime three more than a multiple of four is @ sum of two squares. (Hint: Work modulo 4.) (b) Prove that the sequence (in base-10 notation) 112,113,111. contains no squares. (©) Prove that the difference of the squares of any two odd numbers is exactly divisible by 8. (8) Prove that 2” + 3” is divisible by 13. (©) Prove that the sum of two odd squares cannot be a square. (f) Determine all integral solutions of a? + 6? + c? = ab’, (Hint: Analyze modulo 4.) ao 32.16. (a) If x?-+ y= 2% has a solution in integers x, y,2, show that one of the three must be a multiple of 7. (by If mis a positive integer greater than 1 such that 2" + n? is prime, show that 1 3 (mod 6). (©) Let x be an integer one less than a multiple of 24. Prove that if@ and & are positive integers such that ab = x, then a + b is a multiple of 24. (@) Prove that if n? + m and a? — m are perfect squares, then mr is divisible by 24. 3.2.17. Let $ be a set of primes such that a,b € $ (a and b need not be Gistinct) implies ab + 4€ §. Show that $ must be empty, (Hint: One approach is to work modulo 7.) 3.2.48, Prove that there are no integers x and y for which x4 3xy Jy? = 122, (Hint: Use the quadratic equation to solve for x; then Jook at the diserimi- nant modulo 17. Can it ever be a perfect square?) 3.2.19, Given an integer n, show that an integer can always be found ‘which contains only the digits 0 and I (in the base 10 notation) and which is divisible by n. 3.2.20, Show that if n divides a single Fibonacci umber, then it will divide infinitely many Fibonacci numbers, 3.2.21. Suppose that 2 and n are integers, n > I. Prove that the equation ‘ax = 1 (mod 7) has a solution if and only if @ and m are relatively prime. 3.2,22. Let a,b, c,d be fixed integers with d not divisible by 5. Assume that mis an integer for which cami + bm? + cm +d 100 3. Anithmetic is divisible by 5. Prove that there exists an integer » for which da? + en + bata sible by 5. 3.2.23, Prove that Qin — 3)/4 and (15m + 2)/4 cannot both be integers for the same positive integer m. 3.2.24, (a) Do there exist m consecutive integers for which the jth integer. 1 a and pron @> pet. Then n? = pip? pi, Each divisor of n? determines a solution, and therefore the number of such solutions is Qa, + Qa; + 1) ++ Qa + De 338. Let r and s be positive integers. Derive a formula for the number of ordered quadruples (a,b, ,d) of positive integers such that 23°F = lem(a,b,c) = lem(a,b,d) = lem(a,e,d) = lem(b,c.d). Sohtlon, In view of the resull of 3.33, itis apparemt that each of ab, c, and d must have the form 3"7 with m in (0,1,...,7) and a in (0, 3. Unique Factorization 103 1,..+48} Also, m must be r for atleast two of the four mumbers, and 1 ‘must be # for at least two of the four numbers. There are ()r? allowable ‘ways of choosing the m's in which exactly two m’s will equal r; there are (br allowable ways in which exactly three m’s will equal r; there are ({) Allowable ways in which all m's equal r. Putting this together, there are ()+G)+G)e choices of allowable m’s, Similarly, there are (2+) G)P allowable n's. The desized number is therefore (I+ 4r + 6r?X1 + 45 + 65°) 3.39. Given positive integers x, yz, prove that Gegoeynre Pass] Pe] Pe] HF where (a,-..,g) and {a,...,g) denote ged(a,..., g) and lem(a, .., 8) respectively Solution, Because of unique factorization, it suffices to show that for each prime p, the power of p on the left side (in its prime factorization) is equal to the power of p on the right side. So suppose x = p'r, y= p's, and z=p'r, for integers r,5,1, each relatively prime to p. We may assume (because of symmetry, and by relabeling if necessary) that a b, and the number of zeros at the end of 1000! will equal Thus, we must find b. Every fifth integer in the sequence 1,2,3,4,5,6,---, 1000 is divisible by 5; there are [1000/5 J = 200 multiples of 5 in the sequence. Every 25th teger in the sequence is divisible by 25, so each of these will contribute an additional factor; there are [1000/25 } = 40 of these. Every 125th integer in the sequence is divisible by 125, and cach of these will contribute an additional factor; there are {1000/125 I = 8 of these. Every 625th integer ‘will contribute aa additional factor; there are [100/625 J = 1 of these. 04 3. Arithmetic Thus, 6 = [1000/5 } + 1000/25 f+ = 2004404841 = 249, In exactly the same manner, the highest power of p in n! is given by the (finite) sum 1000/12 J) + [1000/6251 La/p V+ En/e D+ bal 1+ 3.311. Prove that there are an infinite number of primes of the form n= 1. Solution. First, notice that if p is a prime number larger than 3, then either 1 (mod 6} or p= —1 (mod 6). (If p=2 (mod 6), for example, then = 6K -+2 for some k, which impligs that p is even, a contradiction. A similar argument works for p = 3 (mod 6) or p =4 (mod 6).] Now suppose there are only a finite number of primes of the form 6n ~ 1. Consider the number N = p!— 1, where p is the largest prime of the form 6n — 1. Write W as a product of primes, say T= PiPa oP ay Observe that each of the primes p, is larger than p. For, if p, < p then equation (1) shows that py divides 1, an impossibility. Since p is the largest prime congruent to ~ | modulo 6, it follows that p, = I (mod 6) for each k. If we now consider equation (I) modulo 6, we find that pt (mod 6), Nep! or equivalently, pi=2 (mod 6). But this is clearly impossible, since p!= 0 (mod 6). Therefore, there must be an infinite number of primes of the form 6n ~ 1 Problems 3.3.12. In a certain college of under 5000 total enrollment, a third of the students were freshmen, two-sevenths were sophomores, a fifth were juniors and the rest seniors, The history department offered a popular course in which were registered a fortieth of all the freshmen in college, a sixteenth of all the sophomores, and a ninth of all the juniors, while the remaining third of the history class were all seniors. How many students were there in the history class? 3.3.13, Find the smallest number with 28 divisors. 3.3.14, Given distinct integers 2,,¢,d such that (= aye = B(x (x= €)- 4-0 hhas an integral root r, show that 4r—mat b+ 04d, 33.18, (a) Prove that 72 is irrational. (b) Prove that there is no set of integers m,n, p except 0,0,0 for which m+ m2 pf =0. 3.3.16. Given positive integers a,b,cd such that a= 62, c= d?, and ¢~a=25, determine a, b,c, and d. 3.3.17. Prove that if ab, ac, and be are perfect cubes for some positive integers a,6,c, then a, b, and c must also be perfect cubes. 3.3.18. A changing room has m lockers numbered 1 ton, and all are locked. A tine of m attendants P,,P;,..., P, file through’ the room in order. Each attendant P, changes the condition of those lockers (and only those) whose numbers are divisible by k: if such a locker is unlocked, P will lock it: if it is locked, P, will unlock it, Which lockers are unlocked after all n attendants have passed through the room? What is the situation if each attendant performs the same operation, but they file through in some other order? 3.3.19, The geometry of the number line makes it clear that among any set ‘of m consecutive integers, one of them is divisible by n. This fact is frequently useful, as it is for example in the following problems. (a) Prove that if one of the numbers 2" — 1 and 2* + 1 is prime, n > 2, then the other number is composite. (b) What is the largest number N for which you can sey that n° is divisible by N for every integer n? (©) Prove that every positive integer has a multiple whose decimal represen- tation involves all en digits, 33.20, For cach positive integer , let H, = 141/24 +++ +1/n. Show that for n> 1, H, is not an integer. (Hint: Suppose H, is an integer Muttipty each ‘side of the equality by lem(1,2, ..., n), and show that the left side of the resulting identity is even whereas the right side is odd.) 3.3.21. If ged(a,b) = 1, then show that G) wod((a + BY",(a— By") < 2", and i) ged(a” + o",a"— 6%) <2. 3.3.22. For positive integers a, let (a, ...,g) and [a, note the ged(a, ..., g) and lem(a, .. ., g) respectively. Prove that Sn? + 4n (@) 92 = (ysa8, J2)x zh ©) Ly D =[2, 9,062), © [x02] = Gx, yhle2D, @) dx, yh [22h 02D = [Gs 9,2, 20), © [a ye21% 9G, 2x3 2) = 92%, ¥.2), © GN tle, 106 3. Arithmetic 3.3.23, Let m be divisible by 1,2,...,m Show that the numbers 1+ mn(l + 0,4=0,1,2,...,m are pairwise relatively prime. 3.3.24, The prime factorizations of r + 1 positive integers (r > 1) together involve only r primes. Prove that there is a subset of these integers whose product is a perfect square. 33.25, (a) Determine all positive rational solutions of x? = y*. (b) Determine all positive rational solutions of x'*¥'= (x + y)". 3.3.26, Suppose that a? + b?= c%, a,b,c integers. Assume ged(a,b) ‘= ged(a,c) = ged(b.c)= 1. Prove that there exist integers w and o such that c= bw, c+ b= 20?, ged(u,o) = 1. Conclude that a = 2uo, b= 0? — 2, = oF + w?, (Hint: By examination modulo 4, itis not the case that a and b are both odd; neither are they both even. So without loss of generality, a is even and b is odd.) Conversely, show that if w and © are given, then the three numbers a,b, ¢ given by the above formulas satisfy a? + 6° = 0%, 33.27. Find all sets of three perfect squares in arithmetic progression, (Bint: Suppose a m: This representation is used to denote the sum of the series Ag Ag (DTN AD At abo! + a:b PH BALL. Let C denote the class of positive integers which, when written in base 3, do not require the digit 2. Show that no three integers in C are in arithmetic progression. Solution, Let d denote the common difference for an arbitrary arithmetic progression of three positive integers, and suppose that when d is written in base 3 notation its first nonzero digit, counting from the right, occurs in the ‘th position, Now, let a be an arbitrary positive integer, and write it in base 3 notation. The following table gives the Ath digit of each of the integers 4, a+ d,and a + 2d, depending upon the kth digit of d and a: the kth digit of di and kth dit of ais kth digit of de? ‘and th digit of ais In every case, one of a, a+ da + 2d has a 2 in the kth digit, which means the corresponding number does not belong to C. 342, Does fx + [2x 1+ E4e | + [8x D+ [16x P+ [32x J = 12345 have a solution? Solution, Suppose that x is such a number. Itis an easy matter to show that 195 < x < 196 (since 63 X 195 = 12,285 < 12,345 < 12,348 = 63 x 196). Now, write the fractional part of x in base-2 notation (the a,b,c, ... are cither 0 oF X= 195 + .abedef -. 108 3 Arithmetic Dw =2X 195 + abedef..., Ax =4K 195 + absedef..., Bx = 8X 195 + abeadef..., 16x = 16x 195 + abed.ef 32x = 32% 195 + abede,f.. In this form we see that Ux ]= 195, [2x J=2x 195 +4, [4x ] = 4x 195 +2045, [8x ]=8 195 +404 2b +6, [16x } = 16 x 195 + 80-44 + 2c +d, [32x J = 32x 195 + 16a +86 + 4c 420+ e, Adding, we find that [x J+ [2x }+ (4x 1+ (8x 1+ [16x 1+ [32x] = 63 x 195 + 31a + 158 + 7¢ + 3d +e. The problem is therefore reduced to finding a,b,¢,d.e, cach 0 or I, such that 31a + 15 + Te + 3d + e = 60. But this cquation cannot hold under the restrictions on a,6,c,d.e, since Bla +156 + Te 43d eK H+ 1S 4743+ 1 = 57< 60. Therefore, ‘there can be no such x. When an integer is written in decimal notation (base 10), it is possible to determine very easily if itis divisible by 2 or 5. There are other divisibility tests that are easy to apply. For example: An integer Nis divisible by 4 if and only if its last two digits are divisible by 4, To see this, write W in base 10: Nm (a,10 + = + a1O?) + (24104 a5) and note that a,10"+ «++ + a3t0" is always divisible by 4. Thus, 4). if and only if 41(a,10 + a). ‘One of the most striking and uscful divisibility tests is that an integer is divisible by 9 if and only if the sum of its digits (in decimal notation) is divisible by 9. To see why this is so, notice that 10=| (mod 9), and therefore, by the properties of modular arithmetic, 10"= 1 (mod 9), 107 = 1 (mod 9), and so forth. Tt follows that N= alt oss + alt ay=a, + ++ ay + dy (mod 9). A similar proof shows that an integer is divisible by 3 if and only if the sum of its digits is divisible by 3. As an application of this test, suppose we ask: for what digits x is 4324198765223 divisible by 32 We simply need to add the digits modulo 3, and choose x that will make the sum congruent to ero modulo 3, In this case, the sum of the digits is 1 + x modulo 3, so the number is divisible by 3 if and only if x = 2, 5, or 8. 34. Positional 109 3.4.3, When 4444 is written in decimal notation, the sum of its digits is A. Let B be the sum of the digits of 4. Find the sum of the digits of B. (4 and B are written in decimal notation.) Solution. Let N= 444644. Then V < (10°) = 102°, which means that when ¥ is written in decima] notation, it will have less than 22,220 digits Since each of the digits of V must be less than or equat to 9, we are certain that A < 22,290 x 9 = 199,980. Ina similar manner, A has at most 6 digits, so that the sum of the digits ‘of A must be less than 34 (= 6 x 99; that is, B-< $4 (OF the positive integers less than 54, the number with the largest sum of Aigits is 49, and this sum equals 13. Let C denote the sum of the digits of B. We have just seen that C < 13. From our reasoning preceding the problem, we know that NEA € (mod 9), 40 let us ealeulate the congruence class of C by calculating the congruence class of N. First, 4444 = 9 x 493 + 7, and therefore 4444 = 7 (mod 9), Also, 7 | (mod 9). Since 4444 ~ 3 x 1481 + 1, we have 444s = 7 (mod 9) = Px 57 (mod 9) =7 (mod 9). Thus, C =7 (mod 9) and C < 13. The only number which can satisfy both of these requirements is C = 7, and the problem is solved 3.4.4, An (ordered) triple (x,,.%,,43) of positive irrational numbers with x) +X ,4 x= His called balanced if each x, <4. Ifa triple is not balanced, say if x, >4, one performs the following “balancing act”: BX, X25 %3) = (85X83) where x/= 2x, if 7 and xj = 2a, — 1. TF the new tiple is not balanced, one performs the balancing ‘act on it. Does continuation of this process always Tead to a balanced triple after a finite number of performances of the balancing act? Solution. Write x,,.x;, 5 in base 2 notation in the manner described at the beginning of the section, say y=. =D baby. Ee onnen where 4,,4,,¢, are each 0 or 1. no 3. Arithmetic To say that cach x, <4 is to say that a,, b,, and ¢, are each equal to zero. Notice that the balancing act consists of moving the “decimal” point fone place to the right and then disregarding the integer part. Thus, for example, if x),x3.2) were not balanced, the representations (base 2) of jo, are given by 34 = babyy. yee Many examples can be given to show that the process need not termi- nate in a balanced triple, For example, define +,,,,%5 (using the earlier notation) by it Vis a perfect square, otherwise, it is one more than a perfect square, otherwise, ita +5,=0, otherwise, that is, 4 =-100100001000000100 ... 3 =.010010000100000010.. 45 =.0010011 1001 1111001... « Each of x,, x3, and x, is itrational (rational numbers are those which correspond to periodic “decimal” representations), and their sum is 1 (since xy) +4p bx =} +L 44} ++ =D, Repeated applications of the balane- ing act will never transform x,,x,,x, into a balanced triple (because, in ‘every case, one of 4,,b,.¢; is equal to 1). 3.4.5 (Continuation of 2.5.10), Suppose f is a function on the positive integers which satisties LK) = 2f 0) — 1, Jk +1) =24(K) +1 Let a be an arbitrary positive integer whose binary representation is given by B= 040p-1 -- 032409 Show that 2h a, Qh oe ha. + Gp), Alaym BI +b, PN $B yy 14, Positional Notation um where 1 ae ot yale (The idea is to replace each of the O's in the binary sum for @ with ~ I's; for example, for n= 10, f(1010,) = ITIT, (the Ps stand for — 1's) =8— 4+ 2-15, Solution. We will induct on the number of digits in the binary representa- tion of «. ‘The result is true for a= 1, so suppose it holds whenever @ has fewer than k +1 digits, Now consider an integer a with & + 1 digits (in base 2), say a= aay, 40g If ap=0, then a= 2%apay_ 4), fla) = flay... a) ~ 26S os BDH BA dm BH so DEE BEF By. andthe result holds. If a= 1, then @=2aq,,. att, fla)= Alay.) + 1 = BQN BYE LA BL A + BD+ Poy and again the result holds. This is a nice application of number representations. Notice how simple it is to compute: f(25) = f(11001,) = HITI1, = 16+ 8-4-2 +1=19. In the next example, 2 special number representation allows us 10 investigate and understand a set of real numbers of central importance in advanced analysis. 34.6. Let K denote the subset of [0,1] which consists of all numbers having a ternary expa in which a,—0 or 2. This is called the Cantor set. Show that K is the ‘complement of the union of disjoint open intervals Z,, = 1,2,3,..., ‘whose lengths add to 1. Solution, First observe that none of the numbers in the interval /, = (4,3) are in K. This is because numbers in this interval have ternary representa tions of the form (4a,a,04--.), Similarly, none .of the numbers in the interval f= ({,3) are in K, because these numbers have ternary representations of the form (layayes ..-)y m2 3. Anithmete fi z 3 Figure 32. ‘Also, numbers in the interval /, = (3,3) have ternary representations of the form (lasagds ...)5. 0 these are not in K. In the same manner, none of the intervals fy = (4.3) = (B.B), os H.5)s In = (BB) contain clements in K. Itis apparent that this process ean be cartied out systematically. Figure 3.2 and Table 3.1 help make the idea precise, To find J, (that is, X, and ¥,) for an arbitcary positive integer m, write in base 2 notation: N= (edgy 820) (ie mm ay +20, + + + Mag, a, 0 oF 1) Het 6, = 24, T= 12, 0k and set 1, = (Xqs Yq), Where his easy to see that X, and Y, are elements of K for each m (note that Xp 2B /3 + B/E + + (by. )/G + DR A/F), and that n0 el ‘ements in J, arc in K (the kth digit of every clement of J, = (Xy. Yq) is D- From these facts it follows that the J,’s are disjoint, Table 3.1. I, = (Xs ¥n) @ @ x Y, pase 10) (base 2) (base 3) (base 3) J, (in fractional form) L 1 on oz ap 2 10 01 om Gp 3 a 021 022 GD 4 100, 0.001 0.002 (hh) 5 101 0.201 0.202 a 6 no 001 0.022 Gt) 7 mr 021 0222 as) 8 100 0.000; 0.0002 Ge) 9 Toor = 0.2001 0.2002 Ge) 34, Positional Notation ns Also, the Jength of /, is 1/3*, where k = [logy I, and therefore > 1 a prt 2 resis ~ 2 3 2 (tr) - 3h) SGV)! co rie ‘Our construction of the J,'s makes it clear that X is what remains after the intervals J, are removed from [0,1], and the result js proved, Problems 3.4.7. Prove that there does not exist an integer which is doubled when the tial digit is transferred to the end, 3.4.8 Find the smallest natural number a which has the following proper- ties: decimal representation has a 6 as its last digit, and Gi) if the last digit 6 is erased and placed in front of the remaining, digits, the resulting number is four times as large as the original mumber 7. 349. (a) Solve the following equation for the positive integers x and y: (360 + 3x) = 49204. (b) Devise a divisibilty test for recognizing when a number is divisible by 11. (Hint: 10 = —1 ¢mod 11)) . (©) If 62ab427 is a multiple of 99, find a and b. (@) Find the probability that if the digits 0,1,2,...,9 are placed in random order in the blank spaces of 5_383_8 2.9365 8 203 9 3 76, ‘the resulting number will be divisible By 396. 34.10, Given a two-pan balance and a system of weights of 1,334.3, 3%... pounds, show that one can weigh any integral number of pounds (weights can be put into either pan). (ITint: Show that any positive integer ‘ean be represented as sums and differences of powers of 3.) 341. (a) Does the number 0.1234567891011121314 ..., which is obtained by ‘writing successively all the integers, represent a rational number? (®) Does the number 0,011010100010100 ..., where a, = | ifm is prime, 0 ‘otherwise, represent a rational number? 3.4.12, Let $= aga,a, ..., where a, ~ 0 if there are an even number of T's in the expression of w in base 2 and a, = 1 if there are an odd number of 14 3. Arithmetic 1's. Thus, $= 01101001100... . Define T= bybsby -.., where b, is the number of 1's between the ith and the (/ + I)st occurrence of 0 in S. Thus, T= 2102012... . Prove that T contains only three symbols 0, 1,2. 3.4.13, Show there is a one-to-one correspondence between the points of the closed interval [0, 1] and the points of the open interval (0, 1). Give an explicit description of such a correspondence. Additional Examples 1.1.1 Golution 5), 448, 52.5, 6.1.1, 6.1.4, 6.1.8, 6.2.13, 7.6.6. 3.5. Arithmetic of Complex Numbers Recall that 2 complex number z can be written in several different forms: rectangular form: 2 = a+ bi, polar form: 2 = r(cosd + isind, exponential form: z= re¥, where a, 6, r, and @ are related as in Figure 3.3, and e” =cos0 + isind. The angle # is the argument of z (determined only up to a multiple of 2), and ris the magnitude (absolute value) of z; these are denoted by arg and [eI respectively. The numbers a and are called the real part and the imaginary part of z respectively, and are denoted by Re() and Im(z). Wer a+bi and w=e+ ai, then 2+ w= (a+c)+ i(b+d) come. sponds geometrically to the diagonal of the parallelogram having z and w adjacent sides (sce Figure 3.4), It c= re® and w=se™, then zw= rse'*®. Notice that |2w|= rs = |zl}w] and argaw = 4+ q = args + argw; that is, under multiplication, the absolute values multiply and the arguments add. Figure 3:3, 35. Arithmetic of Complex Numbers us arotinte Figure 34 355.1. U2, b, and n are positive integers, prove there exist integers x and y such that (aber aye Solution, Let 2 = a+ bi, Then (a? + 5%)" = (lzPy" = [2/°*= 21". But 2” = x44) for some integers x and y (because a and b are integers), 50 (4)? = [x4 bP = x? +97, and the proof is complete, 352, Let m be an integer > 3, and let a, By be complex avmbers such that a” = B"= "= 1, a+ B+ y=0. Show that 7 is a multiple of 3. Solution, We may assume without loss of generality that a= 1 (for if not, divide cach side of a+ A+ y=0 by a to get 1+ B/aty/a=0, and then set a,=1, B,= A/a, y= 1/2). We will assume that 0< arg B 2 (and hence 1 > 3). Then 3” ~ 2° = I, or 3"— 2" = =1. ‘Case 1, Suppose 3" = 2" = =}, n> 3. Then 3” = 1 (mod 8). But this congruence cannot hold, since 3” =1 or 3 (mod 8), depending upon whether m is even or odd (3 = 3 (mod 8), 3*= 1 (mod 8), 3° = 3 (mod 8), 342 1 (mod 8)... ). Case 2, Suppose 3” — 2" = 1, n> 3, Then 3" = I (mod 8), 50 m is even, say m= 2k, k > 1. Then 2" = 3 — |= Gt 1X3" + 1), By unique factor- ination, 3* + 1 = 2 for some r, r >3. But, by case 1, we know this cannot happen. This completes the proof of part (a). (b) It is immediate that not both p and g are odd, for this would imply that p"— q” is even. So suppose that q = 2. We will show, by using only the algebraic identities of this section, that the only solution is that found in part (a), namely [3*— 2°) = 1, Suppose m and 1 are larger than 1, and that |p" ~ 2*|= I. It eannot be the case that m and 71 are both even, for if m = 2r and n= 2s, then ale" 2 = |p 2 = |p 21 1p" + 2h and this is impossible (since p’+ 2 > 1). Suppose that mis odd. Then Wm phe la(pe lp sph 2t pl ‘and this is impossible, since the last factor on the right side of the equation is an odd aumaber larger than 1 ‘Therefore, it must be the case that m is even and n is odd. 4.1 Algebraic Identities 123 ‘Suppose m = 2’, where k is odd and suppose k > 1. Then vs . at Paprsta (peta (pene ts -(%) +1), and again the factor on the right is odd, a contradiction. ‘Therefore, m =2' for some positive integer r and nis odd, and our equation has the form |p” ~ 2"|= 1. Either p* ~2"= 1 or p* 2° = ~1 Case 1. It p” — 2 = =1, then PeaP La Qanar teeta $241) 53 (mod dy, but tis is impossbl, since for any odd integer x, x° = 1 (mod Case 2. 1 p*— 2m 1, then, 2 = p= Lm Cp? = Ip? "+ 1) The only way both p7"'— 1 and p* "+1 Could be powers of 2s for p= =2 and p?"'+1=4 Adding these yields p?"=3, and this implies that p=3,r=1,m=2, and n= 3, This completes the proof. 4.1.4, Prove that there are no prime numbers in the infinite sequence of integers 19001, 100010001, 1000100019001, . Solution. The terms of the sequence can be written as 14 1041+ 108+ 10%... 1+ 108+ --- + 10%). Consider, more generally, then, the sequence Lex btxterh oo dexte ex, for an arbitrary integer x, x > 1. If mis odd, say a= 2m +1, . Dt xt ty time = (Lest be tye ea tt) a (le xg ete Thus, if m > 0, the number is composite. For m= 0 and x = 10, we also get a composite number, since 10001 = 73 x 137 Suppose n is even, say n = 2m. Then +x"), are ey H (SESS) = (late 0") Lexth ep xt x (Inet Hay} This factorization shows the number is composite, 124 4. Atgebea Problems 415, (a) If a and 6 are consecutive integers, show that a? + 6? + (ab)? is a perfect square. (b) If 2a is the harmonic mean of b and ¢ (i.e. 2a= 2/(1/b+ 1/¢)), show that the sum of the squares of the three numbers a, b, and cis the square of a rational number. (©) ICN differs from two successive squares between which it fies by x and _y respectively, prove that N ~ ay is a square. 4.1.6, Prove that there are infinitely many natural numbers a with the following property: The number n' +a is not prime for any natural ‘number a. 4.1.2. Supposing that an integer m is the sum of two triangular numbers, Pra, Bb epee bee, write 41 + | as the sum of two squares, 4+ 1 = x? +y?, and show how x and y can be expressed in terms of a and b. Show that, conversely, if 4n+1=.x?4y?, then x is the sum of two triangular numbers, 4.1.8, Let N be the number which when expressed in decimal notation consists of 91 ones: Ne i Show that V is a composite number. 4.1.9, Prove that any two numbers of the following sequence are relatively prime: QHLPHL ME LMe Wel. Show that this result proves that there are an infinite number of primes. 4.1.10, Determine all triplets of integers (x, y,2) satisying the equation Say tte (ety tap. Additional Examples 184, 1.127, 33.6, 42.5, 5.2.15, 5.3.7, TI11. Also, see Section 5.2 (Geometric Series). 42, Unique Factorization of Polynomials 125 4.2, Unique Factorization of Polynomials A polynomial of degree n(n a nonnegative integer) in the variable x is an expression of the form xP Oa NE EAE My, where do.d),..-, dy are constants (called the coefficients), and a, #0. A polynomial all of whose coefficients are zero is called the 2er0 polynomial; no degree is assigned to the zero polynomial. The coeffivient a, is called the ieading. coeficient; if it is equal to 1 we say the polynomial is a monic ‘polynomial. Two polynomials are called (identically) equal if their coeffi- cients are equal term for term, that is, their coefficients for the same power of the variable are equal, If the coefficients of the polynomial P(x) are integers, we say that P(x) is a polynomial over che integers: similarly if the coefficients are rationals, ‘we say the polynomial is over the rationals, and so forth. In many respects polynomials are like integers. They can be added, subtracted, and multiplied; however, just as in the case of integers, when a polynomial divides another the resuli will be # quotient polynomial plus a Temainder polynomial (more on this later). A polynomial F divider a polynomial G (exactly) if there is a polynomial Q such that G = OF (that is, G is a multiple of F). A polynomial H is a greatest common divisor of polynomials F and G if and only if (1) H divides F and G and (2) if K is any other polynomial that divides F and G, then K divides H. It can be shown that // is unique up to a constant multiple ‘Also, as in the ease of integers, there is @ division algorithm. ‘Divison Algorithm for Polynomials, If F(x) and G(x) are polynomials over a field K (for example, K might be the rational, the reals, the complexes, the imegers ‘modulo p for p prime), there exist unique polynomials Q(x) and R(x) over the field K such thar : Fx) = QE) + RE where R(x) = 0 or deg R(x) < deg G(x) (deg denotes degree) Moreover, if K is an integral domain (such as the integers), the same result holds provided G(x) is @ mame polynomial. ‘As an example of the division algorithm for polynomials, Jet F(x) = 3° + 2x? = Sand G(x) = 2x? + 6x +3, Then gate 246x411) eS 3x54 9x9 + Bx? ope Ws aon) 27x-} Pea lie 126 4. Algebra In this case, Q(x) =3x7—$, and R(x) = 4x? + 27x — 4. (This example should make it clear that the algorithm will work in the general case only if the coefficients come from a field; however. it also should be clear that an integral domain is sufficient if the divisor is monic.) ‘As in the case of the integers, the division algorithm can be used to find the greatest common divisor of two polynomials. Furthermore, as in the case of the integers, if F and G are polynomials (over a field K), there are polynomials S and T (over K) such that Bed(F,G)= SF + TG, where gcdl FG) denotes the greatest common divisor of F and G. 4.2.1. Find a polynomial p(x) such that P(x) is divisible by x? + 1 and P(x) +1 is divisible by 2° 4x7 + 1 Solution, By the conditions of the problem, there are polynomials S(x) and T(x) such that P(x) = (2+ 1)S(X), PQ) + La (8 $84 T(s) I follows that (x? + S(x) = (2? + x7 + 1 T()— |, oF equivalently (2 ENTON- (2+ NSCQ= 1 Ty our remarks preceding the example, x? 4 x74 1 and x? + 1 are “rela tively prime” and we can use the Euclidean algorithm for polynomials 19 find S(x) and T(x). Thus, we have ete Le (xe IOP + It (—5), ette= and “working backwards.” we have 1=(2 +) +2(-) =P +N taf bes (+ NED) (“94h = (84 [= x¢ee )] # xf ttt 1] HP 44 DEH G8 HIE + HL. In this form, we find that we can take (x)= x74 2 — 1 and T(x)= x. It follows that PO) = (22 + It + x= 4.2.2, Prove that the fraction (n° + 2n)/(a*-+ 3n? + 1) is irreducible for every natural number 1. 142, Unique Factorization of Polyoomis 127 Solution, We have wt 4 3n 4 1 n(n + 2a) + (+ 1), 4 dns no + I) +n, me Lenny +l, n=a(ly. It follows that ged(n* + 3n? + In? + 2n)=L, and the proof is complete Let F(x) be a polynomial over an integral domain D, and consider the polynomial equation F(x)=0, If an element @ of D is such that F(a)= 0, we say that ais a root of F(x) = 0, or that a isa zero of F(x). The following very useful theorem is an easy application of the division algorithm. Factor Theorem, If F(x) is polynomial over an integral domain D, an element a of Dis a root of F(x) —O if and only if x — a isa factor of F(x) By repeated application of the factor theorem, we can prove that there is a unique nonnegative integer m and a unique polynomial G(x) over D such that Fx) = (x= ay"G(D, where G(a) # 0. In this case, we say that ais a zero of multiplicity m. ‘The next two examples illustrate the use of the facior theorem. 42.3, Given the polynomial F(x)=x" + a,_yx"2 4 --- tax tay with integral coefficients ayyay,....d,_1, and given also that there exist four distinct integers a,b,c,d such that Fa) = F(b) = F(c)= F(d)=5, show that there is no integer & such that F(k) = 8. Solution, Let G(x) = F(x) ~ 5. By the factor theorem, x — a, x ~ b,x and x ~ d are factors of G(x), and we may write G(x) = (= anf ~ x= OYE AAC) where H(x) is polynomial with integer coefficients. If & is an integer such that £(K) = 8, then G(k) = Fk) — 5 = 8 — 5 =3, or equivalently, {k= ay(k — by k= ey(k = ad yH(R) = 3. The left side represents a product of five integers, and each of the integers k= a,k- bk — ck —d must be distinct, since 2,8,c,d are distinet, But this is impossible, since at most one of the numbers k~a,k— 8k ~ ¢, = d can equal 3, so the other three must be +1. Thus, such a & cannot bbe found. 128 4 Alpeboe 4.24, Prove that if F(x) is a polynomial with integral coefficients, and there exists an integer k such that none of the integers F(I),F(2), .... F(k) is divisible by k, then F(x) has no integral zero. Solution. It is equivalent to prove that if F(x) has an integral zero, say r, then for any positive integer k, at least onc of Fil),F(2),.--» FUR) is divisible by k. So suppose F(x) = 0. By the factor theorem, we can Write F(a) = (4- G(X), where G(x) is a polynomial with integer coefficients. From the division algorithm for integers, there are integers q,and ¢ such that r= gk + 5, O deg g and degA > deg&, then deg( fh — gk) > deat fk + gh). Thus, we see that there are polynomials g(x) and A(x) with real cocfficients, deg g(x) # degh(x) such that j? = g? + i, Problems 4.2.7. Find polynomials F(x) and G(x) such that (28= DQ) + (x9 NEE) = x 4.2.8, What is the greatest common divisor of x” — I and x” — 1? 42.9. Let f(x) be a polynomial leaving the remainder A when divided by x—4 and the remainder B when divided by x-6, a7 5. Find the remainder when f(x) is divided by (x ~ a(x — 8). 4.2.10. Show that x4 2414 x4 xM!*9, a,b,c.d positive integers, is divisible by x? +x" + x +1. (Hint: 2°42? 4x4 1 = (7+ Da + DD 42.11. Show that the polynomials (cos + xsin6)" — cos.n® — xsinn is divisible by x? +1 42, Unique Factorization of Pelynomias 131 4.2.12. For what n is the polynomial 14x24 xt --+ 4x27? divisible by the polynomial 1+ xt x24 <0 27 7 4.2.13. A real number is called algebraic if itis a ze10 of a polynomial with integer coefficients, (@) Show that {2 +3 jis algebraic. (b) Show that cos(# /2n) is algebraic for each positive integer n. (Hint: Use de Moivre's theorem to express cosmx as a polynomial in cos.x.) 42.14, If P(x) is a monie polynomial with integral coefficients and k is any imeger, must there exist an integer m for which there are at least’k Aistinet prime divisors of P(m)? (Hint: First prove, by induction, that there are & distinct primes gj, .... ge and integers m,..., mz such that g, divides P(m) for #=1,..., k. Then prove that a prime g divides P(n) if and only if g divides P(n + sq) for all integers s. An affirmative answer follows from these facts together with an application of the Chinese ‘Remainder Theorem.) 42.15. (a) Factor x*+x*+1 into irreducible factors (i) over the rationals, (i) ‘over the reals, (i) over the complex numbers. (b) Factor x*— I over the complex numbers. (©) Factor x~ 2x7 + 6x? + 22x + 13 over the complex numbers, given that 2+ 34 is a zero, 4.2.16. Here are two resulls that are useful in factoring polynomials with integer coefficients into irreducibles. Rational-Root Theorem, [f Pix) = 4,27 + Gy_yxt- bb ay + ag f8 a pole romial with integer coefficients, and if the rational member rj (7 and §reatvely prime integers) 8 @ 1008 of P(X) 0, then r divides ay and 5 divides Gauss Lemma. Ler P(x) be polynomial with integer coefficients. If P(x) can be {factored into a product of ow polyoma with ravine! coefcims, then P(X) can ‘e factored into a product of two palmomiats with integer coefficient (@) Let foxy = ayn” + ay xt «++ + ax + ay be @ polynomial of de- agree n with integral coefficients. If ay, a, and (I) ate odd, prove that ‘f(2) = 0 has no rational roots. (b) For what integer a does x? — x +. divide x! +3+ 902 420 (@) Suppose f(2) is a polynomial over the real numbers and g(x) is & divisor of f(x) and f'(x). Show that (g(x) divides f(x). (This fact can bbe used t6 check f(x) for multiple roots.) 132 4 Algebea (b) Use the idea of part (a) to factor x4 x44 3x7+2x +2 into a product of inredueibles over the complex numbers. 42.18. Determine all pairs of positive integers (mn) such that I + x" + 2h pM is divisible by Lx txt Ba, 42:9. (2) Let F(x) be polynomial over the real numbers, Prove that a is a 2270 of mutliplicity m if and only if F(a) = F(a) = --- = F°™%(a)=0 and Fe Na) #0. (b) The equation f(x) = x" ~ mx +m ‘What isthe multiplicity of this root? ), > I, is satisfied by x = 1 4.2.20, Hf n> 1. show that (x+ 1° only if m~ 1 is divisible by 6. 4.2.21, Let P(x) be a polynomial with real coefficients, and assume that P(x)>0 for all x. Prove that P(x) can be expressed in the form COOP + (ORI +--+ + (OACOP where Qi, O19. - --, OCH) are polynomials with real coefficients. 4.2.22, (@) Set = cos(2n/n) + fsin(2a/n), Show that re Tb ee bat l= (xe ee (eet (b) Set x= I and take the absolute value of each side to show that te in OTL = 1 =O has a multiple root if and sin S sin ‘in Additional Examples, 1.12.2, 1.12.5, 6.5.13, 6.9.3, 43. The Identity Theorem Let P be a nonzero polynomial of degree m over an integral domain D. According 10 the factor theorem, if @ is a root of P(x)=0, there is a polynomial Q of degree nm —1 such that P(x) = (x — a)Q(x). Using this fact, an easy induction argument shows that P has at most m zeros. ‘The preceding observation has a very important corollary. Suppose that F and G are polynomials over a domain D, each of degree less than or 133 equal tom, and suppose that F and G are equal for n+ 1 distinct values. Then FG is a polynomial of degree less than a +1 with n+ | zeros. If F~ Gis not the zero polynomial, we have a contradiction to the reasoning in the previous paragraph, Therefore, F — G is the zero polynomial, and it follows that F equals G (coetfcient for coefficien). (For another proof, see 65.10) Identity Theorem. Sippase shat eno polynomials in x over an integral domain are cach of degre 0 define x, = x3. + 1. Then an casy induction argument shows that P(x,) = x,. Thus, the polynomial P(x) and the polynomial x are equal for an infinite number of integers, and there- fore, by the identity theorem, P(x) = x. That is, there is only one polyno- rial with the stated property, namely, P(x) = x. p(s) + 1a 4126, 43.2. Prove that if m an n are positive integers and 1'< & < 7, then (om yn) _yman Bet MCE} Solution. We proved this idemtity in Chapter | (see 1.34) by using a counting argument. Here is another proof, based on the identity theorem. The technique i standard: the polynomials (1+ "(+ 3)" and (+ 29"** are equal for all values of x. Therefore, by the identity theorem, their coefficients are equal; that is, for each k, the coefficient of x* in (1+ xy"(14 27" is equal (0 the coefficient of x* in (I + x)"7*. It follows Sle MG) ("2") 0) 134 4. Algebra 43.3. For cach positive integer n, show that the identity (x+yy'= Ltt’, x,y positive integers ms Bee J pos zs implies the identity nye Spey 2%, y real numbers, Solution, Let yp be an arbitrary but fixed positive integer, and let PRX)A(x+ HS y= 3 (Mcdyet C=C HI — C= (Te P(x) and Q(x) are polynomials in x, and they are equal whenever x is a positive integer. Therefore, by the identity theorem, P(x) and Q(x) are ‘equal for all real numbers x. ‘Now, let xy be a fixed real number, and let S(y)= (aot y)" and 7 S (") kyr’ (N= ots" and Ty) = SC) aby ‘S(y) and Ty) are polynomials in y, and since they are equal whenever y is ‘a positive integer, it follows that S{p)= 7(y) for all real numbers y. This completes the proof. (Incidentally, the identity (etre S (Dat, ayy positive integers can be proved neatly as follows. Let $= {1,2,....m}; let A be a set with x elements and B be a set, disjoint from A, with y elements. Now, count, in two different ways, the number of functions from S$ to 4 U B. This, together with the preceding solution, constitutes another proof of the ‘binomial theorem.) 4.3.4, Is x°— x? + 1 irreducible over the rationals? ‘Solution, By the rational-root theorem (see 4.2.16), the only possible ra- tional zeros are £1, and neither of these is a zero. Therefore, if the polynomial is reducible, it must necessarily be the product of a quadratic and a cubje. So suppose OPH LAP tart bY tort dr te). By Gauss’ lemma (see 4.2.16), we may assume that a,6,c,d,e are integers. Since these polynomials are equal for all x, their coefficients are equal; $0, 43. The Wdemity Theorem 135 ‘equating coefficients, we get the following equations: aren0, bractd ctad+e= I, bd + ae =0, bea. I is not difficult to show these equations cannot hold simultaneously. For ‘example, the last equation shows that & and e are both odd. Thus, the fourth equation shows @ and d have the same parity. Similarly, the first cquation shows that a and c have the same parity. Therefore a, ¢, and d have the same party. But then ac +d is even, and the second equation cannot hold (6 is odd), Therefore x°— x7-+1 is not reducible over the integers, or the rationals. Another way to proceed with the problem is based on the following observation. If f. g, and A are polynomials over the integers and f= gh, then f= gh (mod n), where j, g, and fare the polynomials formed from f, 4g. and h respectively by taking their coefficients modulo n. If fis reducible over the integers, then / is reducible over the integers taken modulo n. In the case at hand, the polynomial x*—x?+1 transfoms to x°4 x7 +1 (mod 2), The only itreducible quadratic polynomial over Z, = (0,1) is 27 +.x+ 1 (the other quadratic polynomials and their factorizations mod- ulo 2 are x= xe, x84 (xt WY, and x? + x= x(x + 1). But x?+ x+ 1 does not divide x°4 x?+ Lin Zy (84224 1= (0 + x\a? a e+ 1) + 1 (mod 2) and therefore, x° + x?+ Lis irreducible over Z,. It follows that x° — x? +1 is irreducible over the integers, and the rationals. In the preceding discussion, we made use of the fact that polynomials over Z, can be added, subtracted, and multiplied in the usual manner except ‘that the arithmetic (on the coefficients) is done within Z, (i. ‘modulo n). If is a prime number, say m= p, then Z, isa field, so all the results concerning polynomials over fields (c., the factor theorem, the identity theorem) continue to hold. This is not the case if n is not a prime. For example, 2x° ~ 2x, as a polynomial over Z,, has four distinet zeros in Zy, namely, 0, 1, 2, and 3, whereas it would have at most three if the arithmetic were carried out im a field Let p be a prime, and consider the binomial theorem modulo p 3 (Pat (tay BD: (nod p), where each side is regarded as a polynomial over Z,. For 1 =0, and suppose its roots are r, and r;. Then we ean write tax tbe (x= neon) =P (tnt nn. 7 From this, using the identity theorem, it follows that nthe a nae. Similarly, if? + ax? + bx + ¢= O hes roots ry,7557%5 We have Bhatt be bes (x= n\x— nye —n) =P H(nthtye + (runt ty rary) rites In this case, ntntnana nat nnt nh In each case, we have expressed the coefficients of the polynomial cquation in terms of the roots (in a rather patterned way). An induction argument shows this js true in general: specifically, Wx ayo + yet ag O has P00 yay oy then Sian tnt tye ont Spent eng ne rity to rate Oya as Sie nnn ryan bray te ata la Ons = 1)%a, where SIs the sum of all she products of the roots akon i at a time, 43.6, Consider all lines which meet the graph yedx + Int + 32-5 in four distinct points, say (x,..,), = 1,2,3.4. Show that xtra t iy mint nts is independent of the line, and find its value. Solution, Let y = mx + intersect the curve in four points (x;. y3) i= 12 3.4, Then x. ¥2,3,%4 are the roots of the equation mx + b= 2x44 1x3 + 3x5, ro. It follows from our earlier remarks that (x, + x, 4.494 <)/4 =~}. and this is independent of mand b. ‘or equivalently, of apes ( an b + ( pia 138 4 Algebra 43.7. Let P bes point on the graph of f(x) = ax’ + bx, and let the tangent at P intersect the curve y = fix) again at Q. Let the x-coordinate of P be x9, Show that the x-cootdinate of Q is —2.xy ‘Solution, The straightforward approach is to write the equation of the tangent to the curve y = f(x) at P, say y= T(x), and to solve y = T(x) and y= f(2) simultaneously to find Q. Another approach is to argue as follows. We recognize that solving y= T(x) and y= f(x) simultaneously is the same as finding the roots of Fox) — Tex) =0. Now x, is a double root (that is, of multiplicity 2) of this ‘equation, since T(x) is tangent to y = f(x) at x9, What we seek is the third root, denoted by x,. We know that the sum of the roots, 2x9 + x;, is equal to the coefficient of the x? term. But the coefficient of the x term is 0, soit follows that x, = —2x, 43.8, Let x, and xz be the roots of the equation wt (at dye + (ad bey 0. Show that x} and x} are the roots of Ya (@ +d? + Babe + 3bed)y + (ad — bey?= 0, ‘Solution. We know that mtmeatd, xin = ad ~ be. Since (xy +.x,)* = x} + 3xfe, + 3xjx3 + 23, we have ad + xd= (x, + my —3xjx, — 3x} = (a+ dy 3x,x3(x, +2) =(a+ dp (ad bea td) = (a+ d)[ a? + lad +d? —3ad + 30e] =(a+d)(a? — ad + d? +360) =a? + d+ 3abe + 3bed. Furthermore, xix} = (ad ~ bey’, and the proof is complete, 4.3.9. Let a,b, be real numbers such that a + b+ c =O, Prove that fated (Sebec(adesre 3 z 5 43. The ldemity Theorem 139 ‘Solution. Here is a very clever solution based on the ideas of this section. Let A= ab + ac + be and B = abc. Then a,b,¢ are roots of the equation Pitan B=0 For cach postive integer n, let T, =a" +b" + 6%. Then, Th=3, T.=0, Ty= (a+b +0) —Yab-+ ac + be) = -2, For m0, Tray = —AT qu + BT, (substitute a,,¢ into x°*3—= — Ax"?! + Bx” and add), and this gives AS, + BSy= 38; AS, + BS, = 243, AS, + BS, = ~5AB. It follows that Ts 7 pT TABa sy 43,10, Show that the polynomial equation with real coefficients P(x) = aya" + a,x Potala xt lad cannot have all real roots. Solution. Let rj,r2,-.., 7, denote the roots of P(x)=0. None of y+ + sf i8 zet0, Divide each side of P(x)= 0 by x" and set y = I/x, to get . QU)HY ty ty Pb ay 4 bay Hap=O, Note that r is a root of P(x)=0 if and only if 1/r is a root of Q(y) = 0. Therefore, the roots of Q(x) 0 are 5.39, 6+. 5q, Where 5;— 1/ry i= Lee me Bt follows that and therefore, be-(Ss This equation implies that not all the s/s are real; equivalently, not all the ris are real. 140 4, Alnebea Problems 43.11, Let k be a positive integer. Find all polynomials Pye aah tay + op, where the a, are real, which satisfy the cquation (P(x) = [PO] 43.12, (@) Prove that log cannot be expressed in the forma f(x)/g(x) where fx) and g(x) are polynomials with real coefficients. (®) Prove that e* cannot be expressed in the form f(x}/g(x) where f(x) and g(x) are polynomials with real coefficients. 43.13, Show that (14x) a byt Ab gt eo ett" Tay = (-9 8"), and use this identity to prove that (E')-(-Ge2)+ 43.14. (@) Differentiate each side of the identity 1+ xy"= 3 (7 ah dray= BR) By comparing the coefficients of x*~! in the resulting identity, show hat m1) na ( (fot) -#(8) (b) Use the result of part a to show that Ben 7) 43,15, Let x0 = x(x — 1) ++ (= m+ 1) for na positive integer, and let x 1, Prove that for all real numbers x and y caine Se (Buyer 43, The Hdentity Theorem 14 (Hint: This can be done by induction, but consider a proof similar to 4.3.3 which first establishes the result for positive integers x and y. For this, count in two different ways, the number of one-to-one funetions from {1,2....,n} into AU B, where A is a set with x elements and B is a set, disjoint from 4, with y elements. Prove the identity for all real numbers by making use of the identity theorem.) AB.AG. Is x4 43x? + 3x? ~ 5 reducible over the integers? 43.17. Let p be a prime number. Show that @) CE — 1 (mod p),0.< ks p— 1, () CP) 0 (mod p), 2k < pl, (© G)=G) (mod p), a > b> 0, (6) (7) =2 (mod p). 43.18, Let w= cos(2u/n) + isin(2n/) . (a) Show that 1.o,02, . ¢b) Show that (1 = wl — (©) Show that o + 43.19. (a) Solve the equation x? ~ 3x?+4=0, given that two of its roots are equal. (b) Solve the equation x? — 9x? + 23x — 15 = 0, given that its roots are in arithmetical progression, 43.20, Given r,s, are the roots of x? + ax? + bx + o= (a) Evaluate 1/7? + 1/2 + 1/8, provided that ¢ = 0. (b) Find a polynomial equation whose roots are 73,53,12 43.21, Given real numbers x, y,2 such that xtytend, weypetas, Sept a7, find x* + y+ 24, (Hint: Use an argument similar to that used in 4.3.9.) We close this section with three problems which draw attention to some additional results about polynomials that are very useful in certain prob- lems. 43.22 (Theorem), Hf x,.x3,.. 54 af€ distinct numbers, and J... are any numbers, not all zero, there is a unique polynomial f(x) of degree 142 4. Algebra, not exceeding m—1 with the property that f(x) = 91. f0%) = Ba, HO) = Yu Outline of Proof: (4) Let gl) = (4 — (8 ~ 9) x). Show that a) (ae) eo) G=aKee Gn) Gam) is a polynomial of degree m—1 with zeros at xy... and which equals 1 at x= x). (b) Lagrange interpolation formula. Show that - 8) gs) IO)" Ge xjgtey'* = mea 8(%) * aie takes the vals yy, yo,» +, atthe points x,y respectively. &) Application. Suppose that P(x) is a polynomial which when divided by x= I,x—2,x~3 gives remainders of 3,5,2 respectively. Determine the remainder when P(x) is divided by (x — lox — 2\x ~ 3). (Hint: Write P(x) = OCx)(x — Dx = 20x — 3) + R(x), where R(x) is of de- agree less than 3. Find R(x) by the Lagrange interpotation formula, since R(1)=3, R(2)=5, RG) =2) 43.23 (Partial Fractions). (a) Show that if f(x) is a polynomial whose degree is less than 1, then the fraction Je) GX) G2) )? where x,,x2,+.. x, are m distinct numbers, can be represented as a sum of 1 partial fractions A Ar you tee where A,--.,4q ate constants (independent of x). (Hint: Use Lagrange’s interpolation formula: divide each side by g(+), etc.) ©) Application. Let f(x) be a monic polynomial of degree » with distinct 26105 15%, -- 4 %y- Let g(2) be any monic polynomial of degree n= 1. Show that se) Be Fa) (int: Write g(29/f(2) a8 a sum of partial fractions.) 43, The Kdeotity Theorem 143 43.24, A sequence of numbers v,uj,tg,--- is called a sequence of kth ‘order if there is a polynomial of degree K, PE) ast + ah tat ay such that w= P(D for i= 0,1,2,. The gt diference sequence fof the sequence ts, t,ay --- is the se- querer alge. dened by Wee mt 90,123,005. (a) Prove that if up.uj,tg,... is sequence of order k, then the first- difference sequence is a sequence of order k — 1. Define the second- difference sequence of t,t, ua)... to be the first-iference of the firstdifference sequence, that is, the sequence u{,u{,u\?, defined by af) 2, . Byer Bay tty, MOI, From part (a) it follows that wi?,x{%,14,... is a sequence of order 2. Similarly, define the third-difference sequence, the fourth- difference sequence, and so forth. Repeated application of part (a) shows that if uy,m.ig,... is a sequence of order k, the (k + I)st difference sequence will be identically zero. We aim to establish the converse: if the successive difference sequences of an arbitrary se- QUENEE tg, U4, -.. eventually become identically equal to zero, then the terms of original sequence are successive values of a polynomial expression; that is, there is a polynomial P(x) such that u, = Pn), n=0,1,2, (b) Use induction to prove that . w= (Gho= (Ip =(g)ae + (de (©) Suppose that the original sequence is described by the function F(x). ‘That is, suppose that F(n) = i,m =0,1,2,... . For k= 0, 1,2,3, tet A'F(O)= u{!, and for x a'real number and i a positive integer, let Be x( =~ 2) 2 Gen E+ Dy Show thatthe reslt of part (B) ‘can be written in the form Foy= 5 Os, Note the similarity to the Taylor expansion of F(x): Fea = SFM y/At) (@) Prove that if the (& + Ist difference sequence is identically zero, then 44 4. Algebra the original sequence is given by FO Wo P(ny= = =a Oy (@) Use the result of part (d) to find a closed formula for the sum of the series 1424+ --- + nf, (Hint: Notice that the fistifference se- quence is given by a polynomial of degree 4, and therefore, the sum will be a polynomial of degree 5.) 44.30, 4.431, 7.2.10, 82.2, 8.2.3, 82.10, 84.11, 4.4. Abstract Algebra A group is a set G together with a binary operation + on G such that: ) Associative property. For all elements a, b,¢ in G (arb)ee = an(bec). Identity. There is a unique element e in G (called the identity of G) such that for every element a in G, ave Inverse. For each element a in G, there is a unique element a~! in G (Called the inverse of a) such that a eae e= aed When working with groups, we sometimes think of the operation + as “multiplication,” and in this case we often suppress the * in writing products. Thus, a+b is written simply as ab, and aa(bec) is written as a(bc), ‘or abe, and so forth, Furthermore, when we think of + as a product, we sometimes denote the identity clement as “1.” In addition, we use exponen- tial notation to simplify expressions; ea = aaa, etc. Tt is not difficult to show that the usual laws of exponents hold in a group, namely, ata a at™, (aty"=a™, nym integers. The group operation need not be commutative; Le, it may not be the cease that ab = ba for all elements 4, of G. An example of such a. g70u the set of n-by-m nonsingular matrices over the real numbers, In any group G, it is the case that (aby "= ble", a, BEG. 444, absiraet Algebra 14s ‘This identity is fundamental and ca Observe that (ab\(b-"a"!) = a(b dD) = a(( “= ater) and (B~'a” (ab) = 6" "(a \ab))= b(a"'ayb) = bed) . Therefore b~'a~ is an inverse for ab, But ab has a unique inverse, denoted by (ab)~'. It follows that (ab)~'= 6-'a7', If the group G is commutative (i.e, if ab = ba for all a,b € G), itis easy to show that (ab)"= 0°", a,b EG. man integer 4.4.1, Suppose that G is a set and + isa binary operation on G such that: (i) Associative property. For all a,0,¢ in G, ae{b=c) = (ab)*e: Gi) Right identity. There is an element ¢ in G such that for every element a inG,ave =a; and (iil) Right inverse. For each element a in G, there is an element a such that ava"! = e, Prove that G is a group. ing Solution. We will show that the right identity ¢ is also a left identity, and the right inverse a~' js also a left inverse for a. Then we will show that and a! are unique. ‘Observe that a7! is an element of G, and therefore by (ii), there is an. clement (2~*~' in G such that (a~ *(a~!)"' = e, We now compute eae (a 'aye=(a naa) ofoleuey)] . (aaa) ]>@rtea> = ana" ‘This shows that a~' js an inverse (left inverse and right inverse). ‘Also, ea = (aa~ a = a( a, and therefore e is an identity for G (thet is, for each a, ea = a= ae). Suppose ¢ is also an inverse for G. Then e= eve’ (because e’ is an identity) = e’ (because e is an identity). This shows the identity elcment of G is unique. ‘Suppose (a~')’ is also an inverse for a. Then (a~') = (a Ye = @ y (aa ha" yale Tt follows that G is a group. 146 4. Algebra 442, Let G be a group. (2) Cancellation propery. For all a,b,c in G, show that ab = ac implies & ba = ca implies (b) Let a be an element in G, and consider the sequence Lage... Show that either all the elements in the sequence are different, or there a smallest integer m such that a” = | and I,a,...,.a*-! are distinct. In the latter situation, m is calfed the order of a, denoted by ord(a); the former case we say that a has infinite order. Solution, (2) This follows immediately by multiplying cach side on the left (and right respectively) by a~'. (b) Suppose that not all clements in the sequence are different, and let 2 bbe the smallest integer such that a” js a repetition of a previous element in the sequence. Then a” = I for if a* = a’, 0. for some a € G). (ii) IPG is a group and a” = 1, then the order of a divides n. We will leave the proof of Lagrange’s theorem as a problem (see 4.4.18); however, itis instructive to see the arguments for the corollaries. Proof of (i). Let. a G and let m= ord(a). By Lagrange’s theorem m Aivides 1, $0 suppose n= mg for some integer g. Then a” = a™ = (ay =e Proof of (ii). Let a be an element of G different from the identity. Then divides p, but since p is prime, it must be the case that (a) is of order p; that is, = G. Proof of (i). Let m= ord(a). By the division algorithm there are inte- gers g and r such that a= gm-+r, O BS. Squaring gives a°b'a>= D™, and substituting gives a’ba* = b'S, One more time: a°b'a~* = b™, or equivalently, a%ba~* = b*, But a5 = a~* = 1, co b= 6°, and on cancollation, we get b! = 1. Since 31 is a prime number, the order of 6 is 1 (if is the identity) or 31. 44,5. If G is a finite group and m is a positive integer relatively prime to the order of G, then for each a in G there is a unique 5 in G such that bm aa, Solution, Let 7: G— G be defined by T(x) = x", We aim to show that T'is 4 one-to-one function. So suppose that T(x) = 7(y) for elements x and y 148 4: Algebra of G. Then x" =p", Let n= ord(G), Since n and m are relatively prime, there are integers s and ¢ such that s+ imt~ 1, Hence x= x7" = (xt "Y = (xPY (singe x= 1) = (pV (since x” = y™)= Cy" 7 (Since y" = 1) = y= y. ‘Therefore T is a one-to-one function, and since G isa finite set, Ts onto G. That is, for @€G, there is a unique & in G such that 7(b)= a (equivalently, 6 = 2). The first corollary to Lagrange’s theorem states that a") = | for each element in the finite group G. This has a number of interesting and important consequences when applied to particular groups. For example, let ¥,, denote the set of positive integers less than m that are relatively prime to n. The elements of ¥, form a group under multiplication modulo #. Let (2) = ond(¥,). (The Function g is called the Euler g-function.) Then Lagrange’s theorem implies the following. aler's Theorem. Ufa is any integer relaively prime to.n, then aro = 1 (mod 7). When n is a prime number, say n= p, we have q¢p)=p~ 1, so that a?~' 21 (mod p) whenever a js not a multiple of p. If we multiply each side by a, we get a” = a (mod p). This congruence holds even when a is a multiple of p, and thus we have the following result. Fermat's Lite Theorem, {fa isan integer and p isa prime, then 4 (mop). 4A, Prove that each prime divisor of 2°—1, where p is a prime, is greater than p. (It is a corollary that the number of primes js infinite) Sofution. The result is true for p = 2, so henceforth assume that p is odd. Suppose that g is a prime that divides 2? — 1. Then g is odd and 2° =1 (mod 4). By Fermat’s little theorem, 2-)'= 1 (mod q). If g= p we have 2=2X1=2x 2! = 2 P= | (mod g), a contradiction. If ¢ 1. First consider the case in which ged(a,b) = 1. We will prove there are an infinite number of terms of the arithmetic stquence an + & among the terms of the sequence (a + 6)!, k= 1,2,3,.. From Euler's theorem, 6° = 1 (mod a), since b is relatively prime to a. 1 follows that for cach positive integer s, By teger + there is an integer 4, such that (at byt ts pater b (mod a). This means that for each positive it (a4 by MO = ga +d, Te follows that each of the terms qa +, x= 12,3... has only those prime factors that occur ina +b. ‘Now consider the ease in which ged(a,b)= d > 1. Then god(a/d,b/d) ~= 1, so from our preceding argument, there is a e such that infinitely many members of the sequence (a/d)n + (b/4) have all their prime factors < « From this it follows that infinitely many members of the form an + 5 have all their prime factors < ed, This completes the proof 150. 4 Algeben A ring is a set R with two binary operations, + and -, such that () Ris a commutative group with respect to the operation + 5 For all a,b,c in R, a(be) = (ab)c (*-” suppressed), For all a,8,¢ in R, a(b +) = ab + ac, (b+ ea = ba + ca. R need not have a multiplicative identity: if it does, we say R is a ring with identity. The multiplication in R need not be commutative: if itis, we say that Kis 2 commutative ring 44,10, Let a and b be elements of a finite ring such that ab? ~ b. Prove that bab = b) Solution. Obviously, if the ring were commutative the result would be immediate, but we must show the result holds even when the ring is noncommutative, In addition, we cannot assume the ring has a multiptica- tive identity. Suppose b= b?. Then bab bab?= b? = b, and we are done, Sup- ose 5-6" for some integer m> 2. Then bab = bab" = b(ab")6™ ? rtm Db, and we ate done. Therefore itis suficient to show that b = 6 for some integer m > 2 ‘Suppose the ring has n elements. By the pigeonhole principle, at least ‘two elements in the sequence ,b%,...,b*,b"*! are equal. Let i be the smallest integer such that b‘ equals some subsequent power of b in the preceding sequence; that is, 6°= A"), L. Then multiply each side of ab?= 5 on the right by b'7"? to get ab! = B77". But since Bé = 7, we have ab! = 6°/~!_ From here there are two cases to consider. Suppose / = 2. Then b= ab? = b/*! (from the last equation), and this contradicts our choice of 1. So, suppose #22. Then b's b- bi? = (ab?) x bi? = ab! = ab!*/~", which agnin contradicts our choice of /. ‘Therefore, i= 1; that is, B= b! for some j. By the argument in the first paragraph, the proof is complete. ‘An integral domain D is a commutative ring with unity in which for a,6 in D, ab = 0 implies a = 0 or 6 = 0, The cancellation property holds in an imegral domain, For, suppose ab = ac and a #0. Thea a(b ~ c)=0, 50 be =0, or equivalently, b = ¢. Similarly, ba = ca, a-%0, implies b = c. A field is a commutative ring with identity in which every nonzero element has a multiplicative inverse. AA, Abavact Algebra 151 44,11, Show that a finite integral domain (an integral domain with only & finite number of elements) is a field. Solution. We must show that every nonzero element of the integral domain has a multiplicative inverse. So, let D* = {ay....,a,) be the nonzero D* by Tia) = aq, If T(a,)= T(q) then aa, = ac), s0 by the cancellation property, 4, =, Thus we see that T is a one-to-one function. Since D* is finite, the mapping 7 is onto D*, But one of the clements in D* is the multiplicative identity, denoted by 1. Therefore, T(a)= | for some a, © D*; that is, aa, =. This shows that a has a multiplicative inverse. Problems 44,12, Let G be a set, and + a binary operation on G which is associative and is such that for all a,b in G, a% = B = ba? (suppressing the +). Show that G is a commutative group, 44,13, A is a subset of 4 finite group G, and 4 contains more than ‘one-half of the clements of G. Prove that each element of Gis the product of two elements of 4. 4.4.14, Let H1 be a subgroup with h elements of a group G. Suppose that G has an element a such that for all x in H, (xa) = J, the identity. In G, let P be the set of all products xyaxya +» x,d, with a positive integer and the in H. Show that P has no more than 34? elements. 44.15, If a""ba™ 6-! and b~'ab = a~! for elements a,b of @ group, prove that af = b= 1 . 44.16, Let a and 6 be elements of a finite group G. (a) Prove that ord(a) = ord(a~"). (b) Prove that ord(ab) = ord(ba). (©) If ba = a°B?, prove that ord(a‘b) = ord(a*?). 44.17, Let a and b be elements of a group. It 5~ b-'a'b” = a for all positive integers r and s. 4.4.18 (Outline for the proof of Lagrange’s Theorem), Let G be a finite group and H a subgroup with m distinct elements, say H = {1.hy, Fis, +s hy): or each a € G, let Ha = (a,hy2hyd, ya) (a) Prove that Ha contains m distinct elements (b) Prove that Hh, = H. (©) If 8 € Ha, prove that Ha and Hb are disjoint sets. =a, prove that 182 4. Algebra (4) Prove that there are elements a),23,..., a; in G such that G= Ha, U Ha, U --- U Ha, and Ha; Ha, = Oi i Fj. (©) Use the previous results to formulate a proof of Lagrange’s theorem, 4.4.19. Find the smallest integer n such that 2" — 1 is divisible by 47. 44.20, Prove that if p isa prime, p > 3, then ab? ~ ba? is divisible by 6p. 44.21. Let a and b be relatively prime integers. Show that there exist integers m and n such that a + 5" = | (mod ab). 4422. If a,b,c,d are positive imtegers, show that 30 divides a***4— 44.23, Let T, = 2" + | for all positive integers. Let q be the Euler g- funetion, and let & be any positive integer and m= n+ kq(T,). Show that Tis divisible by T,. 44,24, Prove that there exists a positive imleger k such that &2" +1 is composite for every positive integer n, (Hint: Consider the congruence class of n modulo 24 and apply the Chinese Remainder Theorem.) 44.25, A Boolean ring is a ring for which a” = a for every element a of the ring. An element a ofa ring isnifpotent if a” = 0 for some positive integer n, Prove that a ring & is a Boolean ring if and only if R is commutative, R contains no nonzero nilpotent elements, and ab(a + 6) = 0 for all a,b in R. (Hint: Show that a* ~ a? = 0, and consider (x” — x*)*) 44.26, Let R be a ring with identity, and let a © R. Suppose there is a unique element a’ such that aa’ = 1, Prove that a’a = 1 44.27. Let R be a sing with identity, and a be a nilpotent element of R (Gee 4425), Prove that 1 — a is invertible (that is, prove there exists an clement b in such that b(1 — a) = I = (I — a)b) 4428, Let R be a ring, and let C= (x R:ay = ys for all y in R). Prove that if x*— x © C for all x in R, then R is commutative. (Hint: Show that xy + yx © C by considering x + y, and then show that x? € C.) 4429. Let p be & prime number. Let J'be the set of all 2-by-2 matrices 4) whose entries are chosen from (0,1,2,....p—1} and satisfy the conditions a + d = I (mod p), ad — bc = 0 (mod p). Determine how many members J has. 4430, Let p be a prime number, and let Z, = (0,1,2,...,p~ 10-2, isa field under the operations of addition and multiplication modulo p. (@) Show that 0,1,...,p—1 are the zeros of x? x (considered as a polynomial over Z,). Conclude that x? — x= x(x 1Xx 2) (x ~ (p— 0) (mod 7). 44, Abstract Algebra 153 (©) Wilson's theorem. From part (a), show that (— IS ~1 (mod p). (©) Consider the determinant |ay| of order 100 with a, = ij. Prove that the absolute value of each of the 100! terms in the expansion of this determinent is congruent to 1 modulo 101 4.431, Let F be a finite field having an odd number m of elements. Let (p(x) be an irreducible polynomial over F of the form x? + bx + ¢, be € F. For how many elements & in F is p(x) + k irreducible over F? Additional Examples 115, 1412, Chapter 5. Summation of Series Tn this chapter we turn our attention to some of the most basic summation formulas. The list is quite short (eg, the binomial theorem, arithmetic- and ‘geometrie-series formulas, elementary power-series formulas) but we shall see that a few standard techniques (e.g. telescoping, differentiation, integra- tion) make them extremely versatile and powerful 5.1, Binomial Coefficients Here are some basic identities; we are assuming that m and & are integers, neko. Factorial representation: aw Q) B) (Ca) (Gri} ke “ 154 5.1, Binomial Coeficiens 155 ‘The next formula is obtained by repeated application of the addition formula. ‘Summation formula: (2) + ("Ele (ER (n tee H), ny Sums of products (see 4.3.2 and 1.3.4): OOO dt OOF) Binomial theorem (see 2.1.1, 2.1.11, 43.3): Seo (ty 0) 5.1.1, Use the summation formula to show that Oy are ee MEENA D ‘Solution, (a) We have rare eel) (i}ee 90) =()(*G)+- +6.) “eS (b) We first look for constants 2 and 6 such that wa a(t) +o(t)= oA) soe for k= 1,2,...,n. Think of each side as a polynomial in k of degree 2. The identity will hold if and only if the coefficients of like powers of k are equal; that is, if and only if Is a/2, 0= -a/2+5. 156 5, Summation of Series This yields a= 2 and b = 1, It follows that PAR go tw “Pa (PE A+ va) ul “18-6 oer (G++) =) +(e a)] 10) + +] nofnttje (nt evn s) 25 Den =H) (te se z n(n + 1Qn4 ty ore (Another approach for part (b) is given in 5.3.11) ‘The preceding sums occur so often that it is desirable to memorize them ‘in some way be able to recall them easily. One way to remember the first formula is shown in Figure 5.1 for n = 5). ‘The diagram also prompts the following argument for the general case. Let $ denote the sum of the first positive integers. Then Salt 2 tothe Sent(nm ieee Leatatass = Figure 5.1 51, Binomial Coeticients 137 Adding, we get amt l s(n lee HH D, =n(ne ly, and it follows that n(n ly so ‘The technique of evaluating a sum by rearranging the terms is a ‘common one. In particular, when the terms are represented as a double surumation, it is often advantageous to exchange the order of summation. ‘The next example is an illustration of this idea. 1a, sim SSG) Solution. The terms of this sum are indexed by ordered pairs (i,j), where (G2) vary over the elements in the following triangular array: Tn the given sum, the elements are first added columnwise. When we interchange the order of summation, so that the terms are first added rowwise, the sum is expressed in the form ZR) SQA} io! 158 5. Summation of Series ‘This is casily evaluated in the following manner. According to the binomial theorem, woo 30 BU) ‘The original sum is therefore En A which by the binomial theorem is (I +2)” = 3%. When x= 1, we get 51,3, Sum the following: ) (7) #23) #305) #2 ae USSG} gat): Solution, The first sum is zi) ‘Our aim, in summations of this type, is (© use the in-and-out formula to bring the index of summation “inside” the binomial coefficent, Since ()- Fz ]} O(a) Si) E07} -R (to =n S("74) it follows that and therefore = nx2 51, Binomial Coefficients 159 ‘The second sum is Bat and therefore, -bee-i There is another instructive way to handle these sums, based on differen- tinting and integrating each side of Elisa. For part (a), we differentiate to get Si("x tenet, & and, with x = 1, we get Si(t= mart For part (b), we integrate to get 3) wee tay When x=0, the left side of this equation is 0, and this implies that C= =1/(n+ 1). Thus, when x= 1, we get (as before) 20m sit) 160 ‘5. Summation of Senet $.1,4, Show that Ca) 3G) OU aa ee ey ‘Solution. The left side of the identity looks like the definite integral of a binomiat series, and this provides the idea for the following argument: toate(s)-(Ie eGo eat (e BeBe =)" my _ pn 2 x OGG} We are now set up to integrate each side from 0 to 1, and we get tl Y ee (” nm i L 4e=(1)- 203) +30)- ‘To finish the problem, we must show the integral on the left is equal to LH U24 1/34 + +1 /n Lety = 1 ~ x. Then poe gen (Hy = [Urrerte ene st¢he---4h etede ad ‘The problem can be done without calculus, using the basic identities of this section, but it is technically harder. However, since it is instructive, we will sketch the idea, First, by rereare use of the addition formuia and the in-and-out ale =H) ea “HCPC ea HT) ers) re) " i's + v4 (5, TO) aC) 5.4, Binomial Coefficient 161 raion, foot Se" EC x5} ihn we intsange the or of suman w bin Sis y(t 4 ole Let k = —j, so that the right side is 5 Sceyr(t eS eScor(sy} = Eb cess) BECO) Solution, This can be evaluated using the basic identities of this section; however, we want to illusteate another technique. Although this approach ‘will seem artificial and unlikely, the fact is that the thinking is not as umusual as it might at first appear. The idea is to interpret the sum in probabilistic terms, in the following manner. ‘Multiply the sum by 1/2"*? and write it in the form Slow 2s} Now consider the following matching game between players A and B. Player 4 flips n + 1 coins and keeps n of the coins to maximize the number of heads. Player B flips » coins. The player with the maximum number of heads wins, with ties awarded to B. Observe that the above sum represents the probability that 4 wins. We will now calculate this probability in another way. ‘The game is equivalent to the following. Let A and B each flip n coins. ‘The player with the most heads wins. If they each have the same number of heads, but not alt heads, 4 flips the (n+ I}st coin, winning if it is heads and losing if it is tails. At this point, 4 and & have equal chances of winning. In the remaining case, both 4 and & have all heads. In this case B wins regardless of 4°s last toss, Thus, B wins in exactly 2 more eases than A. 162 5. Sommmation of Series ‘That is, out of the 2*! total flips, B wins in the 2 cases last described, and. B wins in exacily one-half of the other cases (4(2"*!— 2)). Thus, the probability that A win is 244(2"*'-2) ned pte 1 = Pre wins) = 1 — 24 HOC 2) _ geet 2-2 pat yet pri 1t follows that the original sum is 2° — Problems 5.1.6. (2) Sum all the numbers between 0 and 1000 which are multiples of 7 oF iM (®) Sum all the numbers between 0-and 1000 which are multiples of 7, 11, or 13, SAT. (2) Prove that for any integer k > 1 and any positive integer n, 1 sum of n consecutive odd numbers, (b) Let n be a positive integer and m be any integer with the same parity as rn. Prove that the product mn is equal to the sum of m corsecutive odd integers. 5.1.8. Use the summation formula (5) to sum (a) Sh=k°s (6) Die 5.1.9. Sum each of the following: @ (+) G+ +9) (0) 12(8) 42 23(8) 42 4G a © yore (3}+ se (2). @( a 2(5)+3°(3)-- #-(I)- © att) 4U3)- eco © Ble nl i SH 5.1.10. {a) What is the probability of an odd number of sixes turning up in a random toss of n fair dice? (To evaluate the sum, consider 4[(x + 3)" ~ @-yh is the 5.1, Binomial Coefficients 163 (©) Show that if m is a positive multiple of 6, (1-38) +26) - ()-3)* 36)- 5.1.11, Prove the following identities: ogi sfefengh maleate] S.LLI2, Show that eee oe {Mn da)+ +N) Cra) of +(e +=} ne Use the idem of this sen to show hat S| 2k (pe? 2(2072) 5.1.14, Sum Se ote (Hint: For é= nn l,...,2n—1, compute P(6), the probability that / tosses of a fair coin are required before obtaining m heads or n tails.) S.L15, A certain student, having just finished a pasticularly hairy summa- tion, stared glassy-eyed at an “x,y” which was written on the seratch paper. After some doodling the student wrote: iy Q) a yeysts QA yays%eysXerYe GB) 1 Y2yo%aysXoXr Yo YoX Xn Nas 4Y X16 + 164 5. Summation of Sees ‘On each tine, the student copied the line above exactly, and then copied it again, changing x°s to y°s, ’s (0 x's, and continuing the subscripts in order. “The student noticed that the sum of the x-subscripts equals the sum of the _y-subseripts in line (1). In line 2) the same equation holds, a similar one for ihe sums of the squares of the x- and y-subscripts, ie, ?+4°+6°+ 7 22+ 324 $24 8%, The student immediately made the inductive leap that line (n), the sum of the kth powers of the x-subscripts would equal the sum of the kth powers of the y-subscripts for k= 1,2, ...,. Prove this for all n>0. Additional Examples 134, 13.15, 1114, 214, 242, 43.5, 43.13, 43.14, 43.15, 43.24, 683, 7.29, 738. Applications of the binomial theorem: 1.1.4 (Sol 1.12, 13.8, 16.606), 1.124, 35.8, 3.5.10, 3.5.11, 35.12, 3 449, 5.1.2, $1.15, 5.2.13, 683, 7.15, 7.115. 4), 3, 42.13, 43.5, 5.2, Geometric Series ‘The geometric series arises naturally in many problems, and it is therefore imperative to know its sum: 5.21, For a positive integer n, find a formula for o(n), the sum of the divisors of n. Solution, Clearly o(1) = 1. Ifp is a prime, the only divisors are | and p, so o(p)=p +1 If nis a power of a prime, say n= p™, the divisors are 1, 7, soa(p™)= 1+ p= + p™ = (1—p™)/(1- p)- ‘Suppose » = ab, where a and b are relatively prime integers, cach larger than one. Suppose the divisors of @ are a,,a; .@, and the divisors of & are bj.By +00. Then’ the divisors of are a, 1=1,2,....%j 81, 2,...,frand the sum of these is lab b= ab) + (abit ah) Hab eo + 0,by, eee 52. Geomette Sevies 6s or equivalently, (ait ag bs Faby + byt +B. ‘Thus, o(n) = o(a)0(6). Consider now an arbitrary positive integer n, and suppose its unique factorization is m= pipe Pe. From the preceding work, we find that won (FETE) (SS) 5.2.2, Let n= 2m, where mis an odd integer greater than 1, Let @ = e?/* Express (1 — 6)~! explicitly as a polynomial in 8, 08 + 0,08 + = a, + ay, with imeger coefficients 4, Solution. Notice that @ is an nth root of unity, and that 0 = (e™\2"y" =e" = 1. Thus, Pace ggmta Lae" 2 140404 40m ta Lao 2, a Also, since m is odd, we have 042 =o. @ Now, adding equations (1) and (2), we get DWH 2G or, equivalently, P44 O44 9mm 5.2.3, Sum the finite series cos + cos20-+ +++ + cosnd. ‘Solution. The series we wish to evaluate is the real part of the geometric Oe He ee 16 5. Summation of Series whose sum is etre in - wi lee FF BF sans [ (008m + 4)0 ~ cost) + i(sin(n + $}0—sin4)] = rae [(ingn + 4)@ ~ sing) + i(c0s$6 ~ cos(n + 4)8)]- Equating real parts, it Follows that cos 8 + cos28 + +++ + cos iano (nm + 4)6 — sin $8] sinn+4)8 4 2sinj@ 2 when reduced to lowest terms, is of the form a/2" where a is odd and wen, ‘Solution. We can write the fraction in the form Gn)! 1 (an) Pa Now, (3) is an integer, so the only question that remains is to show that w 0, evaluate in closed form 2 (cnr ye Solution. Write x in the form xeb1+ SF where a, is 0 or 1. and where if x has the form m/2" (m an odd integer), wwe take , = 0 for al sufficiently large For each n, [2"x J is even if and only if a, = la ~ 24, Therefore, 2 (- = 0. 14 follows that for each 5.2.6. Evaluate in closed form 168 4, Summation of Series where the sum extends over all positive integers p and q such that p and g are relatively prime. ‘Solution. daes(tr) = 2 29(E (25) As p,q, and m vary over the index set in this sum, the powers of 1 /x will vary over all possible ordered pairs of positive integers (i, )- Since the sctis is absolutely convergent (I/Jx| <1), we ean rearrange the terms of the series into the form dae Problems 5.2.7, Let n= 2° 'Q?—1), and suppose that 27-1 is a prime number. Show that the sum of all (positive) divisors of 7, not including m itself, is exactly 2, (A number having this property is called a perfecr number.) 5.28, Sum the series 14224333 + ++ +a... 1). teat 5.2.9. Let E(n) denote the largest integer & such that 5* is an integral divisor of the product 1'2°3" - --n”. Find a closed-form formula for ES"), ‘ma positive integer. What happens as m—> 00? 5.2.10. A sequence is defined by a, = 2 and ¢, = 3a,_, + |. Find the sum OF ayb tay 52, Geometric Series 169 SLL, Verify the following formulas: (a) Ssin ak — yo = sin’nd a © Sam ex p= — pn — inde 5.112. (a) If one tosses a fair coin until a head first appears, what is the probability that this event occurs on an even-nurnbered tors? (b) The game of craps is played in the following manner: A player tosses a pair of dice. If the number is 2, 3, or 12 he loses immediately; if itis 7 or I, he wins immediately. If any other number is obtained on the first toss, then that number becomes the players “point” and he must keep tossing the dice until either he “makes his point” (that is, obtains the fiest number again), in which case he wins, or he obtains 7, in which cease he loses. Find the probability of winning. 5.213. Ifa, 6 and c are the roots of the equation x? — (a) show that a, 6 and ¢ are distinct; (&) show that 30 _ 1000 is an integer 5.2.14, (a) Prove “fal < Thyap'/"?~?, where the product on the right is over those positive primes p which divide n: (int: First prove that (3) |S) <7) (b) Use part (a) to prove there are an infinite number of primes. (Hint First prove that (n!)? > n”) 5.2.15, Prove that []2.o(1 +x") = D29x"= 1/1 — 9), [al < be 5.2.16, Evaluate in closed form: 2 g(x /(1 — 2", |x] <1 5.2.17, (a) Let py. py. spa be all the primes less than m, and define rom Fi 2)" mae Show that (mi) = Spfps# + pat)~', where the sum is over all n-tuples of 170 5. Summation of Seri nonnegative integers (a;.25,.- 4): (Hint: 1) aia (4)a(4yae- (a) a) Gye) (b) Show that 14 1/241/3+ +++ 1/m, mw tw ai ately 2nd wma S18 [ee ue) cs mene? ny - 3 ata l(t-sts)* (aa) 3 1 ~ 2 mast a -E(-ats)ted+ +a) HAO) tse DFG HU tse se dy) HCE HHH SHH te] ALIFE Fae Ee a EE) FHF DHE] aif[iy1. 1,4 26 *2" t+ (seat stat) +(sestaxet seat) wi[P +H (“D+ G+ FHF GA + GHA E-)] ai[Bteteee+e] =} [Meee] wT, toy 53, Telescoping Series 53.4, Sum the series = 3 'sin'( 3) Solution, Using de Moivre's Theorem, sin39 = Im(e**) = Im( ey") = Im[cosé + ‘sin 8]? = Im[cos'# + 3.cos'Pisin® + 30s i'sin’@ + Pind] = 30s sin # — sin'® = 3[(1 —sin'# sind] — sin’ = 3sind — 4sin"@, Ie follows that in =} sind — 4 sin. Thus, Sy = Sie) - = (Fain — Jains) 4 (F +{ 2s )- Fan(S))+- : (93 (F4(5) = F sin( 3.) ~ } sins. ‘Therefore, he series adds 10 ian i ‘The telescoping idea is particularly useful in solving recurrence relations. ‘Here is an example; other examples are given in the next section. 174 5. Somiation of Series 5.3.5, A sequence of numbers satisfies the recursion y= 0, mya (n= 2x y+] for m>O. a closed-form expression for x. Solution, We see that xy=0, x,= 1, = 4, x= 4, and consequently x= 4 for all a >2. But finding « paitern for a given recursion is not always so simple, and it is instructive to consider the problem in the following manner. For m > 2, multiply each side of the recursion by x — 1, and for each n, set y, = n(n ~ Dx, The recursion in terms of the py, is Yea (M1, ym 1 Follows that don, Pe Bad Bn Inn Adding (notice the telescope), we get Br bede a(n yO, and therefore, Problems 53.6. Sum the following: 1,2 ,3,.. Oe ge ty (b) 1X WFD IES BE KM, 3 2 4 6 . © Txaxd *ixaxa taxaxs tot 5.3.7. Evaluate the following infinite products: @) 0-1/7), (6) TTS GP = 1/08 + 1). (©) Show that an infinite product can be transformed into an infinite series by means of the identity P= e*, Work part (a) in this way by evaluating the infinite series Slog — 1/n*). 153, Telescoping Series 175 $3.8, Prove that for each positive integer m, m Fa 3m 4 rene <2. 2 SGenamsh + anges Nama (Hint: Notice that I/r¢r + 1} < W/e? < 1/(r + Dr — DD 539, Let Fi, Fa... be the Fibonacei sequence. Use the telescoping property to prove the following identities: (0) Ft Fat oo + Fm Fuga b Hints Fa Fy Fy) (0) Fit Bt Fann Foe (6) Fie Pha Fe RRs. (Hin FP Fy (Fogy~ Fed Fy En @) SEaN/ FF FE) © Lise FFs he 5.23.10, Sum the following infinite series: fer Lsintte cb sintsie 4 ca) sinc t Lain Aine +, Px = beos3x + bcos 4. () caste ~ Feos'bx + peor +, (Show that 1/F,—\Fy4) = 1/F,_ Fe = 1/ 53.11, (a) Use the identity ( + 1P — k= 34? 4 3k +1 to evaluate the sum of the first m squares. (Hint: Let & vary from I to m in the given identity, and consider the sum, on the left side and the right side, of the resulting zn equations.) (b) Use the telescoping idea, asin part (a), to evaluate the sum of the first cubes. (©) Find 3 So wives) ie 53.12, Show that the reciprocal of every integer greater than I is the sum of a finite number of consecutive terms of the infinite series DAl/nr + $3.13, If m > 1 is an integer and x is real, define no- 53 [242 ]} a Show that [El it x0, wor {hh 9 22h (lint: See 1.2.3), 176 5. Summation of Series 5.3.14, Solve the following recurrence relations (by the methods of this section). (a) Xo= Lx, = 2x,-, +I for n> 0. [Hint: Divide each side by 2°] (b) x= 0, nx, #On+ Ds, + 1 for n> 0. (0) Xo= bey = Lay Ze kyey = ¥, +3 for > 0, 5.3.15. Show that a plane is divided by 1 straight lines, of which no two are parallel and no three meet in a point, into $(n?-+ 2 + 2) regions. 53.16, Let Show that s¢5 2-1 ‘WaT a’ [Hint: Consider the telescoping series 7c {(d,~ 4] Conclude that d,>log2 as n->oc. (For another proof of the first part, consider the difference of each expression from the harmonic sum 1+ 1/24 +++ + 1/Q(n— 1). Also, see Section 6.8.) Additional Examples 6.6.6, 7.18, 7.22. 5.4. Power Series [A power series is an expression of the type ay bays tag toe eax where dg, a;,a2,... are real numbers. Given a power series, we can define a function f(x). whose domain is the set of those real numbers x which make the power series into « convergent infinite series, and whose value is given by Se) = ay aye aye + se ae™ eo for any ¢ such that the right side converges. Given a power series S:%.9¢;2", it ean be shown that exactly one of the following holds: (i) The series is convergent for all real numbers x. il) The series is convergent only for x= 0. SA, Power Sevies WT Gil) There cxists a real number r such that the series is convergent for [x| 7. ‘We define the radius of convergence to be +20 if i) holds, Of (iy holds, and r if Gi) holds. ‘We can ask the following question: Given a function f, is f represented by a power series? One result along these lines is Taylor’s theorem (with remainder): If f can be differentiated as many times as we like on an interval (0,0, then £O (0) J00)= 10)+ 22 LOL 4 LO 6 Ren, where R(x) =f" %c)a"*!/(n + I! for some ¢, 0< ¢< a. The impor- tant part here is that if R(x) is well behaved, so that Ry(x)>0 as n> 00, then ee fo 5 oe ‘This gives us a method of fndig a power series for a given function f(x). Using this ides, one can find power-series expansions for the most common elementary functions. The following series occur so often they should be memorized: 5 eelert ae ee, 6 sinxa x +H- ute Gi) ” ay a) led eyex Se Poe yZ ae, lek @ (exyets(j)e+(S)r+- A (A)atb eres reek lal ch, wy where r(e— Wr 2) (rat) (n)- 5.4.1. Prove that ¢ is an irrational aumber. 178 5. Summation of Series 1 1 slaty abst Multiply each side by kt, and write in the form 1j._1 1 oon eet espesy + ‘Notice that the right side of this equation js positive, and the left side is an ‘integer. Thus, the left side is a positive integer. However, on the right side, ee a Fat * Hees * Re HR THET 1 1 -ra|!* ms — n, and this means that f(x) is a polynomial, a contradiction. Therefore we are forced to conclude that the ‘power series for f(x) cannot have three successive zero coefficients. zero, say f'%40)= f' 5.43, Evaluate lim, .[(e/2)x + x°U(1 + 1/2)" ~ el Solution, We will find the first few tetms of the Taylor series for (I + 1/)* in powers of 1/x. We have (14 4)'- ee vo nesol faye) 5 ey. I} mooft 42) -AYo) meee bunghrng tape? It follows that sin [Sere [(l 4 ‘An extremely useful fact about power serics is that they can be differen- tiated and integrated term by term in the interior of the interval of convergence. By this we mean that if 3a,x” has a radius of convergence r 180 8, Summation of Series and it fo = Yoga hen p= Smeg) and fs nden ea, ‘and both resulting series have radius of convergence r. ‘One consequence of the preceding result is that the power-series repre- sentation of a function f is uniques that is, if f(x) = Sia," = S'b,x", then 4, = b, for all n. In fact, a, = b, = f'"%0)/n!. To see this, simply differenti- ate each side of f(x) = a,x" repeatedly and evaluate each successive derivative at x= 0. For example, f(0) = ap; f"(x)= Siaa,x"~!, 80 f(0) = ay; {x)= Sa(n— a,x" 30 (70) = Bay, OF equivalently, ay = 7°(0)/2!, and so forth. 5.44, Sum the infinite series Muhtiply each side by x: and differentiate each side: & (nt et (angers § OEE 2 Multiply each side by = again: yer and differentiate to get 2 (nt ipa" (tare rere FT a Now set x= 1, and find that @ (n+l 298 ‘The following theorem is often useful. $4, Power Series 181 bets Limit Theorem. Let ¢> 0, and supose Sate converges, Tien DFaoa,r" converges absolutely for |x| , cegyt(mtko0 - SO Be Sa = —48,_, +28, 1 — Spa Sat Spun 54. Powee Series 18s Using this recurrence relation, we can usé mathematical induction to establish the claim that , = (—1¥'Qn + D). Consider the recurrence relation Sp7 28,24 - Sm Som ly $= -3, and, for the sake of the illustration, et us suppose that we are not able 10 discover the formula for S, by a consideration of the first few cases. We wish to give here a technique for making this discovery. The method is to make use of a generating function F(x), in the following way. Let F(x) be the name of the power series whose coefficients are Sy, S,, Sys namely, F(x) Sot Sixt Sp24 + Sx We will act as though the series converges at x to the function F(x), Then 2uF (x)= 2yx HIST HIS P+ +25, PF SyxPt SPH a Shae ‘Adding, and making use of the fact that S, +2S,_, + S,_2=0, we find that Bry (42x + }F(a) = 84 (S, +28), or, equivalently, Fay= te, wy We now express the right side of this equation as a power series. To do this, first differentiate each side of to get Then multiply each side by x ~ 1 to get Foy Boia yet 2 SC ye Beoyinn yas Se-ufens pet - Stent per Here again, we find that 5, the coefficient of x4, is S,=(—1"Qn + 0). 186 5. Soypmation of Serer I is trve that the gencrating-function approach shown here cannot be justified in a step-by-step manner, since we have completely disregarded ‘convergence considerations. However, the method can nevertheless be used in similar problems to formulate conjectures (about the solution of the recurrence relation), and these conjectures can then be verified by other ‘means (for example, mathematical induction), SA, Sum the Finite series ay + y+ +++ +, where ay 2, a, = 5, for >My 54-1 — 60a. ‘Solution. The first few terms of the g;-sequence are 2, 5, 13, 35,97, 275, 393, ... Here, a general formula for the ath term is not apparent, so we turn to the technique of generating functions. Consider F(x) = dg taux + aget te parte We have = SRF (x) -Sagk = Sayx?~ 06+ Say xt eee 6x7F(x) = Gagx? 4 ++ 46a, 2x4 ‘Adding and using the recurrence a, ~ Sa,_, +60, 2 0, we get (15x + 62°)F(x) = ag + (a4 — Sag), so that 25x FO)" and a Write this as a sum of partial fractions, and make use of the geometric series, to find that FO" Iie Tae + Sen's Fo.) RO” ee = Sax ‘Thus, a, = 2 +3' for i=0,1,2,3,... . [As a check, we can verify this formula by induction. Note that gp=2°-+3°=2, a, =243= 5, and, for 522, a= 5a,_, — 6a, — 2? + 8-H) = OF + 32) ow SN IY HBX DA DK II TY 54. Power Series 187 We are now ready to compute the sum: at at ta—= D+ =— DP Dy = a) gett yet 7 3-1 cyte yg Ble atop Pat prety tle Pespees. S410, Find a closed-form expression for T,. if Ty= 1 and for n> 1 Ty Tolga Tp at 0 tT To ‘Solution. This recurrence relation arose in 3.5.12. To solve it, let SC) = Tot Tet Tox? ho AT xh and set P(x) = xf(xy = Tot Dy Ty ee Tx The reason for this step is that (Pays TB? # (ToT + Toye + HTT yA AT Ty at + Tyo Toye ey ‘so im view of the recurrence relation we have (Fea = Te? + Tat to Txt! = FQ) Tox ‘Using the quadratic formula we find that Lave Faye (We choose the negative sign because £(0)=0; the positive sign would yield F@O)= 1) Now by the power-series expansion, WHR 14 (849 + (1 -ante 5 Jette 188 5. Sommation of Serse It follows that the coefficient of x“? in F(x) is ( r a 3 3-3) cayetigert (#ti} y 1 1X3 KSxK +++ KQa— ly ei" a+tgret rn a re i 1 AKI 3K 4x KOM get 2 Gea 1, Gm aT oe 4 oa (7) Ina manner analogous to the case for real numbers, we can introduce the notion of a complex valued power series Dae wo where the coefficients may be complex numbers and z a complex variable, ‘The values of z for which this series converges defines a function fey> Sas. 0 It can be shown that the power series (2)-(vi) given for the elementary functions at the beginning of the section continue to hold when the real variable x is replaced with the complex variable 2. ‘A useful fact regarding complex power series is that if f(2) = S202", then Re lz) = DyaqRe(a,2") and Im (2) = De glm(a,2") Asan example, we will justify the use of the formula e# = cos@ + sind inwoduced in Section 3.5. We have Ree* =Re scr Sui fbi = 3 aE eco and = wy = yw (-yenet tmet= im FOP 2S yg OY 2S COO _ ine, m7 25 QeEDE It follows that e” = Ree® + ilme" = cos + isin at By 54, Power Series, 189 SA,11. Sum the infinite series S= roost + Fes + Fest, Or <1, OK OK Solution, Consider the infinite series 2 mlog ayn 24 8 kc. and set 2 = r(cos@ + isind), Then —log(1 — reos@ ~ irsin#) (e088 + isin 28 = r(o0s8 + sind) + HERES F878) and taking the real part of each side gives, Re —log( ~ revs — irsind’)) a 2 wee = reost + 500826 + 00838 + Now, for a complex number w, logw = log[w| + Jargm. It follows that resets Beog2h 4 = on regt)P a = -logyl — 2rcosd + 7 Problems 5.4.12, Let p and q be real numbers with I/p—1/q= 1,0

0 for all n>o 5.4.22, Prove that (LES) ator diary SH Anb HQ ee [lcd 5.4.23, Let T= Sha (“DY Ai — 0), T= him, ,.. T,. Show that San-r cot ae ora 5.4.24, Solve the recurrence relation d= 1, a) = 0, a 4, = 4a,_\— 5a, + 24,_y 5.4.25, Use the technique of generating functions to show that the nth Fibonacci number F, is equal to ses & e 5.4.26. Sum the finite series ay +a, + --- +4,, where dy =2, a,= 17, and for i> 1, @,=7a,_,— 124... 5.4.27. Show that the power series for the function e*cosbx, a > 0, b >0 im powers of x has either no zero coefficients or infinitely many zero coefficients, 5.4.28, Sum the infinite series S=1-2rcos8 + 3r?c0s20— 4rcose + + Wet 5.4.29, Show that S3_ sin n8}/n!= singsin de. 5.4.30. Use infinite series to evaluate fim, [Ye — 527+ 1 — a} Additional Examples 1, 5.3.16, 68.1, 7.6.6). Also, see Section 5.2 (Geometric Series) and Section 7.5 (Inequalities by Series). Chapter 6. Intermediate Real Analysis In this chapter we will review, by way of problems, the hierarchy of definitions and results concerning continuous, differentiable, and integrable funetions, We will build en the reader's understanding of limits to review the most important definitions (continuity in Section 6.1, differentiabiity in Section 6.3, and integrability in Section 6.8). We will also call attention to the most important properties of these classes of functions. It is useful to know, for example, that if a problem involves a continuous-function, then ‘we might be able to apply the intermediate-value theorem or the extreme- value theorem: or again, if the problem involves a differentiable function, ‘we might expect to apply the mean-value theorem. Examples of these applications are included in this chapter, as well as applications of (Hpita’’s rule and the fundamental theorem of calculus, ‘Throughout this chapter, R will denote the set of real numbers. 6.1. Continuous Functions A real-valued function f is continuous at a if f(x) fla) as xa, oF more precisely, if () fla) is defines, Gi) Tim, f(4) exists, and. Gi) tim, 2 J) = fa). (if'a isa boundary point in the domain of f, itis understood that the 2’s in (i) are restricted (o the domain of f, We will assume the reader is familiar with these contingencies.) 6.1. Continuous Functions 193 ‘A function J is continuous in a domain D if it is continuous at cach point of D. It is not difficult to prove that fis continuous ata if and only if for every sequence {x,} converging to a, the sequence ( f(x,)} converges to f(a) “The sequential form for the definition of continuily of f ix used most often when one wishes to show a function is discontinuous at a point. For example, the function f defined by sind if x0, 0 if x=0 is discontinuous at 0 because, for instance, the sequence x, =2/(4n + I) converges to 0, whereas ( f(x,)} = {sin(2en + })} converges to I (rather than to f(0}= 0). fey= GAL, Define f:{0,1}-10,1] in the following manner: f(1) =, and if = 4,0,040,.... is the decimal representation of a (written as a terminat- ing decimal if possible; e.g., 099999... is replaced by .1), define f(a) = .04,0a,04, .... Discuss the continuity of f ‘Solution. Observe that f is a monotone increasing function. We will show it is discontinuous at each terminating decimal number (ie., at each point of the form N/10", N an integer, I< N < 10"). Consider, as’ an example, the point a=.413. By definition, f(a) = 040103. Now define a sequence x, by ‘The sequence {14} converges to ai however, Als) =.040102 99.09... 09. and we see that (f(x,)} does not converge to f(a). Thus fs not continuous ata. ‘A similar construction can be made to show that fis discontinuous at ‘each terminating decimal number, The argument is based on the fact that the terminating decimal numbers have two decimal representations, 194 6. Intermediate Real Analysis namely, B= ayydy 1, 0,40, a0, aya — 19999. Now suppose that a in (0,1) is not a terminating decimat number, We will show that / is continuous at a. Write a in its unique decimal form. a= 4105052, Because the number a is not a terminating decimal number, there are arbitrarily large integers » such that a, 0 and 4,.., #9. For each such m, define X, and ¥, by w) io} Xemas a, (= 3 Vy. )0g Oya, +1) = Xe Then a &(X,, ¥,). Moreover, the first m digits of each of the mumbers in (iq, Yq) are the same as those of X, and ¥,.. Consequently, all the numbers within (X,, Y,) are mapped to the interval (/(X,), f%))- Tis clear that the sequences (X,} and ( ¥,) converge to a; furthermore, the sequences {,f(X,)} and (f(Y,)} converge to f(a). Since any sequence (3) Which converges to a must eventually become interior to (X,, ¥,) for any 1, it must be the case that { f(x,)} converges to fla), It follows that fis ‘continuous at a. ‘The preceding example is difficult 10 visualize geometrically, and a thorough understanding of the proof requires a clear understanding of continuity. The next example also demands a precise rendering of the definition: funetion f is continuous at a if for every ¢ >0 there is a number 8 >0 such that [x — al < 6 implies | (x) - {(@)| R is 2 one-to-one continuous funetion with a fixed point xo (that is, f(x) = x5) such that f(2x —f(x)) = x for all x Prove that f(x) = x. Solution, Let $= (x|f(x)= x). Because f is continuous, the set Sis a closed subset of R (ic., if x, €S and x, x, then x & J; this is because 2 SLIMY soe lity ue fq) = fig 08) = JOY Now suppose that SR. Let xy be a boundary point of S (every neighborhood of x» contains points that are not in S; note that x, © S because 5 is closed) fy is a point that is notin S, there is a nonzero real number r such that f(y) =y +r. The fact that f is one-to-one and satisfies (2x — f(x)) = x 6.1. Coatinuous Functions 195 feo fone Al Figure 61, implies that fort n= (yt a+r for every integer n (this is the content of 2.1.12). This identity is crucial to the argument which follows, Here's the idea: Suppose x is not in S; that is, f(x) # x. Choose y in R~ $ so that y is “close” to xp and f(y) is “close” to y (this can be done because f is Continuous at xy and fix.)= xq). Then, if 7 is such that JQD=y +7, and ifr is sufficiently. small, the fact that f(y + Ar)= () + av) + 1 will lead (o a contradiction to the continuity of f and x (see Figure 6.1), ‘A formal proof gocs as follows. Suppose, as above, that xy is a boundary point of S$ and x is such that f(x) # x. Let e=|f(x)— x]. Because fis continuous at x, there js a 8 > 0, and we may assume that 6 < }, such that |z— x] <8 implies [/(2) — f(2)| 0, 9 <8, such that |v ~ xl < » implies [flw) — forall < 6 ‘Now choose y'€ (xp —m,% +0) such that f(y) #y (such ay exists because Xo is a boundary point of S$). Then f(B)). Let ¥ ELJ@, {CB}. We wish to find an element c in [4,8] such that fe) = y. “The procedure goes as follows (a diagram will help). Let a= a, by = 6, and let x, denote the midpoint of the interval [a,b] (the first bisection). If SO) < ys define a, = x, b= 6, whereas ify < f(x), define a= a, by = x,, In either case we have fla,) < y < f(b,), and the length of fay, by] is ‘one-half the length of fa, ]. Now, let x, denote the midpoint of [a,,6)] (the second bisection). If ‘flay [4a2.ba] 2 whose lengths converge to zero (in fact, by~ 4; = (B ~ a)/2). These condi- dons imply that (4) and (4,} each converge to the same real number in 6.1. Continyows Functions 197 By the continuity of f im su» f(a) = lo) and fey, f(B) = fe) Pure thermore, for cach i, f(a)

9, f(1) <0. Prove that f(x)=0 for some x under the assumption that there exists a continuous function g such that f+ g is nondecreasing. (Hint: Use repeated bisection—choose the right haif of the interval if there is a point x in it such that f(x) > 0, otherwise choose the Ieft half. This yields a nested sequence of intervals (a,,6,) 2 [a,b] 2 +> ~ which converge to a point c, Note that for each m there is 2 point y, [a,c] such that f(),) > 0. Prove that f(c) = 0) 6.1.7, Let f be defined in the interval [0,1] by 0 if x is irrational, £0 Og eee get terms). (a) Prove that f is discontinuous at each rational number in (0, 1} (b) Prove that f is continuous at each irrational number in (0. 1]. 198 6, tcermediate Reel Analysis 6.1.8, If x is an element of the Cantor set K (see 3.4.6), it can be expressed ‘uniquely in the form where 5, = 0 or 1. Define g: K-10, 1] by setting “5 ae)- we Now extend g t0 [0,1] in the following manner. I x € [0,1] is not in the Cantor set, then, using the notation of 3.4.6, there is a unique integer n such that x€/,, where ,=(X,.¥,), X, and Y, in K. Define g(x) = g(¥,)- (Note that for all m. g(%) = 8(Y), and thus we have simply made” g constant on the closed interval [X,, ¥,]) Prove that g is continuous. (Also, see 62.13) Additional Examples 63.1, 635, 636, 643, 672, 67.7, 689, 68.10, 695. Continuity is an underlying assumption in most of the examples in Chapter 6; in particular, see Section 6.2 (intermediate-value theorem), 6.2. The Intermediate-Value Theorem ‘The intermediate-value theorem states that if fis a continuous function on the closed interval [a, 6] and if d is between f(a) and f(b), then there is a number ¢ between a and 6 such that (c) =. The power of the theorem lies in the fact that it provides a way of knowing about the existence of something without requiring that it be explicitly found, ‘As an example, let us show that ~2x54 4x =] has a solution in the interval (0,1). Consider flx}= —2x° + 4x, and take two “pot-shots": f(0) is too small, and /(1) is too large. Therefore, by the intermediate-value theorem, there is @ number in (0,1) that is just right. 6.2.1, A cross-country runner runs a six-mile course in 30 minutes. Prove that somewhere along the course the runner ran a mile in exactly 5 minutes. Solution, Let x denote the distance along the course, measured in miles from the starting line. For each x in (0,5), let (x) denote the time that lapsed for the mile from the point x to the point x + 1. The funetion fis, 62, The Intermediate Value Theorem 199 Figure 62. continuous, We are given that f(O) + f(1) + f(2) + JO) + f(4) + (5) = 30. Tt follows that not al of (0), ..-,f(S) are smaller than $, and similarly, not all of f(O), ..., (8) are larger than 5. Therefore, there are points @ and & in [6,5] such that fla) < 5 < f(b). Thus, by the intermediate-value theorem, there is a number ¢ between @ and 6 such that fic) = 5; that is to say, the mile from ¢ to ¢ +1 was run in exactly 5 minutes 6.2.2. Suppose that j: [4,6] & is 2 continuous function, (@) Mean value theorem for integrals. Prove that there is a number ¢ in [4,5] such that 8 fldjat = flcXb ~ a). (b) Prove there is a number c in [a,b] such that fs finde = jt frat (Note: For this, itis enough to know that fis integrable over [a,6]) Solution, (a) Let M and m be the maximum and minimum values of f om [a,b] respectively (guaranteed to exist by the extreme-valuc theorem), and let 4 = [% f(t. The intuition for the argument which follows is shown or the ease of a positive function f) in Figure 6.2. As the line y = h moves continuously from y = m to y= M, the area A(h) in the rectangle bounded by y=, y= 0. x= a, x= b moves from being smaller than 4 (at A(™m)) to being greater than 4 (at A(M)), Algebraically (and true independently fof the “area” interpretation), A(m) = m(b ~ a) < 2 fd! < M(b— a) = A(M), Since A(h) = h(6 —a) is a continuous function of &, it follows from the intermediate-value theorem (note: A(h) = f(b — a) is & continu ‘ous function) that there is a point d such that 4(d) = A: or equivalently, d(b— a)= A, But d is between m and M, s0 again by the intermediate- value theorem, since f is continuous, there is a point ¢ in [a,b] such that flo) = d.Tefollows that Loa Hoye ay, (b) Again, the intuition is shown in Figure 6.3 (for the case of a positive function), Let 4 = f% fli)de, and let A(A) = ft feds. In the figure, for 200 6. Inermesiae Real Analysis Figure 63. a A(h) as x90, and this means that A(f) is continuous at h. 6.23, Let A be a set of 2n points in the plane, no three of which are collinear. Suppose that n of them are colored red and the remaining n blue. Prove or disprove: there are closed straight line segments, no two with a point in common, such that the endpoints of each segment are points of having different colors. Solution. This problem was considered in 1.11.2, but proof based on the intermediate-value property. We shall prove that the result holds by induction on m, Certainly the property holds when n= 1. Suppose the result holds when = 1,2,..+, ks 62. The lotermediate-Vatue Thedcem 201 and consider a set A with 2(k + 1) points, no three of which are collinear, such that k + 1 are colored red and & + I are colored blue. Suppose that two vertices of the convex hull of have different colors. ‘Then, there are two consecutive vertices along the perimeter of the convex hull, sty P and Q, that have different colors. By the inductive assumption, the set of points A — (P, @} may be connected in the desired way. None of these segments will intersect the line segment PQ because of the way P ‘and Q were chosen, and therefore, the result holds for the set 4. Tt remains to consider the ease in which all the vertices of the conver hull have the same color, say red. If Z. is any nonhorizontal line in the plane, let B(L) denote the number of points of 4 to the left of J that are colored blue, let R(d.) denote the number of points of A to the left of £ that are colored red, and let D(L) = B(L) — R(L). Now choose a nonhorizontal line 4 that lies to the left of all the points in 4 and which is not parallel to any of the line segments that can be formed by joining points of 4. In this, position, D(L)=9. As L moves continuously to the reht, it will encounter points of A one at a time, and in passing such a point, D() will change +1 if the point is colored blue and —1 if the point is colored red. As L moves to the right, its first nonzero value will be negative (obtained just afier passing the first point of A), Since the last-encountered point of A is also red, its last nonzero value will be positive (obtained just before passing the last point of 4), It follows from these observations that D(L) will equal zero somewhere between the first and last encountered poinis of A (note that D(L) is am integer-valued function). When L is in such a position, the inductive assumption can be applied to the points (0 the left of L and also to the points to the right of Z. Since none of the resulting segments will intersect, the result follows for the set 4, and by induction, the proof is complete, Problems 62. Suppose f:{0,1](0, 1] is continuous, Prove that there exists « number ¢ in [0,1] such that f(c) = c. 6.2.5. A rock climber starts to climb a mountain at 7:00 AM. on Saturday and gets to the (op at $:00 p.w. He camps on top and climbs back down on Sunday, starting at 7:00 AM, and getting back to his original starting point at 5:00 p.m. Show that at some time of day on Sunday he was at the same elevation as he was at that time on Saturday. 62.6. Prove that a continuous function which takes on no value more than ‘twice must take on some value exactly once. 202 6. Imermediate Real Analvsis 6.2.7. Prove that the trigonometric polynomial ay t aycosx ++ +.a,cosnx, where the coefficients are all real and |agl-+ ay| + =-~ +141 © ay, has ‘at Feast 2n zeros in the interval [0,22). 6.2.8, Establish necessary and sufficient conditions on the constant k for the existence of a continuous reakvalued function f(x) satistying ffx) = kx? for all real x. 629. (a) Suppose that f:[a,5}-> R is continuous and g [a,b] R is integrable and such that g(x) > 0 for all x € {a,b}. Prove that there is a number ¢ in {a,6} such that ff Heoseydr= 10 Heya (b) Suppose that f:[a,b]—> 8 is increasing (and therefore integrable), and g:la,b)>2 is integrable and such that g(x)>0 for all x <[a,b} Prove that there is ¢ number ¢ in [a,b] such that [serena stay fi staaes 10) [° sends 62.10, Lot f:[0, 1]-+ 8 be continuous and suppose that j(0) = f(I). Prove that for each positive integer x there is an x in [0,1~ 1/n] such that Ae) = fle ny. 62.41. A polynomial P(x) of degree at most 3 describes the temperature of & certain body at time ¢. Show that the average temperatuce of the body between 9 Am. and 3-PaM. can always be found by taking the average of the temperature at two fixed times, which are independent of which polynomial ‘cecurs. Also, show that these (wo times are 10:16 A.v, and 1:44 p.m. to the nearest minute. (Hint: Use the mean-value theorem for integrals; see 62%)] 62.12, For any pair of triangles, prove that there exists a line which bisects them simultaneously. 6.2.13. Give an example of a continuous real-valued function f from [0, 1] 10 [0,1] which takes on every value in [0,1] an infinite number of times. [Hint: One way to do this is to modify the continuous function defined in 6.1.8) Additional Examples 6.1.6, 652, 653, 654, 65.13, 664, 665, 666, 669, 7.6.13. 63, The Desivative 203 6.3, The Derivative ‘The derivative of f:[a,]-> R at a point x in (a,b) is defined by vay = tn LEED HOD £42)= fig provided this limit exists. We note that iff has a derivative atx, then fis Continuous atx, because Ay fe) pg lier e0)~ pal (AE) a] a iim { SEAM =ICD ) o( am =reyink “0 6.3.1, If the function af(x) has a derivative ata given point xp #0, and if f is continuous there, show that f has a derivative there. Solution. Let be tim LIT 20h) rs ‘The limit on the right exists, since it represents the derivative of af) at the point x (in the definition of the derivative given above, we have substituted x xp for h). For x sufficiently close to, but different from, xy (and therefore different from zero), S(2) _* X0f(%0) fof) _ _ 0) ~ x05) FER) 2 8M) — X99 — 240fl0) + HOD ‘emt ex) = sof) ) _ fe) ary a 204 6. Intermediate Real Analysis 1 Follows thas ‘Peay = fig L2= £00 re = im [3(22 sofia) ) _ £6) fim | 56( aoe % ot tn, Ao Jim, f(3). x= % ) xo ‘The fact that lim,..., f(x) = f(%) follows from the hypothesis that fis continuous at xo. However, this assumption is not necessary, because SO) = $0) _ PM} *%0f%) xX “0k — Ho) a BROf() ~ 85/0) ~ *Xofl%0) + ¥9F(%0) xR Fa) 1 (zee \- fo Using this we find that SE) ~JE0) So) = jim = im (2 1 { 290) — Xofl0) ) - £9) = Ze -seo} 63.2. Let fix) = a,sinx + aysin2x + +++ + aysinnx, where ay,0; 4, are real numbers and where n is a positive integer. Given < sin] for all real x, prove that Ja, + 2a,+ +++ + 7a,| <1 Weal ‘Solution. We gave an induction proof of this problem in 2.44; however, a more natural approach is based on noticing that "(x)= aycosx + + *+ + zna,cosnx, from which we sce that f’(0)= a, + 2a, + +++ +a, (which is the left side of the inequality we wish to prove). This prompts the following 63. The Deevative 205 argument: vol- ee | = lim in| | and this completes the proof. 63.3. Let f be differentiable at x = a, and flay 0. Evaluate far t/ny fay . Jim, Solution, It suffices to evaluate Ve lima fa+®) stl Ray For x small enough, f(a + x) and f(a) have the same sign, and it follows ‘ fa+xy\'") tla +i)" a Te 508 Tyeay tg 8 Ke #2 — tl fe a) ‘The last expression on the right is the definition of the derivative of log] f(x)| at x = a, which we know from calculus is f'(a)/ fla). Thus, tin { Het Te 21/Ray Problems 634, (2) Suppose that instead of the usual definition of the derivative, which we will denote by Df(), we define a new kind of derivative D*f(x) by the 206 6. Intermediate Real Analysis formula £E+h-FE) PIC BR Express D*f(x) in terms of Df(x). (b) IF fis ditferemtiable at x, compute He 4 ah) fx + Bry yo( (©) Suppose fs differentiable at x = 0 and satisfies the funetional equation f+ 9) = flo) + f(y) for all x and y. Prove that f is differentiable at ‘every real number x. 63.5, Define f by if exo, lo it x=0. [x?sin roe} (2) Show that /'(x) exists for all x but that it is not continuous at x =0. (The derivative for x 0 is 2xsin(1/x)—cos(1 /x); what is the deziva- tive at 02) (b) Let g(x) = x + 2f(2). Show that g’(0) > 0 but that f is not monotonic in any open interval about 0. 63.6, Let f:[0,1]-+ R be a differentiable function. Assume there is no point x in [0,1] such that f(x) =0= /'(2). Show that f has only a finite ‘number of zeros in [0,1]. [Suppose there are an infinite number. Either (0,$} or [},1] contains an infinite number of these zeros (perhaps both will) Choose one that does, and continue by repeated bisection. Along the way, construct a convergent sequence of distinct zeros. Use this to reach a contradiction.) 63.7. Prove that if fis differentiable on (a.5) and has an extremum (that is, @ maximum or minimum) at a point ¢ in (a6), then f(c) =0. [For applications of this result, see 6.4.1, 6.42, Additional Examples 66.2, 6.72, 69.1, 762. 6.4. The Extreme-Value Theorem ‘An existence theorem is a theorem which states that something exists (for ‘example, a point within the domain of a function which has some stated property). Quite often this special object occurs at some “extreme” position. 64. The Extreme-Value Theorem 207 Figure 6.4 It is in this way that one comes to make use of the extreme-value theorem: If fis a continuous function over a closed interval (2, there are points ¢ ‘and d in [a,b] such that f(c) < f(x) < fd) for all x in [a,0}. 6.4.1. Suppose that f:{a,5]— R is a differentiable function. Show that f° satisfies the conclusion of the intermediate-value theorem (ic, if d is any number between f'(a) and f(b), then there is a number ¢ in the interval (2,6) such that f(e) = dy Solution, If f° were continuous we could get the result by a direct apptica- tion of the intermediate-value theorem (applied to j”). However, f’ may not bbe continuous (for example, see 63.5(a)), so how are we to proceed? To help generate ideas, consider Figure 64. In this figure, a line £. of slope d is drawn through the point (a, f(a)), where (5) < d < 7a). For each point x in {a,b}, let g(x) denote ihe signed distance from the point f(x) to the line 1. (the length of AB in the figure). Our intuition is that the Point we seek is that point which maximizes the value of g. We shall show that this is indeed the case, but to simplify the computation we look at a slightly different function, For each x in [a,b], let h(x) denote the signed distance of the vertical segment from the point (x, f(x) to the line L (dhe length of BC in the figure). We observe that the point which maximizes the value of h on (2,6) is the same ax the point which maximizes the value of g on {a,b} (This is because g(x) = h(x}cosa, where a is the inclination of L.) The advantage of considering A(x) is that we can easily get an expression for it in terms of f(x) and the equation of L. So now retumn to the problem as state Ax) = J) ~[J(a) + (x — a). and consider the function 208 6. Inermediate Retl Analyst We see that Mya f(y 4a. Since f(b) & be continuous and such that f(x) > 0 for all x in {a,b} Show that thete is a positive constant ¢ such thal f(x) 2 ¢ for all x in [a,b (b) Show that there is no continuous function f which maps the closed interval (0, 1] onto the open interval (0, 1). GAA. Let f: [a,b] R be differentiable at each point of [2,6], and suppose that f(a) = /°(b). Prove that there is at least one point c in (a,6) such that )- fa ree fO- fa) | 645. (a) Rolle’s theorem. Suppose f:[a,6]-> R is continuous on (a,b) and differ- centiable on (a,6). If f(a) f(b), then there is a number ¢ in (a,b) such that f(e) = 0. (b) Mean value theorem. Iff: a,b} R is continuous on (a,b) and differen- tiable on (a,b), then there is a number ¢ in (a,b) such that 6) - fa I-19). p40, 210 6. Intermediate Real Analysis 6.46. If A, B, and C are the measures of the angles of a triangle, prove that H2 6 sind4 4 sin3B 4 inde 67, and determine when equality holds. 6.4.7. Given a circle of radius and 2 tangent line L to the circle through a point P on the circle. From a variable point R on the circle, a perpendicu- lar PQ is drawn to L with Q on L. Determine the maximum of the area of triangle POR. Additional Examples LILS, 6.6.1, 664, 665, 6.5. Rolle’s Theorem ‘One of the fundamental properties of differentiable functions is the follow= ing existence theorem. Rolle Theorem. Suppose f:[2,b]-> Ris contiuous on [4,6] and differentiable on (a0) If fla) = flO), then there isa rumber in (a,b) such that f(e) = 0, This result is a direct consequence of 6.3.7; For let ¢ be a point in (a,b) such that /(@) is an extremum (uch a point ¢ exists by the extreme value theorem), Then by 63.7, s(¢)=0. Rolle’ theorem is important from a theoretical point of view (we shall subsequently show that the mean-value theorem and a host of useful corollaries are easy consequences of Rolle’s theorem), but it is also important as a problem-solving method. 65.1. Show that 4ax?+ 3bx? + 2ex= a+b +e has at least one root ‘between O and 1. Solution, Any attempt to apply the intermediate-valve theorem (as in the solution to a similar problem in Section 6.2) leads to complications, because ot enough information is given regarding the values for a,b,c. But consider the function f(x)= ax‘ + br! + ex? — (a+b + c)x. Notice that f(0)=0 = (1). Thezefore, by Rolle's theorem, there is a point d in (0,1) such that /"(d) = 0: that is to say, d is a root of 4ax? + 3bx? + 2cx = a+ b+ c, and the solution is complete, 65. Rolle’s Theocem 2 65.2. Prove that if the differentiable functions f and g satisfy f(x)g(x) # g(2)f(~) for all x, then between any two roots of f(x) = 0 there is a root of £8) = 0. Solution, Let a and 6 be (#0 roots of f, a < b. The condition implies that neither @ nor b are roots of g(x) = 0. Suppose that g has no zeros between a and 6. Then, as a consequence of the intermediate value theorem, the sign (of gon [a,5] is always the same (that is, g(x) >0 for all x in [2.6], or 80) <0 for all x in fa), ‘Now consider the function F(x) = /(x)/ 2). This function is continu- ‘ous and differentiable on [2,5] and F(a) = 0 = F(b). Therefore, by Rolle’s theorem, there is a point ¢ such that F(e)=0. But this leads to a contradiction, since BON ()~ KOE) Fe and, by supposition, g(c)f'(e) — g(€)(c) # 0. This contradiction implies that g must have a zero between a and b, and the proof is complete, A useful corollary to Rolle’s theorem is that if f is a continuous and differentiable function, say on the interval {a,, and if x, and x, are zeros of fa 0, f(O) <0, and j(7/2) > 0, s0 the intermediate-value theorem implies that f has at least two zeros. If f has three or more zeros, then, by the remarks preceding this example, f” has at least two zeros. However, f(s) = 2x = sinx = xeosx + sinx = x[2-cosx], has only one zero. Therefore, fhas exacily two zeros and the result follows. 654. Let P(x) be a polynomial with real coefficients, and form the polynomia (x)= G2 + POOP) + x[CPOD) + (POY) 22. 6. Intermediate Real Analysis Given that the equation P(x) =0 has 7 distinct real roots exceeding 1, prove or disprove that the equation Q(x) =0 has at least 2m ~ I distinet real roots. Solution. Let a,a;,...,4, be m distinct real roots of P(x) =0, where 1 n, relabel the a's to include these, and the following proof will show that Q has at least 2m — 1 distinct real roots.) By Rolle’s theorem, there is a point , in (a,,4,, ,) such that P’(6,) = 0. Since P is a polynomial, P’(x) =0 has only a finite number of roots in (4,,4,,) 80 for each i, we may assume that, is chosen as the largest zero of P”i0 (0).0,.:) ‘Suppose that P(x) is positive for all x in (a;,a,,,) (see Figure 6.6), and ‘consider the function F(x) = P(x) + P’(x). Our idea is to find a point ¢, in (bigs) where Fc) <0. Then, since F()>0, the intermediate-value theorem would imply that there is a point din (b,c) such that F(d) = 0, and consequently, (0) = 8 (F(B)) > 0. Q(d) = (d= WP P(A) <0 (note that P(x) <0 for all x in (8.214). and (11) = do ( Flay? 0 ‘Therefore, by the intermediate-value theorem, there are points x, in (6,4) and y, in (d,,a,,,] such that Q(x) =0= Oy) Poo Figure 6.6. 65. Rolle’s Toeorem 213 Figure 67. For the preceding argument to work we must show there exists @ point, in (b,.4,91) where F(c) <0. If g,,, is 8 r00t of multiplicity one, then F(a,,.,) = PG...) <0, and the desired c, can be found in a sufficiently small neighborliood of a... IF ,., is @ root of multiplicity greater than cone, then P(a,,,)=0-= P{a;,,) and there js an interval (a,,, ~ 8,4,,)for sufficiently small 5 > 0, where P(x) > 0 (see Figure 6.7). For such an x, it is the case that P(x) PCa, P(x) Pays and therefore, F(a) = P(x) + PAX) O for X in (@.4,,,). For the case in which P(x) <0 for all x in (a.@,,,), am ‘exactly analogous argument leads to the same conclusion. Thus. we have shown that Q has at least 2n—2 zeros (two in cach of the intervals (@,,4,, 8 1,2, ...,2— 1). The solution will be complete if we ean show has 4 zero in (— 20a). Again there are several cases to consider. Suppose that P’(x)'= 0 has a root in the interval (0,a,). Then, without going through the details again, the same arguments show that Q has a zero in (by.a), where by is chosen as the largest zero of P’ in (0,a,}. We ate left to consider what happens if P’(x) = 0 does not have a zero in (0,44). If P(x) > 0 for all x in (0,2), then P’(x) <0 for all x in (0,a,) and therefore (0) <0 and Q(a) > 0. By the intermediate-value theorem, 214 6. vermediate Real Analysis Q(x) =0 has a soot in (0,a,). Similany, if P(x) <0 for all x in @,a)), we Bet QO) > O and Qa) <0, ete. Thus, in all cases Q(x) =0 has at least 2m — 1 distinct roots The preceding analysis, though tedious and complicated, was based entirely on first principles: Rolle’s theorem and the intermediate-value theorem. With these two ideas the conceptional aspects of the proof are quite natural and easy to understand. There is another solution which is much easier going, after a clever, but not uncommon, key step (@8. see 65.11 and 6.9.4), Since itis instructive, we will consider it also. First, notice that Q ean be written as a product in the following manner: (x) = (7 + NPEDP'ay + a[(P(O)? + (PCy =[2(3) + xP@))L4P') + POO): et F(x) = PCa) + xPC4) and G(s) = xP) + Ps). The hey ep, as we shall see, depends on noticing that F(x) =e" [e" P(x\f and G(x) = PPO. Assume that P(x) has exactly m ditnet seal zeros a exceeding 1, with Vay < ay < +" ay (m > m). Then e*/? P(x) also has zeros. at a;, 4,1 dye 80 by Rolls theorem, fe"? P(A, and hence also FCs) has at least'mr— 1 zeros b, with a; < 8; < o;4,. Simifarly, by Rolle’s theorems, Gx) has at least m 2et08, Cose4y =~ +5 by-r» OS CO < Bs 4, SE, 1, the last equation implies P(r) = 0. But since a, R is differentiable, /(0) = 0, and f(x) > 0 for x jin (0,1). Prove there is a number ¢ in (0,1) such that 2) _f0=9 fey fle) (Hint; Consider f(xy — x)) (b) Is there a number din (0,1) such that xd) _fd-4), fa) faa 65.7. (2) Cauchy mean-vatue theorem. Uf f and g are continuous on [a,b] and differentiable on (a,b), then there is a number c in (a,b) such that [4 Ka] =[e()- 8S (©) Show that the mean-value theorem (64.5(b)) is @ special case of art (a). 65.8. (@) Show that x?— 3x46 cannot have more than one zero in [- 1,1], regardless of the value of b, (b) Let f(x) = (2? — Ie". Show that f(x) =0 for exactly one x in the interval (— 1,1) and that this x has the same sign as the parameter c. 65.9. How many zeros does the function f(x) = 2° — 1 — x? have on the real line? 65.10, Let f(2)= ay + a,x + +++ +.4,x" be a polynomial with real coef ficients such that f has n+ | distinct real zeros. Use Rolle’s theorem to show that a, = 0 for 0 R st continuous on (a,b) and differentiable on (@.B), then there is a mummber € in (a,b) such that OAfO LH, If f(a) = f(b), this is just the statement of Rolle's theorem. Otherwise, it says that there is a point between a and 6 where the slope of the curve is ‘equal to the slope of the line through (a, fta)) and (4, f(6)). Figure 68. (66. The Mesn-Vale Thoorem 207 6.6.1. Let g(x) be a function that has a continuous first derivative g'(x) for all values of x. Suppose that the following conditions hold: @ g)=9, i) 1°) < |g] for all x: Prove that g(x) vanishes identically Solution, We will give a rather unusual solution, simply to illustrate the use of the mean-value theorem. Begin by considering the interval [0,1]. Let be an arbitrary point in (0,1. By the mean-value theorem, there is & point yin (0x) such that = 80) yey SO, It follows that | 60 = [xg'Ccal = L2ll eco < |xIL@¢eah Similarly, there is a point cy in 0,e,) such that |g¢ey)|< [é,|[g(enhe and substituting this into the last inequality, | (x)] < [xiled geal Continuing in this way, We are able to find numbers ¢i.Cy «5 Gy Od gde cece cxct, such that [g(x <|alle ley_ill eal. Since g is continuous on [0,1], it is bounded (between its ‘minimum and maximum values, which exist by the extreme-value theorem), and therefore, since the right side of this last inequality can be made arbitrarily small by taking sufficiently large 1 (each of the [¢[s is less than 1), it must be the ease that g(x) = 0. Thus, g(x) is identically equal to zero on (0, i} The same argument can now be applied to the interval [1,2] (for x in (1,2) there is a ey in (1.x) such that | g(x] < [x Il| (ep). ete). As a consequence of this argument, we will get g(x) identically zer0 on {1,2} Ty an inductive argument, we will pet g equal to 2270 on [xn + 1] forall integers n. Therefore, g is identically zero. (Notice that we did not use the hypothesis that g' wes continuous.) ‘The mean-value theorem has a number of important corollaries which are useful in practice. Among these are the following. Suppose { and g are continuous on [a,b] and differentiable on (a,b). (WF) =0 for all x in (a,b), then fis a constant. (ii) Uf (2) = g°() for all x in (a,b), shen there is @ constant © such that IG)= 80) + ¢. ii) Tf (2) > 0 for all x in (a8), then fis an increasing function. Similarly, HPC) <0 (PC) 2 0. f(a) € 0) for all x in (a,b) then fis decreasing (nondecreasing, nonincreasing, respectively) on (a,b). (For applications, see Section 7! 218 6. Imermedite Real Analysis Proof of (i): Let x (a,b). By the mean-value theorem, there is a number ¢ in (a,x) such that [f(x)— ftal/Lx~ a] = fe) =. It follows that f(2) = fla) for all x in (a,b). Proof of (i): Apply (i) to the function h(x) = fx) = g(2. Proof of (ii): Consider x, y € (a,b), x 0, follows that /(») > fix and j is increasing, 66.2. Let (RR be such that for all x and y in R, Lflx)— FOI (yy. Prove that fis a constant. ‘Solution, By the first of the preceding corollaries, it suffices to show that f()=0 for all x. Therefore, we argue as follows: =) tim LOVLCD WF) =| tin, J) - I) yoe tim LODz 091 poe [yx] = lim ie 6.63. Suppose that f: R—> R is wwice differentiable with f"(2) > 0 for all x, Prove that for all a and b, a 0 for all x in (x,,x3), $0 /’ is & nondecreasing function. Thus SED? Hd, oF equivalently, £06) ~ IG(a + 6) > fGe+ 4) ~S@) fayt fy z f(a + by) < In the remainder of the section we will consider problems which make use of all of the major existence theorems considered in this chapter: the intermediate-value theorem, the extreme-value theorem, Rolie’s theorem, and the mean-value theorem. 6.6.4. Let fbe differentiable with f continuous on [a,b]. Show that there is a number ¢ in (a,d] such that f'(c) =0, then we can find a number € in (a,b) such that ren Oo ke Solution, We begin by getting a geometrical feel for the problem: consider the graph in Figure 6.10, where B is located so that the fine CB is horizontal, For a point x between a and , the right side of the equation, ie, fe)- fa) “aa 20 6, termediate Real Analysis Figure 6.10. represnt the dpe ofthe Tne AB, when the lei, fo seme the slope of the tangent to the curve at C. ons, then the onion Fe) I) reyepey- BE This is a continuous function of x (here we use the fact that * is continuous), so by the intermediate-value theorem, there is a point £ in (a,b) such that F(g)= 0 provided we can find points x, and x, in (a,b) Sich thet Fx) > and Fg) <0 ‘have tht £2) moves rom beng postive atx at being negative atte Wil tho vomiting sna aways be the ese? Suppose tha fle) > fl). Then #0)=0, and te) — a> 0 otha (a) reo-s9- G—® f(a). Unfortunately, this may not be true, as the graph in Figure 6.11 indicates. To alleviate this difficulty, we can proceed as follows. Consider the funetion f over the interval [a,c]. By the extreme-value theorem, it attains & maximum value on this interval, say at x’= s (s may equal c) Since we are assuming that f(c) > fla), we know that a f(d) by our choice of s This completes the proof for this case. The argument is similar for the cases Ke) < fla) and fie) = fla). 6.6.5. Suppose f is a twice continuously differentiable real-valued function defined for all real numbers such that |f(x)| <1 for all x and (f(0))" + (POP =4, Prove that there exists a real number xp such that fl%) + F%) = 0. ‘Solution. There are two natural approaches we might consider. One is to try to apply the intermediate-value theorem: that is, to consider the function F(x) = fx) + f(x) and to find a and b for which F(a) > O and F(6) <0. m2 6. Imermediate Real Aoaysis, ‘Unfortunately, it js hard to see how the condition (j(0))? + (fF = 4 could be used in this approach. Another idea is to see if G(x) = ({(0)F + (f'(x)P has an extremum in the interior of some interval. At such an extremum, G’(x) = 0. Notice that Ge = 4C0HF 09 + 2PCAF C= 2FCMICI+ EN! This looks more ke itt Our approach will be to show that there are points a and b, ~2< a <0, G 4, since G(0)=4. Therefore f'(xq)#0, and it must be the case that Hex) + f(a) = 0. This completes the proof. 6.6.6. Let f(x) be differentiable on [0,1] with /(0)=0 and f(1) = 1. For each positive integer 1, show that there exist distinct pois xj.X2... +X, in [9,1] such that a Fe) Solution. To help generate ideas, consider the ease n= 1. We wish to find +x; in [0.1] such that 1/f'(x))=1. ‘This is possible by the mean-value ‘theorem, since on the interval [0,1], there is a point x such that f(x,) = 1 65, The Mean-Value Theorem 23 ‘Consider the ease n= 2. Consider the subintervals (0,] and [x, 1] where -x is some number between O and | yet to be determined. By the mean- value theorem, there is an x; in (0,x) and x3 in (x,1) such that and fy = MDZICD ‘Thus, a+ - Fo * Fay ~? if and only if 2, aay ee 8 ey * 1709 (=f) + (E> fC) = 2409 ~ 2 >) + (2) ~ MOT ~ 2s) + ALON =O. = 2af() — fx) + ACY =O (124) — FON = YF) = 8, [x~se9][t - 2f9] =o. Now, had we chosen x in (0,1) so that f(x) = { (this could be done, by the intermediate-value theorem), the proof would be complete upon reversing the previous steps With this background we can consider the case for an arbitrary positive integer m. Let ¢, be the smallest number in [0,1] such that f(c;) = i/a (the existence of this number is a consequence of the intermediate-value theo- rem together with the assumption of continuity). Then 0-< cy < € < < eq <1. Define cy=0 and c= 1, and for each interval (61.0) 47 1,2,...,n, choose x, such that so that 24 6, olerrediate Real Analysis 6.6.7. (@) Show that sing + sin(x + a) conx= cong ta) ‘is a constant function by showing that F'(x) = 0, (This problem arose in 12.1) (by If P(x) is a polynomial of degee three in x, and y= P(x), show that (yy) * is a constant, where D denotes the derivative operator. (Hint: first write the above expression in terms of P and its derivatives.) FQ) 6.68. (a) If y= f(x) is-« solution of the differential equation y” + y =0, show that jf? + (f°? is a constant. (by Use part (@) t0 show that every solution of y” + y =0 is of the form y= Acosx + Bsin.x, (Hint: It is easy to show that all functions 4 cos.x “+ Bsinx satisfy the differential equation. Let f(x) be a solution, For {Jce) to have the form flx) = A cosx + Bsinx it is necessary that 4 =f) and B= f(0). Now consider Fix) = f(x) — f(Q}cosx — ‘fiOsinx. Apply part (a) to FG), making use ‘of the fact that F() = 0= F'), (©) Use part (b) to prove the addition formulas sin(x + y) = sin xcos y+ cos.xsin y, cos( +p) = cosx cos y — sinxsin y. 6.69. Let f(x) be differentiable on (0,1) with f(0)=0 and f(1) = 1. For each positive integer and arbitrary given positive numbers Ky,ky, .. ys Show that there exist distinct x,.¥y, +x, such that $ A ods, rey 7% Additional Examples 696, 6.9.10, Section 7. 67. LHépiaas Role ns 6.7. L’Hépital’s Rule ‘We will assume the reader is familiar withthe various forms of L’Hpita’s rule, 67.1. Evaluate ins Sr Solution. Rewrite the expression in the equi (2 Gat) ene os In this way the problem is transformed (o that of evaluating or equivalently, lim, | + 3m ( og provided each of these limits exists, Clearly, lim, (a — 1)/x = 0, and by L'Hépital’s rule, lo Also, by L'HOpital’s rule, log(a* ~ 1) “| I follows that BEL) cexploga =e. Jane 6.1.2, Suppose that f is a function with two continuous derivatives and fO)= 0. Prove that the function g defined by g(0) = f'O), g(x) = f()/* for x +0 has a continuous derivative. 226 {6 Intermediate Real Analysis Solution. For x #0, £0) ~ fe) ser and since f’ is continuous, so also is g’ for all x #0. It only remains to check that g has a derivative at x= 0, and if g(0) exists, to sce if g’ is continuous at x = 0. For the existence of g'(0) we must examine the following limit: tin ( 8) =) im fey/= “) = tin fo of °) is Since f(x) — x/(0)>0 as x90, and since f and fare differentiable, we may apply L'H6pital’s rule to this limit to get £10)~tin( fey-$0) = 1 in L £0) =1/'O). (The last step follows from the definition of (0) Thus 9/(0) exists, To check continuity of gat 0 we have »(2 f= ete) sims g'()= im = Sim jn( Oe Le) (<2) <1. ‘The last step follows because we are given that / has continuous second, derivative. Thus lim, .og'(x)= g'(Q) and the proof is complete. Problems 6.73, Evaluate insted) Tene at 6:74, Braue the following limits: ants ny nt+tly" tin (a) © pare Sy) ( jim(is 5)” 2p,P, © In ee where p, (a 6.7.5, Lev 0< a < 6. Evaluate tin] flim - sya] Jiarara(iet 6.76. Caleulate Jinx [et Pa. 6.7.1, Prove that the function y = (2°) (0) = 1, is continuous at x = 0, 6.8. The Integral Consider that happens to the sum as n> 00. One way to think about this i to interpret the sum geometri= cally: construct rectangles on (2,2n] as shown in Figure 6.12. From the figure itis clear that > Laem es] = log2n — logan = log2. Similadly, from Figure 6.13 it follows that + hc tae er 28 6. nemedinte Real Analysis win Figure 6.12. Putting these together, we have <(4- d) + oer lop2c be ctoe s+ i wi oH Now, as n> 0 it is apparent that the sum in question approaches log2. Another way (0 see this is 0 rewrite the sum im the form nt 1 Quek and to think of each term, iyi (tea7m) a as the atea of the rectangle with base [&/1.(k + I)/n] and height 1/(1 + /n), Tn this way, the sum represents the area in the shaded rectangles fart ~ _— EBs 68. The Integral shown in Figure 6.14. As 1» o0, these areas approach the area bounded by ie tin S yen S(t) = [ppt GB.1. Evaluate Jig, 1 Bn Solution. The problem asks us to evaluate definite integral 2 1 AE] ED We will do this geometrically by computing the area under the graph of fx)= [2/x 1-2 1/x J beoweon x= 0 and x= 1, The points of discon- timuity of f(x) in (0,1) occur at the points where either 2/x or L/-x is an integer. In the first case, 2/x = n when x=2/n, and in the second case, 1/x =n when x= 1/n, Thus, we concentrate on the points | > 2/3 > 2/4 >2/S>2/6> +>, is easy to check that for each m, ot sega Zh 2 ON it xe Hf at tae } 230 6. Intermediate Real Analysis wee? 6 2 5 Figure 6.15. ‘The graph is as shown in Figure 6.15, The integral is therefore equal to BAF BE Dem Ayrgtirdtyrgt es) Now recall that lop(h tae aaa ey -Iexcl ‘This means that 2p daha be +) =2[log2- 144] = toga — 1, and this completes the solution. 68.2. Evaluate 1% tin 2, pater fae Derry Solution. We can change the product into an equivalent form by writing, 1 thet eay” 1h ue A Tots -onle, Tees’ | weva| 3 Hote wer] 68, The Integral 21 ‘Therefore, we will examine sin | & Hrogen? + 2) = var] wa eel) wen | Hine (1+ (2))} mer] wn Soe iho) -me = fin] Boone +E Jta(t + (ZY) tee] =n] E(t +(2)) 4] We recognize this final ~~ ™ we integral Using integration by parts, {fests de = cog + 2] 268 2 sa -2f'}i-—! 2logs aff el = Dogs — 2[x—arctanz]f = 2logs — 2[2 = arctan2}. ‘Thus, the original limit is exp[2logs ~ 4 + 2arctan2], or equivalently, 2Sexp(2arctan2 — 4). 6.8.3. Prove that 3,00 @eeast 7 2,00 (P eet 232 6, Intermediate Real Anaiysis Solution. The key is to observe that — temat Sc @erber- Seu perm at =f 3co(Qera -fira =a at Now use a change of variable: let s= 1-1. Continuing from the last integral: =fira- 9s - fe Sco(tee -Seu(ngera -Lcv(e Problems 6.8.4, Evaluate each of the following: a} limf tb 4-1 4. a © dim [asa t awea tts | © fa[ Bate) a>-l otsletatstet teal © jin, [(14 042) Ge By)” 68, The Ineg 233 685, Evaluate each ofthe following: @ bee Se. (>) Jim S i 2 6.8.6. Find the integral part of 5! w~2/?, (Hint: Compare the area under ‘xy = x77 over [1, 10? + 1] with the area under g(x) = (x ~ 1)-2? over 2.10 + 1p 6.8.7. Suppose that f and g are continuous functions on [0,4], and suppose that fle) = fla — x) and g(x) + g(a— x)= k for all x in (0.a), where k is a fixed number. Prove thai Li ferats)den 4 fPlaee. Use this fact to evaluate 688, (a) Le A= [7 28x ds e+e Compute /2 sin-xcos.x h xt in cerms of 4 () Let foy~ [Ped for x>0. Compute fx) + f(l/s)- 629, Find all continuous positive functions x), for 0 < x « 1, such that Lafiode = 1, ftxfdde = a, [yefoode =a", where a is a given real number. 638.10. Let f(x, ») be a continuous function on the square S= ((5 9:06 «S106 7 <1} 234 6. Totermediate Real Analysis For cach point (a,b) in the interior of S, let S,.., be the largest square that is contained in S, centered at (a,5), and has sides parallel to those of S. If the double integral [{/(x, »)dxdy is zero when taken over each square Scoaye maust fx, y) be identically zero on $? Additional Examples 144, 1.63, 1.123, 1126, 25.15, 622, 629, 763. 6.9. The Fundamental Theorem ‘The fundamental theorem of calculus refers to the inverse relationship that holds between differentiation and integration. The fundamental theorem for integrals of derivatives states that if F(2) has a continuous derivative on an interval [a,6}, then [Poa Fo) Fe) In other words, differentiation followed by integration recovers the function up to a constant, in the sense that Fo= [ras c where C= F(O) For example, the derivative of F(s) = sin’ is F'(e) = 2sin¢cost, Integra tion of F'(#) on [0,2] yields sine = ["2sinccoseat In this case we have recovered the function exactly because F(0) = 0. But also observe that the integration can be cartied out in another manner; namely (let u = cos), [2sinscosed = ~est| = cost + 1. It follows that sin’x = —cos'x + 1, or equivatently, sin’x + cos’e = 1 for all x. 69.1, Find all the differentiable functions f defined for x > 0 which satisty LE) =I +I) HH? 0. 69. The Fundamental Theorem 235 Solution, When x= y= 1, we get /(1) = f(l x 1) = f(1) + f(D), and it fol- lows that f(1) = 0. If x0, we have O= f(1) = fix X 1/) = fla) + f/x), and therefore, Jl/2) = ~ fe. Wfollows that fox/) = fx) + f1/)9 = fl) ~ JQ). Now the idea is to look at the derivative of f and then to recover f by integration: re a AO) =e ( AP") ~in( 22}, where A/x =r vi A) =tray, ‘Therefore, by the fundamental theorem, $0) =I) f0) = ['Feyaee LO) gem penoes. “Thus, the functions we seek are those of the form f(x)= A logx, where A is an arbitrary constant. 6.9.2, Find the sum of the series dae - Wt * Baas” ow Solution, Consider the function defined by the infinite series payer Seka bn bn for 0 < x < 1. The seties is absolutely convergent for |x| <1, and therefore we can rearrange the terms: fon [ea de ~(+4r+ ot 236 6, Intermedite Real Analysis ‘Our idea is to differentiate f, to change its form, and then to recover f by integration by use of the fundamental theorem. We have, for 0 0 as xr, ‘Solution. First, a digression: If p(x) and q(x) are continuous functions, the equation 4 HPO = a), can be solved in the following manner. Multiply each side of the equation by m(x) = e!M*", and notice that the resulting equation can be put into. the form Zum) = mene ‘Thus, by the fundamental theorem of calculus, for each constant a, there is a constamt © such that omy = fmenaqnars ©. From this, we can solve for y Now, return to our problem and set g(x)= f(s) + f(x). According to the reasoning of the last paragraph, we can solve for f(%) (in terms of g(x)) by first multiplying each side by e*. As above, this lends to the equation Tene" = [ear C or equivalently, fogs et fesinas cen, Let e>0, Since g(x)>0 as x->20, choose a 50 that |g(x)] < for all x >a. Then Le 0 as x0. To do this, let K be an upper bound for (f(x) for all x im (= 1,1). Then, for x in (— 1,1), igo + sina] <{ + sin 24!" de < Kx. It follows that [Fer sin2y'"arr0 as x90. We are now able to apply L'Hépita’s rule to the original problem: [ia sinana = lim (1+ sin 2ey'/*— = Bayt + sin2ay 69.6, Suppose that f:[0, 1]-> R has a continuous second derivative, that S(O) = 0 = fc), and that f(x) > 0 for all x in (0,1). Show that |) {he Jax 69, The Fundamental Theorem 239 Solution, Let X denote a poiat in (0,1) where f(x) is a maximum, and suppose that ¥ = f(X). Then POD LP poy > hireiee LC ede) LALO a lhree|= OF We appear to be stymied at this point, because it is certainly not necessary that /"(1) — (0) > 4[¥]. However, by the mean-value theorem, there are pois ain (OX) und in (X, 1) such that L2)=H0) fe) fn ag -¥ and SY-fA) =v T-¥ . f(ey= FO) 4, LS L49 reve, so applying the fundamental theorem to the last integral, we have a> oH {|G leo hvre-rei aL =r mle ¥ srlea il |saea| But the maximum value of x(1—.x) in (0,1) is 2 (when x=) and therefore { Fe) Tey Jax > waaay” 4 Problems 6.9.7, What function is defined by the equation fey= [soar 240 6. Intermedia Real Analysis, Figure 6.16, 6928. Let f:10,1]>(0,1) be continuous. Show that the equation ax [7 f(qae= fro has one and only one solution in the interval (0, 1} 699. Suppose that fis @ continuous function for all x which satisfies the ‘equation » ya (04 x x8 £ ‘(oat f Bf yds 3P + AS +c, where C is a constant, Find an explicit form for f(x) and find the value of the constant C. 69.10, Let C, and C, be curves passing through the origin as showo in Figure 6.16. A curve € is said to bisect in area the region between C, and Grif for each point P of C the two shaded regions A and B shown in the figure have equal areas. Determine the upper curve C, given that the bisecting curve C has the equation y = x? and the lower curve C has the equation y = 4 69.11, Sum the series 14$-}—J4+h+4-h-- 69.12, Suppose that jis differentiable, and that f"(x) is strietly increasing for x > 0. If f()=0, prove that f(x)/x is strictly increasing for x > 0. Additional Examples 15.1, 5.13, $19, SL11, 5.4.6, 7.65. Chapter 7. Inequalities Inequalities are useful in virtually all areas of mathematics, and inequality problems are among the most beautiful. Among all the possible inequalities that we might consider, we shall concentrate on just (wor the arithmetic- mean-geometric-mean inequality in Section 72 and the Cauchy-Schwarz inequality in Section 7.3. In addition, we shall consider various algebraic and geometric techniques in Section 7.1, and analytic techniques in Sec- tions 7.4 and 7.5. In the final section, Section 7.6, we shall see how inequalities can be used to evaluate fimits. 7.1. Basic Inequality Properties ‘The most immediate approach for establishing an inequality is to appeal to ‘an algebraic manipulation or a geometric interpretation. For example, the arithmetic-mean-geometric-mean inequality, wae rib, O abt bet ea, Solution, Working backwards, PHB EAD ab + be + ca, 2a? +26? + 2? > Dab + 2be + 20a, (a? = 2ab + BP) + (6? — 2he Ht) + (c? — Dea + a?) > 0, (a= bf + (O= E+ (C~ a}F>O. This last inequality is obviously tue, end since the steps are reversible, the solution is complete. (The proof also makes it clear that equality holds if and only it a= b= 0) ‘This example illustrates a common theme: manipulate the expression into a form to take advantage of the fact that a squared number is nonnegative. TAD. Prove that for 0.< x 608%) = asin = | + sins — xsinx = (1 —2sinx + sin'x) — xsinx + 2sinx = (1 -singy?+ 2 xysinx. In this form we see that the desired inequality holds for 0 < x <2. TAZ. 10< abe <1, show that 4 4 « ay byt =o Brett * casi PatheT TOM MI 9st Solution. Here, straightforward algebraic expansion leads to horrendous ‘and unenlightening complications. One simplification js to assume, without loss of generality, that 0 < a < < ¢ < 1. Then, for example, we have a » c catbee Beetl *eeatl athe “atoel® and we might try to prove that atore BEERS 4 (1 ay(t bye) <1 This problem is easier algebraically, but still messy, and of course, we may have given away too much (that is to say, this inequality may not even be true). However, we have the following: athe stb tes (at - dil - 6 thet, cmd _e aE bE tabbed TMK) =1-(ste ia +2 baa - aya oy). ‘The desired inequality follows from this expression after noting that (14 at byl ay dy <(1 a+ 5 + ab\(1— VC -5) = (14 ay(l-+ 6y(1 = ay(l ~ 4) = (1-41-54) <1 244 7. equalities TAA, Letn be a positive integer, and a, > 1, for /= 1,2,-...1 Show that (le ay(t+ayy s+ (a) > Ad Fay bo Fa) Solution, Induction is # natural strategy here, and itis not difficult to earry ‘out in this manner. But the following “give a little” argument is more fun: (+ ay tay (14a) nee (lt atayt stay) mt TALS. For each positive integer n, prove that (a) lea) Solution, This is an important inequality that can be proved in a number of ways (See 7.1.11, 7.28, 74.18). Here we will give a proof based on comparing corresponding terms in the binomial expansions of each side. (On the left side, (a) 2000) 2B MOR NORI) KH “2b 7. Basic Inequality Properties 245 Ina similar manner, ‘The inequality is now obvious, since comparing the coefficients of 1/1 in these expressions, we see that for each k, k= 0.1.2... ey ‘Thus, the sequence (1 + 1/2)" is increasing and bounded above by 3. (It can be shown that the sequence converges to the number ¢,) ‘The next result is important theoretically and is very useful (e.g, see 7.49 and 7.420). TAG. Suppose that f: R-> R satisfies x49) LOH) Wa for all x and y is an interval (a,6), x # y. Show that (net ot t+) < Se) + fle) + = +405) whenever the x's are in (a,5), with x, % 1) for at least one pair (/,/)- 246 7. Inequaies ‘Solution, Assume the result holds for n= m: we will show it holds also for n= 2m. We have a) fo EY) Lf LED * 2 +m) fn + > +4) 2 and nis not a power of 2; that is, suppose that 2°" <2" for some integer m. Let k= 2" =n, and set y, B(x bee payy/a for = 12 020 ke Them xyXys 0225 ky lye oD are 2" numbers i the interval (a,b), and therefore our preceding argument implies that Mytebte tey SO + fn) (ae 0 : But note that (Tata a) “(Ee tat ket : sein) n(x oo +) +A mr + =A axa “ey es Making this substitution into the fast inequality, sts) fede thon sft + Ix) 7 oe POM FIG) + Cn + ay/) r . 7. Basie Inequality Properties 287 Multiplying each side by 2” yields wf AAA) fey +f) sere ( ES te) and from this we get the desired inequality for m: ete tay fant + +100 a - je oy, = (Ce) Problems 7.1.7. Suppose that a,b,c are positive numbers. Prove that: (a) (a+ 5b + che + a) > Babe. (b) a6? + Be + ca? > abc(at b+ 0). (6) Wat b+ em, then ab + be + ca<}. TAB. Prove that 2°46 ° T000000 (Hint Square each side and “give a little” (o create a “telescoping” product (see Section 5.3)) 749. (2) Ifa and & are nonzero real’ numbers, prove that at least one of the following inequalities holds: ee (b) HE the m numbers x,.29, 4% lie im the interval (, 1) prove that at least one of the following inequalities holds: Aaya S27 malay (Ia) 2% 7.1.10, (@) Let ay/d;.42/ bm, ...4,/b, bem fractions with 6; >0 for 2... sem Show that the fraetion ay haat Baht is a number between the largest and the smallest of these fractions. 248 7. tnenuaties (Note the special case in which all the fractions a,/6, are equal) (o) It ath ected bee dea’ prove that eithera=cora+b+e+d=0. 7A, (a For 0 < a-0 for (= 1,2,...,. The arithmetic mean of xyX;,-+. number vy is the Atte ta, 112. Arilbmeie-Mean-Geometre’Mean Inequality 29 and the geometric mean of Xx, «4% i the number Gee ag ‘The arithmeticamean-geometric-mean inequality states that ne titeeteont (8) with equality if and only if all the x/s are equal ‘The special case n = 2 was verified both algebraically and geometrically in the beginning paragraphs of Section 7.1. A proof for larger values of can be handled by mathematical induction (e.g., see 7.2.5 or 2.5.7), or by considering the concavity of the function f(0) = logr (see 7.4.20). However, a more enlightening heuristic (however, not a proof) can be made as follows. Consider the geometric mean (x); +++ x,)'/" and the arithmetic mean (art +++ +4,)/n, If not all the x/s are equal, replace the largest and the smallest of them, say x4 and x,, respectively, by } (xy +X). Then, since Hey +) + Eka thee) = Xa + Xe aD [E(k + XQ )P > Ky Fy, the ree sult of this replacement is that the geometric mean has increased while the arithmetic mean has remained unchanged. If the new set of n numbers are not all equal, we can repeat the process as before. By repeating this process sufficiently often, we can make the quantities as nearly equal as we please (this step needs additional justification, but we Won't worry about it here). At each stage of the process, the geometric mean is increased and the arithmetic mean is unchanged. If it should happen that all the numbers become equal (this may never happen, however; ex, take x)= 1, x= 3, x; = 4), the two means will coincide. It must be the case, therefore, that the {eometric mean is less than or equal to the arithmetic mesn, with equality when and only when all the numbers are equal. ‘As an example of this process, consider the case x; =2,x, = 4, x5 = 8, = 12. The algorithm described yields the following sequences of sets: {2.4,8,12) > (7,4,8,7} > (7,667) > (9.842). ‘The geometric means of the corresponding sets increase (o the arithme- tic means temain fixed at 3. 7.2.1. Prove that the cube is the rectangul volume for a given surface area, and of mi volume. avallelepiped with maximum um surface area for a given Solution, Let the lengths of the three adjacent sides be a, b, and c. Let A and V denote the surface area and volume respectively of the parallelepi- ped. Then A= 2ab+ be ca) and V= abe. 250 7. Ineguaties By the arithmeticmean-geometric-mean inequality, V2 = ab? = (ab)(be)(ca) abbot coy, (abt beta yay <(@e gray. (MET) -(4) Thus forall ate, OPK A. Furthermore, 6¥?/< A in all cases except for when ab- be = ca (or equivalently, when a= b= c), and in this case 6¥7? = A. Thus, iF A is fixed, we get the greatest volume (namely V = (A /6)") when a= b~ ¢ (a cube}, and when V is fixed, we get the least surface area (namely = 61%) when a= b= c (a cube). 7.2.2. Prove the following inequality: afine tt —ipcte dada (n+) ] red ee Solution. Let s,= 1+ + +++ + 1/n. The leftmost inequality is equivalent to proving ats, pene which has vaguely the look of an arithmetic-mean-geometric-mean in- equality. We can make the idea work in the following way: nts, Met L/2b os + 1/n) (LEN HE T/2) Hs HLF T/A) DEI A/IH edd ay" +(nt Din =o For the rightmost inequality, we need to show that > ante, 72. Arithmetic-Mean-Geomets-Mean Inequality 251 Again, using the acithmetic-mean-geometrie-mean inequality, we have 2B nay _ Aa (IEI24 34 + 1/) 71 (=) eU=1/) + 4-1/0) nt aa “rere (n= d/n 1.2.3... mayer aby 723. It a,b,c are positive numbers such that (1+ a)]+ bX1-+ 6) =8, prove that abe < 1 Solution. We are given that 1+ (G4 b+ 0) + (ab + be + ca} + abe = 8. By the ithmetic-mean-geometric-mean inequality, atb+e< Habe)? and ab + be + ca < Habe), cach with equality if and only if a = b= c, Thus, 83 1+ Habe)’ + Yabey"??+ abe f+ (abe)?P Tt follows that (abe) 2-1) 1, of equivalently, abe <1 with equality if and only ifa=b=c=1 7.2A. Suppose that x, > 0, = 1,2,-.., mand let x, = x). Show that B(#)<3l 252 7. Toequaiies ‘Solution. Consider the case = 3. By the arithmetic-mean~geometrie-mean inequality, we have seegt s als)ea(e) +s. eee (aye (gy aleyHEy+ 8 Also, aH ALM) LU eY 1B) ES 4B) AZ) a(2) Adding these inequalities gives the desired result. The case for an arbitrary positive integer a js similar. Problems 7.2. Fill in the steps of the following inductive proof of the arithmetic ‘mean-geometric-mean inequélity: For each k, let Ay > (xy + y+ - Assume that we have shown 4, > G,. and G= (x,4fe1)'™ Then, using the inductive assumption, we have A > G, and it follows that Aner = HAL + A)? AAD? @(GGIE = (GESTARTDVOM. From this it follows that 4,,., > Gj 1- On the basis of this argument it js easy to prove the equality holds if and only if all the x/’s are equal. 7.2.6, Il a,b,¢ are positive numbers, prove that (2b+ Bes Cayate + bia + cb) 2 90'b%?, 7.2.7. Suppose that ay, ....a, are positive numbers and by... By is @ rearrangement of a, ...d,. Show that 728. (a) For positive numbers @ and 5, a B, prove that (anys ete, 72, AvthmetioMean-Geomeyrie-Mean Inequ 253 (b) Tn part (a), consider the case a = 1 and 6 = | + 1/m and show that t at (uty hy (©) In part (a), replace m by n+ 1, let a= Land 6 = 4/(a + 1), and show that Ls (a >a) 7.2.9, For each integer n > 2, prove that © Was i iw om meg), (©) 1X3x5x 0+ XQa— Ica, 7.2.40. Given that all roots of x— 6x! + axt+ bx? + ox + de + 1=0 are positive, find a,5,c,d. 721. () Let x, >0 for f= 1.2,.-.4m and let py passa Pe be positive intee gers, Prove that spf xpyllinie 1g PV + Pay (tsb) < Pmt the (b) Prove the same result as in part (a) holds even when the p’s are positive rational numbers. 7.2.12. Use the arithmetic-mean-geometric-mean inequality for each of the following: (a) A tank with a rectangular base and rectangular sides is to be open at the top. It is to be constructed so that its width is 4 meters and its volume is 36 cubic meters. If building the tank costs $10 per square meter for the base and $5 per square meter for the sides, what is the cost of the least expensive tank? (b) A farmer with a field adjacent to a straight river wishes to fence a rectangular region for grazing. If no fence is needed along the river, and the has 1000 feet of fencing, what should be the dimensions of the field so that i( has @ maximum ares? (Hint: It is equivalent to maximize twice the area.) (©) A farmer with 1000 fect of fencing wishes to construct a rectangular pen and to divide it into two smaller rectangular plots by adding a ‘common fence down the middle. What should the overall dimensions Of the pen be in order to maximize the total area? (@ Prove that the square is the rectangle of maximum area for a given perimeter, and of minimum perimeter for a given area. 254 7, eguaives| (©) Prove that the equilateral triangle is the triangle of maximum area for a given perimeter, and of minimum perimeter for a given area, (Hint: ‘The area of a triangle is related to the perimeter of the triangle by the formule A = (s(5— as ~ bY(s— 0))!7, where a,b,c are the lengths of the sides of the tangle and s =P, P the perimeter of the triangle.) Additional Examples Introduction to Section 7.6; 73.1, 8.14. 7.3. Cauchy-Schwarz Inequality Let a, > O and b, >0 for i= 1,2,-+.,.2. The Cauchy-Schwarz inequality states that Sene(Ea)"(Sn)” with equality if and only if a/b, = a/b, = «++ = a,/by A proof can be given using mathematical induction (see 7.1.13). But approach is to consider the quadratic polynomial P(x) = 1x — 6). Observe that P(x) > 0 for all x; im fact, P(x)=0 only r the conditions in which a,/b,— a,/b2— -++ =a,/b, and x = b,/a,. Now P(xy= S (ats? ~ 20x + 82) a - (Sa}e fs ab) + ae. and since P(x) > 0, the discriminant of P cannot be positive, and in fact will equal zero only when P(x) = 0. Thus, (-23 2) -(S)(S97) <0 or equivalently, Sane(Se)"(Sa)". with equality if and only if a/b, = +-+ = a,/bye 173. Cauchy-Sebwarr Inequality 255 In this inequality, note that the requirement that the a, and 8, be positive is redundant, since for all a,b, Sor Srimie( So) "[E9) we TBA. It a,b,e>0, is it true that aces’? + sin’ 1) and Prove that A <2a,q; for IS i 0 fori = that 2, «+, For each nonnegative integer k, prove Be 258 7, Inequaies Solution. We may assume without loss of generality that xj +--+ +x, = 1, for if not, we can replace x, by X= x/(x, +--+ x). ‘The result holds when & = 0. Assume the result holds for all nonnegative integers less than k. By the Cauchy-Schwarz inequality, y" #, and therefore, con- By the inductive assumption, D7_,x)~!/n < 51, tinuing from the last inequality, we have (SES) EE n a a By induction, the proof is complete. Problems 73.6. Use the Cauchy-Schwarz inequality to prove that if ay... a, are real numbers such that a, + +++ +, =, then af + +++ a?>I/n. 73.1. Use the Cauchy—Schwarz. inequality to prove the Following: @ Up. (Pat + Rat S (PY + + PM PATH «+ + Pads): {b) Hf a,,¢ are positive numbers, (a2 + Be + clay(ab® + be? + oa?) > Dae (©) Ixy, yes k= 12... 50, are positive numbers, Se(See) (Bee) ++, Af€ In positive numbers, 174, Functional Considerations 259 @) Mag. bestes & -+n, are positive numbers, (Sane)"s(Sa)(Sa)(Sa)- &) Wee @torn>21chen 36 er D- ty) and (by Day 0+» By) Be (1.2,..+,). Find sharp 7.38. For na positive integer, let (ay.a3, two (not necessarily distinct) permutations lower and upper bounds for a,b, 4 ++ + dyb,. 73.9. IC a,b,e,d are positive numbers such that c+ d*=(a" + bY, rove that » f+bo, with equality if and only if ad = be. (Hint: Show that (a/c + 5?/dXac + bd) > (a? + bY)? > ac + be.) 7.3.10. Let P be a point in the interior of triangle ABC, and let 73.75.74 denote the distances from P to the sides a,,aa,a, of the triangle respec tively. Use the Cauehy-Schwarz inequality to show that the minimum value of 4 ‘occurs when P is at the incenter of triangle ABC."(Hint a, =Va7, ¥a,7n Additional Example 76.14, 7.4, Functional Considerations In this section we will give examples to show how the techniques of analysis, particularly differentiation, can be used effectively on a wide variety of imequality problems. 7A,1. Given positive numbers p, q. and r, such that 2p= qtr, qr, show that et 7 260 7 Inequalities Solution, Suppose that q and r are positive integers, and consider the ¢ numbers 1/q,-.., 1/q and the r numbers 1/r,..., 1/r. By the arithme- ticemean-geometricamean inequality, Lymern gl/gy+ ri/r) (a ‘which is equivalent to the desired inequality. Of course, this method breaks down if either g of r is not an integer, 50 how shall we proceed? One idea is to rewrite the inequality in the following manner: (Ee) $, OcK<, eH} F(x) By introducing the function in this way, we are able to use the methods of analysis. The idea is to find the minimum value of F on (0,1). To simplify the differentiation, we will consider the function G(x) = log F(x). “To find the critical points, we differentiate: G(x) = FZ [slog + (1 ~ x)log(1 - 2] = (logx +1) = 4 = log( = x) We see that G’(x) = 0 if and only if x = }. Furthermore, (2) <0 on the interval (0,4), and G'(x) > O on the interval (4,1). Therefore G(x) bakes its minimum value on (0,1) at x=. Thus, the minimum value of F(x) on 0.1) is FQ) = G7"? =f. It follows that F(x) >$ for all x in ,D, x #5, and the proof is complete. 7.4.2. Let p and q be positive numbers with p + q = 1. Show that for all x, pelts get genet, 74, Functional Considerations 261 ‘Solution, Consider the function ur problem is to prove that F(x) < 1 for all x. Because of the symmetry in the problem, it suffices to prove that F(x) < | for all x > 0. We note that F(0) = |. By Corollary (ii} of the mean-vaiue theorem (sce the discussion preceding 6.6.2, it suffices to prove that F(x) « 0 for all x. To simplify the computation, consider the function G(x) ~ log F(x). Row- tine differentiation and algebraic simplification yields TOE). einai 0)" Fay Shaan BP ev peneg By Since F(x) > 0 for all x > 0, F’(2) < 0 if and only if G'(x) < 0. Unfortu- nately, the preceding expression for G'(x) makes it difficult to determine whether or not G’(x) < 0. Therefore, we will earry the analysis through another step. Namely, G’(0) = 0, and (again leaving out the details) (eer 9) argv + ay Here js is clear that G(x) < 0 for all x > 0. This, together with G’(0) = 0, implies that G’(x) < 0 for all x > 0, and this in turn implies F°(x) < 0 for alt x > 0. Therefore, since F(0)= 1 it must be the case that F(x) < | for all 2 > 0, and the proof is complete. The procedure used in the preceding problem is very common, To recapitulate, it goes tke this: To prove an inequality of the form IO)? a(x), x? a it is equivalent to prove either that fe) Osa rh rhe ows or that DE) =f()= 2) Px >a Each can be done by showing the inequality for x = a and then by showing. that Q°(x) > 0 (or D’(x) > 0 respectively) for all x > a. In the previous example, if we had considered instead the function D(x) = e800 — petlh — ge", this analysis wouldn't have been conclusive: even though D(0) = 0, itis not necessarily the case that D°(x) > O (for example, when p =}, 262 7, Inequaies 7.43. Prove that for all real numbers @ and 6, lava < lars [ar Oc pet. Solution. The inequality is trivial in several special cases. For example, the result holds if a= 0, or if @ and 6 have opposite signs. Also, if p= 0 or p= 1, the result is true. Therefore, it suffices to show the result is true when ‘@.and b are positive and O

, O0, $0 by our carlier remarks, the proof is com- plete. (Note that if p > 1, the inequalities would be reversed.) For thi 7.44, On (0,1, let f have @ continuous derivative satisfying 0< f"l < Also, suppose that f(0) = 0. Prove that [free] > fore. Solution. Here, as in the last example, itis not clear how to make use of differentiation. The idea is to introduce a variable and prove a more general result. For 0.< x < 1, let [L104] Cowra Fo) ‘Then F(0) = 0, and Fey Pra |seo “Leo? ~se)[2f 104 Len! We do know that f(x) > 0 for 0. 0); however, it is not clear that the second factor in the last ‘expression for F” is nonnegative. Therefare, let Gx) =f e-Ley. Qexcl. Then G()=0, and CO 2A) ~ Ya) = 241 - Fe] > 0 (the last inequality holds because f(x) > 6 and, by hypothesis, 1~ (x) 2 0). 74, Functional Considerations 263 It follows from these arguments that F(x) > 0 for all x, 0< x < 1; in particular, F(1) > 0 and the proof is complete. TAS. Show that if x is positive, then log(1 + 1/2) > 1/4 x). Solution. Let f(x) =log() + 1/x)~ 1/01 + x) (= log(| + x)— logs — 1/1 + x). Then a forma ztige _a( ta (tay ts for x>0. Furthermore, lim, 2 f(x) =0, and this, together with f(x) <0 for x >0, implies that f(x) > 0 for x > 0. 714.6, Find all positive integers m such that Maat (ne 2ta(nt3y" Solution. A direct calculation shows that we get equality when n= 2 and when m=3, A parity argument shows that it can’t hold when either n= 4 ‘or n= 5, Based on this beginning, we might expect that the key insight should involve modular arithmetic in some way. However, these attempts aren't fruitful, and we look for another approach. We will show that Pas Heng atc (ne 3y for n > 6, and thus equality holds only when 1 = 2 or n= ‘The inequality we wish to prove can be written in the following form: . (a5) +(e (ss) + (Ba ttt) ‘or, reversing the order for convenience, (-as)+ (byt 0 ays To prone thie nega tar to show that (xs )<(4) 2pm 264 7. Inequalities For then, (oats) e(esPe 6. For this, consider the function F)=(1- shy) cis straightforward to show that F(x) <0 for x > 6, and that F(6) <4. Thus, the proof is complete. TAJT. Prove that for Ris such that (7(8) > 0, then ty) JO+I0) 7) 6 and if r(x) < 0, then ree > fatfoy For example, for real numbers a and b, yey? because (x)= x7 is a convex function. As another example, if O because f(x) = sin.x is a concave function on (0,2). TAB. Prove that if a and b are positive numbers such that ¢ + b= |, then (art) +(o4 ty > Solution. We have seen that x : yx (a a Taesest/enty ots alerty@osy]> (alors es)]) =[40+2+4)f: But by the Cauchy-Schwarz inequality (1/a + 1/6Xa+ 6)> (1+ 1 =4, so that Lata Lyf. 4 \Pofiesy_ [E042 +8)] [af (+74) (4y-%- “The result follows after putting together the two preceding inequalities and multiplying each side by 2. TAS, Let 0 Log At + +109) Problems: 7.4.10 (Bernoulli's inequality). Prove that for 0 1? TAA, Prove that x x(x+2) ° TEs SOHN 0, (2 + cosx)x > 3sinx. (a) Prove this inequality by considering the function F(x) = x — Gsinx)/ 2 +cos3). (b) Prove this inequality by considering the function F(x) = @ + cosayx — 3sinx. 74.14, Prove that 74. Fonctonal Considerations 267 TAAS. Prove that 1 x ie S5)* Gray OP? TA.16. Prove that etl Say eso (FH) Gy. aero ave 7.4.17. Prove that sing a ¢ una . Sag <$ cng, O0 for i= 1,2,...,. Consider the function (2) = logt, and in a manner similar to that used in 7.429, provethat (yee xing Et te with equality if an only if all the x; are equal. 742. (a) Let x, > 0 for #=1,2,... raed (b) For positive numbers 2,b,¢ such that 1/a+1/b-+ 1/e= 1, show that (a-1Xb— Ke) > 8. 7.4.22. Show that if a,b,c are positive numbers with ¢ +b +¢ =I, then iy 1y* 1)? 100 (243) +(e 5) (ery ee: 74.23. Let a,b,c denote the lengths of the sides of a triangle. Show that Jeo 4 bye 2S etet eee tase <* +n, Use the result of 7.4.20 to show that Tr SG sa 268 7. equates ‘Additional Examples 646, 6.4.1, 7.5. Inequalities by Series ‘Another way (0 prove an inequality of the form FEDS ge), OK Ke (Gee the discussion preceding 7.4.3) is to expand f and g in power series, say $2) = SF aX" and g(x) = EF hy", for x in the interval (— dd). Tit Shonld happen that 2, < 5, for alin, then itis obvious that f(x) < #(x) for all x in the interval (0,4). 75.1. For which real numbers c is 1(e* + €7*) < efor all real x? Solution. If the inequality holds for all x then OK ce Sette) To sce that ¢ >4, divide each side by x? and set x= 0. On the other hand, if ¢ #4, a an Sox eve" & agi It follows that the stated inequality holds for all x if and only if ¢ 2 4. 269 75, Inequalities by Series Another important sevies technique with application to inequality prob- Jems concerns alternating series. Recall that if ag,ayds,... 8 a Sequence of positive numbers, then the series S'Z_(— !Y'a, converges provided the terms steadily decrease t0 zero (ie, 4,4; < a, and d,—+0 as n> 0). More ‘importantly for our purposes here, the sum Of the series lies between any two successive partial sums. (If $ denotes the sum of the series and S, denotes the nth partial sum, then ($3.41) i8 an increasing sequence, { S,,} is a decreasing sequence, and for all 2, Saya) 3sinx, x >0, ‘Solution, This is the same problein as 7.4.13, but here we will give a solution based on series considerations. ‘On the left side of the desired inequality, we know that for x > 0, xt_ xt of ays Qreosxpe> (2+ 1-= and on the right side dane <2(x- H+ ¥), Therefore, it is sufficient to prove that sat 270 1. Inequalities ‘This is true for x > 0 if and only if vco(Z)er cn ‘This proves the desired inequality for the case in which O< x ¥i2, and therefore, it is true for all x >0, and the proof is complete. Tn the preceding proof, one might ask why these many terms from the finite series were chosen. Why not more or less? To keep the inequalities going in the right direction, we need to underestimate cos.x and overesti- mate sin x, thus dictating the signs of the final terms in the series approxi« mations. The crudest estimate would be to replace cos x by 1 ~ x*/2 and to replace sinx by x. This leads us to investigate which is equivalent to and this js not true for any positive value of x. ‘As the number of terms in the series increases, the approximations improve, so the next try might be to replace cosx by I~ x7/2 + x#/4!— 26/61 and sinx by x — x°/31+ x°/5!, This leads to the solution as it was presented. ISA. Prove that (S8Y> eons, 0, (eyo 8]- Sia and carci $e ‘Therefore, it suffices to show that -242 x5) Bye 1a ata et ae 76. The Squecee Principle an or equivalently, = ght che te dat +(-ne* mm art? The left side is decreasing on the interval (0,}7} and therefore takes its minimum when x =}. In particular, for 0 < x <2, dC abet a) bed as FH" This completes the proof. Problems 7.55. Use infinite series wo prove the following inequalities: G) ef > 141 + slog +9), x > 0, (©) 14 0/2) > OC <1 (©) aresinx 0. 78.7. Prove that x 3xe0sx, x >04 75.8. Show that sin?x < sins? for 0< xy/Jo. 7.6. The Squeeze Principle Im this section we will see how inequality considerations can play an important role in evaluating limits. The key idea (which has many vasia~ tions) is expressed in the following result, ‘The Squeeze Principle. If {2.},(b,}«(éq} are infinite sequences such that ay < by << G, for all sufficiently large n,"and Wf {a,) and {c,) converge to the same number L, then {5,) alto converges to L. AAs innocuous as this principle appears (obviously, there is no alternative for {6}; it is “squeezed” between (a,) and (cy), both of which are converging (© the same limit), it is surprising that it can be useful in mm. 7, Inequalities problem solving. Nevertheless, it is applicable in the following situation. Suppose we wish to evaluate the limit of a sequence {4,), and suppose the ‘y's are hopelessly complicated, so that they cannot be handled directly. ‘The squecze principle suggests that we try to “squeeze” {b,) with two simpler sequences {a,} and (cy) For example, consider the sequence {n""}. We could evaluate this limit by L'Hépital’s rule; however, consider the following argument. By the arithmetic-mean-geometric-mean inequality, xiii) *) Now, by the squeeze principle (with a, = 1, and ¢, we sec that n!/” is forced to converge to 1 a be nl=(1x1x (neta aye re +20/fn -1/m) 7.6.1. Prove of disprove that the set of all positive rational numbers can be arranged in an infinite sequence {4,} such that {(6,)"/*) is convergent. Solution. We begin by ordering the rational numbers by following the usual serpentine path through the square array of rationals shown in Figure 7.2, ‘where we omit all fractions not reduced to lowest terms. The sequence thus begins 11,23.5.12.45.5.8, 0... If by denotes the nth term of this sequence, we would like to prove that {217°} converges to I. In Figure 7.2, observe that every element in the nth row is less than or ‘equal to n, and every clement in the mth column is greater than or equal to 49 7D 17 ye hs oe 16. The Squeeze Principle 23 1/n. Also, if 6, occurs in row i and column j, then i 0, $20, and r+ sm 1. Therefore [/(b,) ~ f(a,)|/1B, ~ 6] lies between Lf(b,) ~ f(O)/by and (f(a,)~ f(O)/ ay. Since these latter quotients converge to (0), so also must 1/(6,) — la )1/1b, — ay} by the squeeze principle. 76, The Squeeze Principle 25 7.63. Evaluate Solution, The sum Eat klite can be regarded as a Ricmann sum for the function f(x) = 1/(1 + x*) over the interval (0, n] (sce Figure 7.4). Unfortunately, it is not really a Riemann sum, because the interval over which it is taken is not a fixed interval; thus, as n> co, we don't get a definite integral. We can say, however, that for S a a de. 2lawe ) «ff arctan n?, To get a lower bound for the sum under consideration, let k be a fixed positive integer, and fix the interval (0,k]. Then, for any greater than k, eo Un River Bisgiy is a Riemann sum for f(x) = 1/(1 + x?) over the interval [0, 1. Also, 2, < jim arctan’, yo fim arciank< tim ao am 2 It follows that the desired limit equals | 7. ‘Another important application of inequalities to the evaluation of limits is based on the following important fact. ‘Monotonic, bounded sequences converge. That is to say if (4,} 18 a sequence of real numbers such that d,. > ay for all sufficiently large 2 (or a,., K respectively), then the sequence {4,) converges. For example, to prove that the sequence (1+ 1/nY" converses, it is sufficient to prove it is monotonic (increasing in this case) and bounded above (by 3; see 7.1.5). 7.64, If (a,) is a sequence such that for # > L (2 44)dn41= 1, Prove that lim, ..o4, exists and is equal to i. ‘Solution. First we will prove that if the sequence converges, it must ‘converge to 1. The argument is standard when a sequence is defined recur- sively as it is here. Let lim, a, = L. Then, taking the limit of each side of the recurrence relation @—a,)a,,,= 1, we see that 2—D)L=1, of ‘equivalently, (L — 1)° = 0, from which we conchide that L = 1. Now, to prove that the sequence converges, we will prove that itis bounded, and “eventually” becomes monotonic. (For another solution of this probiem, see 1.1.11) Suppose that for some a,,.0.< a, <1. Then 1~@~ 4a, =a, 76. The Squezze Principle mn and dy ™ W/O ~ ay) <1. Therefore, a, < ayy < deer <°°* <1, 50 the Sequence is monotonic and bounded and therefore converges. Thus, it auffices to prove that for some 2, 0-< a, < 1. There are several cases. Ifa, <0, then 0 < a; <1/(2~ a,) < I, $0 we're done by the preceding argument, Ila, > 2, then a; = 1/(2— a) <0, so again we'ze done. Thay =I, then a, = 1 for all 1 remains to check the case 1 1 raye [O" Ty Prove that lim,.,.. f(x) exists and is less than 1+ 49. ‘Solution. By the fundamental theorem of calculus fey Hy = f*feyae Observe that f(x) i increasing; moreover, flx) > 1 for all x > ly since Ail) = Land f(x) > 0. Therefore =f) = (F— x ds $0) 10= fs a = arctan x] tans ~ arctan 1. Show that fm Sm a— 1 (#Fint; Not that S,,, = 5, + los(a + 5,))) 7.6.13. The sequence Q,(x) of polynomials is defined by Qlxyettx, Qyx) 142s, and for m > 1, ame (X) = Qrm(X) + (+ TO rm (Xs Qam2(X) = Orme il) + (rm + E)XQam()> Let x, be the largest real solution of Q,(x)=0. Prove that {x,) is an increasing sequence and that lim, ...%, = 0. 76.14. Prove that it 2. ,a? converges. so does S7.(a,/#). 7.6.15. Prove that Bx xx x Qn)? #2, UXDGxS) = Ga=HAnt hy oti XEROX X00 (cht) 1 Pygixsn Nan Hina T (Hint: For 0< 8 <4, [5?sin** 98 < [5/sin"0d0 < [5/*sin™*~ "0.40, Apply the result of 2.5.14 together with the squeeze principle) Additional Examples 6.15, 63.7, 644, 6.6.2, Section 6.8, 6.94. Also, see examples of “repeated bisection” in Section 6.1, Chapter 8. Geometry In this chapter we will look at some of the most common techniques for solving problems in Euclidean geometry. In addition to the classical syn- thetic methods of Euclid, we will see how algebra, trigonometry, analysis, vector algebra, and complex numbers can be useful tools in the study of geometry. 8.1. Classical Plane Geometry In this section we will reviow the ideas and methods characteristic of classical plane geometry: namely, the study of those properties of triangles, ‘quadrilaterals, and circles that remain invariant under motion (e.g transla- tion, rotation, reflection). We will be concerned with synthetic geomeiry, which builds on an understanding of the basic notations of congruency, similarity, proportion, concurrency, ares and chords of circles, inseribed angles, ete. In addition, we wish to draw attention to the importance of algebraic and trigonometric techniques for proving results in traditional Euclidean plane geometry. BLL. Find che area of a convex octagon that is inscribed in a circle and thas four consecutive sides of length 3 units and the remaining four sides of length 2 units. Give the answer in the form + + sf, with r,s, and 1 positive integers 280 8.1. Clastieal Plane Geometry 281 We will give severat solutions to this problem to illustrate the variety of, methods that are at ones disposal in this subject. Solution 1. Let the vertices be labeled 4BCDEFGH as shown in Figure 8.1 where AB = BC= GH = HA =3 and CD = DE = EF = FG=2. Let 0 denote the center of the circle. We first find the area of 4 OAB and ODE. For this, it suffices (o find the altitudes OK and QJ. : Notice that OK = £8; this follows because O is the midpoint of EA and K is the midpoint of AB. Similarly, OF =}AD, and therefore, it suffices to find DI, 14, EJ, and 18, where 1 isthe intersection of AD and EB. By angle-side-angle, A DBC = A DBI, and therefore D/=2 and 18 =3, Furthermore, since ADE and AABE are cach inscribed in a semicircle, ZADE and ¢, then and this implies that P,Q. are collinear (vectors PG and PR have the point P in common}, which is a contradiction. Therefore a = ¢. In a simitar manner 6 = d. 83.3. Prove that the line joining one vertex of a parallelogram to the midpoint of an opposite side trisects a diagonal of the parallelogram. Solution, Label the parallelogram by A, 8, C,D as shown in Figure 8.26, let F be the midpoint of DG, and let E be the intersection of 4F and BD. Note that AB= DC and AD = BC, because as vectors they have the same ‘magnitude and the same direction. . ‘The point E is at the intersection of two lines. We can express this algebraically by saying that there exist constants @ and b such that ‘Therefore, AB + 6BD = aAP. “The idea is to express cach of the vectors in this last equation in terms of AB and AD, and then we will make use of the principle discussed prior to D E © “ 3 Figure 826. 304 8. Geometry $ Figure 827, the statement of the problem, Thus we have 4B + 6(AB ~AB) = a(AD + 448), (1 6)4B + 04D = $048 + 0B. Ic follows that 1-b=4a, bea ‘These equations imply that a= & = 3, and the result follows, 83.4, In triangle ABC (Figure 8.27), let D and E be the trisection points of sides BC with D between B and E, let F be the midpoint of side AC, and let G be the midpoint of side AB. Let H be the intersection of segments EG and DF, Find the ratio BH: HG. Solution, The plan is exactly as in the preceding problem. There are constants @ and b such that HG +0Gk = FF +076, Now express each of the vectors in terms of AB and AC: AG = 148, GE= Gh + BE = 148 +486 = AB + 3(AC ~AB) = ~ JAB + 3AC, AF=\AG, FD = FA+AB + BD = —3AC+AB + 4BC = L9C 4 AB 4 AE ABy = — NAC 4 GAB. Substituting these into the previous equation, we have $AB +o ~ $48 + 2AC) = AC +6] - 24 + 348), (4-404 + Fade = 4048 + (4-28). 183, Vector Geometry 305 Figure 828 Te follows hat flan, fant, or equivalently, a44p=3, 404 b~3. ‘The solution to this system is a= b= 3, and it follows that EH: HG 22:5 83.5. Given a triangle ABC, construct similar isosceles triangles 4BC’ and ACB’ outwards on the respective bases 4B and AC, and BCA’ inwards on the base BC (Figure 8.28). Show that 48’A‘C" is a parallelogram. Sololon. In vector language, our problem is to show that JB + 3G! = aa Let D, E, Fe the midpoint of sides 4B, BC, AC respestively. Then Bi = AP + Fl = 1404 78° AG" = AB + BC’ = 4a + DC aa AB +E + a . = AB + (AC ~ AB) + EA = 4AB + 4c + Eh To put Fi’, DC’, and EA’ into terms of AB and AC, we introduce the following notation (useful in otber problems as well). Given points P and @ let [PQ denote the vector obtained by rotating PQ, with unchanged 306 4. Geometry 1) (7 P Figure 8.29, magnitude, through a right angle in the positive direction, as in Figure 8.29. ‘Now, suppose the isosceles triangles erected on the sides of ABC have hheight-to-base ratio equal to k; that is, FB’/AC = DC'/AB = FA’/ BC =k. Then, AB) = RC + FB = V7E + kad, AC’ = YAB 4 DC’ = AB ~k|AB, Ad = 4B + \AC4 EA =4AB + AC +k[BC = JAB + {AC +k AC - AB) 2478+ AC 4 RAC kB (Note that |(F + G) = [P+ |G. and |aP = a|P for an arbitrary constant a.) ‘These expressions for AB, AC’, and AA’ show that AB-+ AG’ = Ad’, and thus the solution is complete, Given vectors PQ and RS, the dot product PQ RS is defined by the formula PG RS =|PG||RS|cos0, where 0 is the angle between the vectors, 0< 0 < 180° Trean be shown that for arbitrary vectors 4, B,C, ABBA and AG ak Fae Notice that if 4 and a are Perpendicular, then 4-8 =0. Conversely, if A+B = 0, then either 4 =0 or 8 =0, or d and B are perpendicular. Also, notice that 4-4 = [Al 83.6. In Wiangle ABC (Figure 8.30), AB = AC, D is the midpoint of BC, Eis te foot of the perpendicular drawn D to AC, and F is the midpoint of DE. Prove that AF is perpendicular to BE. 83. Vector Geometry 307 a L c Fiure 820, Solution, This is the same prablem as 1.5.3, but here we will give a proof Using vector noiaton, We have ABBE = (AE + EF) (BD + DE) = 4E- BD + FF. BD + EF-DE = (AB + DE): BD + BF. BB + EF DE {e DE-#D + EF -8D + EF. DE pe. pe - BE,PC _ DE-DE The concept of vector makes sense in Euclidean 3-space just as it does in the Euclidean plane. Just as in the case of the plane, vectors have length and direction and are represented as arrows or directed line segments (but now in 3space). They are added by the parallelogram law, and can be manipulated to prove results in solid geometry. 83.7. If two altitudes of a tetrahedron are coplanar, the edge joining the two vertices from which these altitudes issue is orthogonal to the opposite ‘edge of the tetrahedron, Solution. Suppose that AP and BZ are altitudes from A and B respectively. and suppose they intersect in a point H (Figure 831). Figuee 8.31. 4A is orthogonal to each of BC, CB, and BD, and Bi is orthogonal to ©D, AD, AC. We wish 10 show that AB is orthogonal to CB. For this, we compute the dot product AB-CD = (ii8 HA) CB = ub -CB fia -ZB =0-0=0. This completes the proof. 838. Prove that if the opposite sides of a skew (nonplanar) quadrilateral hhave the same lengths, then the line joining the midpoints of the two diagonals is perpendicular to these diagonals. Solution. Let 4, B,C,D denote the vertices of the quadrilateral, and let P and Q be the midpoints of AC and BD respectively (Figure 8.32). We are given that |4D|=|BC| and [48|=|CD|, Squaring, and translating into dot-product language, we have or equivalently, a 83, Vector Geometry 309 ‘We wish to prove that PQ is perpendicular to AC and BD; in vector Ianguage we wish to show that ‘or equivalently, (o-F) (8-7) (BB) 90. Substituting P = 1(4 +C) and @ = 4(B +B), these equations yield (6+B-4-€).(E-dy wo, ® (B4+5-A-C)-(B~B) = 0. Our problem then is equivalent to showing that the equations (1) imply the equations 2). Expanding (1), we have D-D-2A-B BB-24-8 Adding these, we get =24-D- 24 (8+B)-(€-A)- (C44) -(E- A) =0, (54 B-E-A) (6-4) =0. This is the first of the two equations in (2), To get the second of the ‘equations in (2), take the difference ofthe equations (I), The details are just as in the previous computation. In a similar way, adding and subtracting the equations in (2) yield the equations in (I), which means that the converse theorem is also true: namely, if the line joining the midpoints of the two diagonals of a skew quadrilateral is perpendicular to these diagonals, then the opposite sides of the quadrilateral are of equal length. Problems 839. In a triangle ABC the points D, E, and F trisect the sides so that BC = 3BD, CA =3CE, and AB = 3AF. Similarly, the points G, H, and 1 Urisect the sides of trisngle DEF so that EF=35G, FD =3FH, and DE=3DI, Prove that the sides of AGHI ate parailel to the sides of 310 8. Geometry Figure 8.33 ABC and that each side of the smaller triangle is 4 as long as its parallel side in the larger triangle. 83.10, The sides of AD,AB,CB,CD of the quadrilateral ABCD are di- vided by the points F,F,G,H so that AE: ED = AF; FB= CG: GB = CH: HD. Prove that EFGH is a parallelogram. 83.11. (a) In triangle ABC (Figure 8.33), points D and E divide sides BC and AC such a way that BD/DC=3 and AE/EC =3. Let P denote the intersection of AD and BE. Find the ratio BP : PE. (b) In triangle AB (Figure 8.34), points E and F divide sides AC and AB respectively 40 that AE/EC = 4 and AF/FB = 1. Suppose D is a point con side BC, let G be the intersection of EF and AD, and suppose D is situated so that 4G/GD =}. Find the ratio BD/ DC. 83.12. On the sides of an arbitrary parallelogram ABCD, squares are constructed lying exterior to it. Prove that their centers My, My, My, Mf, are themselves the vertices of a square. 8.3.13. On the sides of an arbitrary convex quadrilateral ABCD, equilat- eral triangles ABM, BCM,, CDM, and DAM, are constructed s0 that the first and third of them are exterior to the quadrilateral, while the second and fourth are on the same side of sides BC and DA as in the quadrilateral itself. Prove that the quadrilateral Af, MMf,M, is a parallelogram. 8.3.14, On the sides of an arbitrary convex quadrilateral ABCD, squares are constructed, all lying externa] to the quadrilateral, with centers Mf, Mf, 83. Vector Geometry an Mz.My. Show that MM; = MyM, and that MyM, is pempendicular to MM, 83.15. Isosceles triangles BCX, CAY, and ABZ are constructed externally ‘on the sides of a triangle ABC. Show that the centroids of ABC and AXYZ coincide. 83.16. The altitudes of a triangle ABC are extended externally to points A’, BY and C’ respectively, where Ad’ = k/h,, BB'= k/hy, and CC’ 7h.» Here, k is a constant and h, denotes the length of the altitude of, ABC from vertex 4, ete. Prove that the centroid of the triangle 4’B°C” ‘coincides with the centroid of ABC. 8.3.17, Let ABC be an acute angled triangle, Construct squares externally fon the three sides. Extend the altitudes from the three vertices until they meet the far sides of the squares on the opposite sides, Then the squares are ccat into two rectangles. Prove that “adjacent rectangles” from different squares are equal in area. That is, prove that arcai = areai’ for i= 1,23 (Gee Figure 835), (Use the dot product to give a one-line proof.) Wast happens as ABC becomes a right triangle? 83.18. In a tetsahedron, two paits of opposite edges ate orthogonal. Prove that the third pair of opposite edges must also be orthogonal, 83.19. Let 0 be a given point, let Py. Py, ..., P, be vertices of a regular n-gon, n> 7, and let Q,, Qs, ..-+Qq de Riven by 00, = OP + FF FAN oo (Par Pry Pron = Pads Prove that Qs, Qa. Qy are vertices of a regu lar n-gon. Figure 8.35. 312 8, Geometry 8.4. Complex Numbers in Geometry In this section we will build on the geometry of complex numbers intro- duced in Section 3.5. 84.1. 4,,4;,..., 4, is a regular polygon inscribed in a circle of radius r and center Q. P is a point on OA, extended beyond A,. Show that T] Pass opt— rr at Solution. Consider Figure 8.36 as representing the complex plane with the center of the circle at the origin, and with the vertices 4, al the m roots of 2" =r" = 0, Specifically, we set the affix of A, to be =, = re™* 7", (The affix of a point @ im the plane is the complex number Which corresponds to @.) With these coordinates, P corresponds to a real number, which we will denote by 2. Then \He--| “or eto r"— (zand yare realy copter 842. Given a point P on the circumference of @ unit circle and the vertices Aj,4,,.-., A, of an inscribed regular polygon of 1 sides, prove that PA} + PAE +--+ PAZis a constant, Figure 8.36. 1.6. Complex Numbers in Geometry 313 Solution, Again, let Ay,A2,... 4, correspond to the m roots of unity; Specifically, let the affix of 4, be z= e*"/*, k= 1,2,...,m. Let the affix of P bez. Then Sree Sint BF EHH) (0? = wit 2S (tine tat) & (Sap-(S2)+ San ai a ae “2° But 57.12 =0, since the =,’s are the roots of 2 —1= 0 and the eoeffi- cient of z*~! is zero. Therefore, Brae Sore Say BPR BZ, Bie ze antn (a= tend|g)=1) =2n, 843, Prove that if the points in the complex plané corresponding to two distinct complex numbers z, and 2, are two vertices of an equilateral triangle, then the third vertex corresponds to 7, —«%,, where w is an imaginary cube root of unity. Solution, Points 2),22,23 form an equilateral triangle if and only if 25 = (z)— aye? ™. Thus, given 2, and 2p, 25 must have the form “Pa, + ey aa(l-e [alee], -[-e Jey. We can see from the geometrical interpretation of these quantities (Figure 8.37) that ~1 + ¢*7¥ and —e**”/? are the imaginary cube roots of unity. Alternatively, we can verify this algebraically: m1 tet 1 + cost dx) + Isin( = 4) aly ye == 42454, 314 8, Geometry a+eW ~w cen ae ate an and Conversely, suppose z= —w2,— a'r», where w is an imaginary cube root of unity. Then = Atte" and w= 0" or wep beM and ote en, and the previous arguments show that 21,29, 25 form an equilateral triangle, 84,4, Equilatcral triangles are erected externally on the sides of an arbi- teary triangle ABC. Prove that the centers (centroids) of these three equilat- eral triangles form an equilateral triangle Solution. Let a,b,c be the affixes of 4, B,C respectively (in the complex plane), with x, yz the affixes of the centers of the equilateral triangles as shown in Figure 838, Let o=e?, Then w?+a+1=0 (u is a cube roots of unity, so 0= &* - 1 =(w— Iw? +o + 1), Also, note that e/* = ~wrande "Fm ~u, ‘The centroid of ABC has affix }(a + 6+ c). In a similar way, x, y. and z are given by xaf[ates[a-u%e-a)]]=$[2+o a+ (1—wye], yas[arb+[a—w(b—a)]] = {[2+oa+(1— 49d], zad[b+e4[b-0(e—5)]] =4[(2 +0)b+(1- ape]. To show that x, y.2 forms an equilateral triangle, it suffices to show that pox oy»), 84. Comples Number in Geometry ais Figure 8.38. -Qtadat(2+u)b+(-et ere == (et wa —(o?— wb + (ot - oe, -(Wre)= wt t=(lte)4) and therefore, the coefficients of a,b,c in the above expressions for z ~ x and ~w’(y— x) are equal. It follows that x, y,z forms an equilateral tiangle. Problems BAS, Let Ag, 41.43.43, Aq divide a unit circle (circle of radius 1) into five ‘equal parts. Prove that the chords AyA,, AoA; satisfy (AoAy- AoAny= 5. 84.6. Given a point P on the circumference of a unit circle and the vertices Ay,43,....A, of an inscribed regular polygon of n sides, prove that PAt + PAS +--+ PAS is a constant (ie, independent of the posi- tion of P on the circumference). 84.7. Let G denote the centroid of triangle ABC. Prove that 3(GA? + GB? + GC) + AB? + BC? + CA*. 316 8, Geometry 84.8, Let ABCDEF be a hexagon in a circle of radius r. Show that if AB=CD = EF=r, then the midpoints of BC, DE, and FA ate the vertices of an equilateral triangle. BAS. I 2y, 4p, 25 are such that [zy]= 24] fz] 1 and 2 +2) 4 25=0, show that 2, 23. 2 are the vertices of an equilateral triangle inscribed in a unit circle, B8A.10, Show that, £5, 25 form an equilateral triangle if and only if Bde deny tint an 84,11. The three points in the complex plane which correspond (o the roots of the equation B= 3p? +3q0 are the vertices of a triangle (@) Prove that the centroid of the triangle is the point corresponding to p. (by Prove that ABC is an equilateral triangle if and only if p? = q. Glossary of Symbols and Definitions Centroid (of a triangle) Circumeenter (of ‘a triangle) Convex hull Convex set Fibonacci sequence ever convex ‘The point where the medians of a triangle inter- sect. (A median of a triangle is a fine joining a vertex to the midpoint of the opposite side.) The center of the circumscribed circle (the circle passing through the three vertices of the trian- le). The point where the perpendicular bisec- tors of the sides of the triangle intersect, ‘The smallest convex set which contains all the points of the set. A set that contains the line segment joining any two of its points. The sequence of numbers defined as F, =, Fro, and Fy= Fy. + Fy for n>2. The sequence begins 1,"1, 2, 3, 5, 8, 13, 21, 34, 35,.. ‘A function f with the property that f(x) = f(x) for all x. ‘A function f with the property that f(— x)= = fics for all x. ‘A reabvalued function defined in the interval (a,b) sach that for each x,y,z witha

You might also like