fraction arithmetic. For example, consider this problem the 1995 TIMSS Trends in International Mathematics and Science Study:

Transcription

1 In recent yers, mthemtics eductors hve begun to relize tht understnding frctions nd frctionl rithmetic is the gtewy to dvnced high school mthemtics. Yet, US students continue to do poorly when rnked interntionlly on frction rithmetic. For exmple, consider this problem the 995 TIMSS Trends in Interntionl Mthemtics nd Science Study: Wht is 3/4 + 8/3 + /8? The options were A. 22/5 B. 43/24 C. 9/24 D. 5/24 More thn 42 percent of US eighth grders who worked this problem chose option A. This percent ws exceeded only by Englnd. Singpore, Jpn, nd Belgium ll hd fewer thn 0 percent students with nswer A. Consider the following rel sitution. A mn bought TV set for $000, only to return week lter, complining to the mnger tht he hd bought the sets only becuse of the dvertisement tht the price ws set t frction of the Mnufcturers Suggested Retil Price (MSRP). But the mn hd seen on the internet tht the MSRP ws only $900. Well, the mnger sid, ten ninths is frction. The story does not end there. The customer won smll clims decision becuse the judge ruled tht the mnger ws crook. The common understnding of frction, the judge sid, is number less thn. In the words of comedin Red Skelton: spek louder thn words. Wht is importnt here is to note tht CCSS requires model for frction tht enbles both conceptul understnding nd computtionl fcility. The suggested model is to first understnd unit frctions in more of less the sme wy we understnd plce vlue numbers in building n understnding of deciml representtion. A plce vlue number (or specil number), is simply digit times power of 0. These plce vlue numbers re the toms of the number system, nd we lern how to build the other numbers from them nd how these numbers enble computtion. Now for unit frctions, we cn sy tht every frction (t the elementry stge we still do not mke the distinction between frction nd rtionl number s we do below) is sum of unit frctions: m n = n + n + + n. This is similr to the ide tht every positive integer is expressible s sum of plce vlue numbers. Once we lern to perform the rithmetic opertions of plce vlue numbers, we re led nturlly to the generl cse. Such hppens with frctions lso. For discussion of plce vlue see the pper I co-uthored with Roger Howe: Unuthorized reproduction/photocopying prohibited by lw c

2 Frction versus rtionl number. Wht s the difference? It s not n esy question. In fct, the difference is somewht like the difference between set of words on one hnd nd sentence on the other. A symbol is frction if it is written certin wy, but symbol tht represents rtionl number is rtionl number no mtter how it is written. Here re some exmples. The symbol is π frction tht is not rtionl number. On the other hnd 2 is both frction nd 3 rtionl number. Now 0.75 is rtionl number tht is not frction, so we hve exmples of ech tht is not the other. To get little deeper, frction is string of symbols tht includes frction br, numertor nd denomintor. These items my be lgebric expressions or literl numbers. Any rel number cn be written s frction (just divide by ). But whether number if rtionl depends on its vlue, not on the wy it is written. Wht we re sying is tht in the cse of frctions, we re deling with syntctic issue, nd in cse of rtionl numbers, semntic issue, to borrow two terms from computer science. For completeness, we sy tht number is rtionl if it CAN be represented s quotient of two integers. So 0.75 is rtionl becuse we cn find pir of integers, 3 nd 4, whose quotient is Here s nother wy to think bout the difference. Consider the question Are these numbers getting bigger or smller? This pprently musing question cn provoke some serious questions bout wht we men by the word number. Indeed, there re two spects of numbers tht often get blurred together: the vlue of number nd the numerl we write for the number. By number we usully men the vlue while the word numerl refers to the symbol we use to communicte the number. So the numbers bove re getting smller while the numerls re getting bigger. This contrst between symbol nd substnce lso explins the difference between rtionl number nd frction. A frction is numerl while rtionl number is number. Rtionl Numbers. The most common wy to study rtionl numbers is to study them ll t one time. Let s begin. A rtionl number is number which cn be expressed s rtio of two integers, /b where b 0. Let Q denote the set of ll rtionl numbers. Tht is, 6. Q = {x x = /b,, b Z, b 0}, where Z denotes the set of integers. The following exercises will help you understnd the structure of Q.. Prove tht the set Q is closed under ddition. Tht is, prove tht for ny two rtionl numbers x = /b nd y = c/d, x + y is rtionl number. 2

3 Solution: We simply need to write x + y s rtio of two integers. Becuse of the wy we dd frctions, x + y = b + c d = d bd + cb db d + bc =. bd But d + bc nd bd re both integers becuse the integers re closed under both + nd. 2. Prove tht the set Q is closed under multipliction. Tht is, prove tht for ny two rtionl numbers x = /b nd y = c/d, x y is rtionl number. Solution: We simply need to write x + y s rtio of two integers. Becuse of the wy we multiply frctions, x y = b c d = c bd Of course, c nd bd re both integers becuse the integers re closed under. 3. Prove tht the number midwy between two rtionl numbers is rtionl. Solution: Let x = /b nd y = c/d. The midpoint of x nd y is x + y 2 which is quotient of two integers. = d + bc 2bd, 4. For this essy, we ssume the set R of rel numbers is the set of ll positive nd negtive deciml numbers nd the number zero. These decimls hve three forms, those tht terminte, ie. hve only finitely mny non-zero digits, like ; those tht repet like = 4/3, nd those tht do not repet. Prove tht ll rtionl numbers of one of the first two types, nd vice-vers, ny number of the first two types is rtionl. Solution: To see tht ech rtionl number hs either terminting or repeting deciml representtion, suppose x = /b is rtionl with nd b integers. Dividing by b using long division, results in sequence of reminders, nd 3

4 ech of these reminders is between 0 nd b. If the reminder is ever zero, the division process termintes nd the resulting deciml hs only finite number of non-zero digits. If not, then we eventully get repet reminder, nd once this hppens, the reminders reoccur in blocks. The proof in the other direction requires more cre. See the essy on representtion for this proof. 5. Let z be positive irrtionl number. Prove tht there is positive rtionl r number less thn z. Solution: Since z is positive, we cn write z = x 0.x x 2..., where either x 0 or one of the x i is not zero. Let k denote the smllest index such tht x k is not zero. Then x 0.x x 2... x k is rtionl number less thn z. 6. Prove tht the rtionl numbers Q is dense in the set of rel numbers R. Tht is, prove tht between ny two rel numbers, there is rtionl number. Solution: Suppose x n y re ny two rel numbers with x < y. Let x = x 0.x x 2..., nd let y = y 0.y y Suppose k is the smllest subscript where they differ. Then y 0.y y 2... y k is rtionl number between x nd y. In the following exercises nd problems, we need the notion of unit frction. A unit frction is frction of the form /n where n is positive integer. Thus, the unit frctions re /, /2, /3,..... s Addresses Divide the unit intervl into n-ths nd lso into m-ths for selected, not too lrge, choices of n nd m, nd then find the lengths of ll the resulting subintervls. For exmple, for n = 2, m = 3, you get /3, /6, /6, /3. For n = 3, m = 4, you get /4, /2, /6, /6, /2, /3. Try this for n = 3 nd m = 5. Cn you find finer subdivision into equl intervls tht incorportes ll the division points for both denomintors? I got this problem from Roger Howe. Solution: It is probbly best to do fter displying nd scertining some pprecition for the wy the multiples of fixed unit frction divide the number ry into equl intervls. In contrst, when you superimpose two such divisions, the resulting intervls will be quite different in length, nd the sitution my seem chotic. A tke wy would be, you cn, nd the LCM of the denomintors will give such. Also, there will lwys be t lest one intervl whose length is /LCM, nd of course, ll intervls will be multiples of /LCM. 2. Here s problem from Trin Your Brin, by George Grätzer. It is difficult to subtrct frctions in your hed, sid John. Tht s right sid Peter, but 4

5 you know. there re severl tricks tht cn help you. You often get frctions whose numertors re one less tht their denomintors, for instnce, It s esy to figure out the difference between two such frctions = = 4. Another exmple is 7/8 3/4 = (8 4)/(8 4. Simple, right? Cn you lwys use this method? Solution: Yes, this lwys works. Let < b. The b b nd b b+ = ( + )b (b + ) (b + )( + ) = be two such frctions with b + ( + ) (b + )( + ). 3. Show tht every unit frction cn be expressed s the sum of two different unit frctions. Solution: Note tht n = n+ + n(n+). 4. Sums of unit frctions () Notice tht 2/7 is expressible s the sum of two unit frctions: 2/7 = /4 + /28. But 3/7 cnnot be so expressed. Show tht 3/7 is not the sum of two unit frctions. (b) There is conjecture of Erdös tht every frction 4/n where n 3 cn be written s the sum of three unit frctions with different denomintors. Verify the Erdös conjecture for n = 23, 24, nd Solution: = (c) Cn you write s sum of different unit frctions ll with odd denomintors? Solution: Yes, it cn be done. One wy is to dd the reciprocls of ech of the following: 3, 5, 7, 9,, 5, 2, 65, 693. I suspect there re lots of other wys lso. (d) Cn ny rtionl number r, 0 < r < be represented s sum of unit frctions? 5

6 Solution: You just use the greedy lgorithm: subtrct the lrgest unit frction less thn your current frction. You cn show tht the numertor of the resulting frction is lwys less thn the numertor you strted with, so the process converges. (e) Find ll solutions to + + = 3 with b c. b c 4 Solution: There re five solutions, (,, ); (,, ); (,, ); (,, ); (,, ). Cn you prove tht these re the only solutions? In the Spce Between () Nme frction between /2 nd 2/3. Give n rgument tht your frction stisfies the condition. Solution: 2 < 7 2 < 2 3 Of course this is the midpoint or the verge of the two frctions, ( ) = 4 = < 5 9 < 2 3 This is the nswer I got from six yer old. Tht he niled the question did not surprise me, but his explntion did. He sid, is the sme s 2 5 which is less tht 5. And 5 is less tht 6 which is the sme s < 5 8 < 2 3 Who provides this nswer? A crpenter or nyone who works with rules grduted in eighths of n inch. 2 < 3 5 < 2 3 My fvorite nswer is obtined by thinking bout the wter-shring model. A pir of bicyclers hs bottle of wter between them. Three other cyclers hve two bottles of wter mong them. If they ll gree to meet nd shre eqully, how much will ech cycler get? This number 3 is clled the 5 medint of the two frctions. We see this nswer lot when fifth grders lern ddition of frctions incorrectly. Let s use the wter shring model to help our fifth grders understnd frction ddition nd frction comprisons. By the wy, do you ever wonder why 0 yer old boys cn very esily compre the frctions 6 8 nd 7 9. Bsebll! 6

7 (b) Nme frction between /5 nd 7/0. How bout between 6/7 nd /3? (c) Nme the frction with smllest denomintor between /5 nd 7/0. Or 6/7 nd /3? (d) First drw red mrks to divide long stright bord into 7 equl pieces. Then you drw green mrks to divide the sme bord into 3 equl pieces. Finlly you decide to cut the bord into = 20 equl pieces. How mny mrks re on ech piece? (e) A bicycle tem of 7 people brings 6 wter bottles, while nother tem of 3 people brings wter bottles. Wht hppens when they shre? Some of this mteril is from Josh Zucker s notes on frctions tken from workshop for techers t Americn Institute of Mthemtics, summer Some of the mteril is from the book Algebr by Gelfnd nd Shen. 6. Let x, x 2,..., x 2 be positive numbers. Show tht t lest one of the following sttements is true: x x 2 + x 3 x 4 + x 5 x 6 + x 7 x 8 + x 9 x 0 5 x x 2 + x 2 x + x 4 x 3 + x 6 x 5 4 x 8 x 7 + x 0 x 9 + x 2 x 3 Solution: If they re ll flse, then x x 2 + x 3 x 4 + x 5 x 6 + x 7 x 8 + x 9 x 0 + x x 2 + x 2 x + x 4 x 3 + x 6 x 5 + x 8 x 7 + x 0 x 9 + x 2 x < 2. But the frctions cn be rrnged in pirs of the form + b nd ech of these b sums is t lest 2, which contrdicts the inequlity. Note tht ( b) 2 = 2 2b + b 2 0. It follows tht 2 + b2 2. b b 7. Dividing Horses This problem comes from Dude, Cn You Count?, by Christin Constnd. An old cowboy dies nd his three sons re clled to the ttorney s office for the reding of the will. All I hve in this world I leve to my three sons, nd ll I hve is just few horses. To my oldest son, who hs been gret help to me nd done lot of hrd work, I bequeth hlf my horses. To my second son, who hs lso been helpful but worked little less, I bequeth third of my horses, nd to my youngest son, who likes drinking nd womnizing nd hsn t helped me one bit, I leve one ninth of my horses. This is my lst will nd testment. 7

8 The sons go bck to the corrl nd count the horses, wnting to divide them ccording to their p s exct wishes. But they run into trouble right wy when they see tht there re 7 horses in ll nd tht they cnnot do proper division. The oldest son, who is entitles to hlf tht is 8 horses wnts to 2 tke 9. His brothers immeditely protest nd sy tht he cnnot tke more thn tht which he is entitled to, even if it mens clling the butcher. Just s they re bout to hve fight, strnger rides up nd grees to help. They explin to him the problem. Then the strnger dismounts, lets his horse mingle with the others, nd sys Now there re 8 horses in the corrl, which is much better number to split up. Your shre is hlf he sys to the oldest son, nd your shre is six, he sys to the second. Now the third son cn hve one ninth of 8, which is two, nd there is = left over. The strnger gets on the 8 th horse nd rides wy. How ws this kind of division possible. Solution: The sum of the three frctions is less thn : + + = 7. So the strnger s horse helps complete the whole. 8. Consider the eqution + b = 5 2. Find ll the ordered pirs (, b) of rel number solutions. Solution: Thnks to Rndy Hrter for this problem. First, let s try to find ll integer solutions. To tht end, rewrite the eqution s Thus 2( + b) = 5b. 0 = 5b 2b 2 = 5b 2b = b(5 2) 2 44 (5 2) 5 5 = (5 2)(5b 2) 44 Now, fctoring 44 = nd looking t pirs of fctors, we cn find ll the integrl solutions. Wht bout the rest. To this end, replce with x nd b with f(x) nd solve for f(x). We get ( 5 f(x) = 2 ) = 2x x 5x 2. 8

9 This rtionl function hs single verticl symptote t x = 2/5 nd zero t x = 0. So you cn see tht for ech 0 x 2/5, there is y such tht /x + /y = 5/2. 9. Suppose {, b, c, d} = {, 2, 3, 4}. () Wht is the smllest possible vlue of + b +. c+ d Solution: We cn minimize the vlue by mking the integer prt s smll s possible nd then mking the denomintors s lrge s possible. Clerly = is the best we cn do, nd then b = 4 is certinly best, etc. So we get (b) Wht is the lrgest possible vlue of + = b +. c+ d Solution: We cn mximize the vlue by mking the integer prt s lrge s possible nd then mking the denomintors s smll s possible. Clerly = 4 is the best we cn do, nd then b = is certinly best, etc. So we get = Smllest Sum. Using ech of the four numbers 96, 97, 98, nd 99, build two frctions whose sum is s smll s possible. As n exmple, you might try 99/ /98 but tht is not the smllest sum. This problem is due to Sm Vndervelt. Extend this problem s follows. Suppose 0 < < b < c < d re ll integers. Wht is the smllest possible sum of two frctions tht use ech integer s numertor or denomintor? Wht is the lrgest such sum? Wht if we hve six integers, 0 < < b < c < d < e < f. Now here s sequence of esier problems tht might help nswer the ones bove. () How mny frctions /b cn be built with, b {, 2, 3, 4}, nd b? Solution: There re 2 frctions. 9

10 (b) How mny of the frctions in () re less thn? Solution: There re 6 in this set, /2, /3, /4, 2/3, 2/4, 3/4. (c) Wht is the smllest number of the form + c, where {, b, c, d} = b d {, 2, 3, 4}? Solution: There re just three pirs of frctions to consider, A = + 2, 3 4 B = + 2, nd C = + 3. Why is C not cndidte for the lest vlue? Note tht A bets B here becuse A = + 2 = + + while B = + +. Does this resoning work for ny four positive integers < b < c < d? The rgument for four rbitrry positive integers is bout the sme. Let A = + b, B = + b. Then A = + + b, c d d d c d d while B = + + b, nd since c < d, A < B. c d c (d) Wht is the lrgest number of the form + c, where {, b, c, d} = b d {, 2, 3, 4}? Solution: Agin there re just three pirs of frctions to consider, A = 3 + 4, B = 4 + 3, nd C = Why is C not cndidte for the lest vlue? Note tht B bets A. Does this resoning work for ny four positive integers < b < c < d?. Simpsons (with thnks to Brt nd Lis shoot free throws in two prctice sessions to see who gets to strt in tonight s gme. Brt mkes 5 out of in the first session while Lis mkes 3 out of 7. Who hs the better percentge? Is it possible tht Brt shoots the better percentge gin in the second session, yet overll Lis hs higher percentge of mde free throws? The nswer is yes! This phenomenon is clled Simpson s Prdox. () Find pir of frctions /b for Brt nd k/l for Lis such tht /b > k/l nd yet, Lis s percentge overll is better. Solution: One solution is tht Brt mkes 6 out of 9 in the second session while Lis mkes 9 out of 4. Now 2/2 > /20. The numbers 2/2 nd /20 re clled medints. Specificlly, given two frctions /b nd c/d, where ll of, b, c, nd d re positive integers, the medint of /b nd c/d is the frction ( + c)/(b + d). (b) Why is the medint of two frctions lwys between them? Solution: Imgine two groups of bicyclists, one with b riders nd bottles of wter mong them, nd the other with d riders nd c bottles of wter mong them. When they meet, they ll gree to shre eqully. Thus we hve b + d cyclists with totl of + c bottles of wter. Is it cler tht +c lies between /b nd c/d? b+d 0

11 (c) Notice tht the medint of two frctions depends on the wy they re represented nd not just on their vlue. Explin Simpson s Prdox in terms of medints. (d) Define the medint M of two frctions /b nd c/d with the nottion M(/b, c/d). So M(/b, c/d) = ( + c)/(b + d). This opertion is sometimes clled student ddition becuse mny students think this would be good wy to dd frctions. Compute the medints M(/3, 8/9) nd M(4/9, 2/2) nd compre ech medint with the midpoint of the two frctions. Now lets see wht the prdox looks like geometriclly on the number line. Here, B nd B 2 represent Brt s frctions, L, L 2 Lis s frctions, nd M B, M L the two medints. L B M B M L L 2 (e) (Brt wins) Nme two frctions B = /b nd B 2 = c/d stisfying 0 < /b < /2 < c/d <. Then find two more frctions L = s/t nd L 2 = u/v such tht i. b t 2 c ii. <, nd d v s+u iii. t+u b+d (f) (Lis wins) Nme two frctions B = /b nd B 2 = c/d stisfying 0 < /b < /2 < c/d <. Then find two more frctions L = s/t nd L 2 = u/v such tht s i. < <, t b 2 u ii. < c <, nd v d +c iii. < s+u. b+d t+v 2. Using the nottion M(/b, c/d) we introduced bove, write the mening of ech of the sttements below nd prove them or provide counter exmple. () The medint opertion is commuttive. Solution: Yes, nd this follows from the commuttivity of ddition of integers. (b) The medint opertion is ssocitive. Solution: Yes, nd this follows from the ssocitivity of ddition of integers. B 2

12 (c) Multipliction distributes of medition. Solution: This is lso true. Using /b c/d insted of M(/b, c/d), we hve /b(c/d e/f) = /b((c + e)/(d + f)) = (c + e)/b(d + f) = (c + e)/(bd + bf) = c/bd e/bf. 3. The number of femle employees in compny is more thn 60% nd less thn 65% of the totl respectively. Determine the minimum number of employees overll. Solution: The nswer is 8, becuse the frction 5/8 is between 60% = 3/5 nd 65% = 3/ The frction of femle employees in compny is more thn 6/ nd less thn 4/7 of the totl respectively. Determine the minimum number of employees overll. Solution: The nswer is 9. The medint of 6/ nd 4/7 is 0/8, which reduces to 5/9. 5. The number of femle employees in compny is more thn 60% nd less thn 65% of the totl respectively. Determine the minimum number of employees overll. Solution: By tril nd error, the minimum number is 8. There could be 5 femles nd 3 mles. This is lso true in cse we know tht the percentge is less thn the Fiboncci frction 3/2, which mkes the problem bit hrder. 6. For positive integers m nd n, the deciml representtion for the frction m/n begins 0.7 followed by other digits. Find the lest possible vlue for n. Solution: 7. Fbulous I () Find two different deciml digits, b so tht < nd is s close to s b possible. Prove tht your nswer is the lrgest such number less thn. Solution: 8. This is s lrge s cn be. Why? 9 (b) Find four different deciml digits, b, c, d so tht + c < nd is s close b d to s possible. Prove tht your nswer is the lrgest such number less thn. Solution: 7 + = 7. This is s lrge s cn be. Why? (c) Next find six different deciml digits, b, c, d, e, f so tht + c + e < b d f nd the sum is s lrge s possible. Solution: One is =

13 (d) Find four different deciml digits, b, c, d so tht + c < 2 but is otherwise s lrge s possible. Prove tht your nswer is correct. Then chnge b d the 2 to 3 nd to 4. Solution: The denomintor cnnot be 72 or 63. Why? Trying for frction of the form 2n, where n = 56, we re led to = n Why? (e) Next find six different deciml digits, b, c, d, e, f so tht b + c d + e f < 2 nd the sum is s lrge s possible. Then chnge the 2 to 3 nd to 4. (f) Finlly find four different deciml digits, b, c, d so tht + c > but is b d otherwise s smll s possible. Prove tht your nswer is correct. Then chnge the to 2 nd to 3. Solution: 8. Fbulous II () Use ech of the digits, 2, 3, 4, 5, 6, 7, 8, 9 exctly once to build some frctions whose sum is. For exmple = =. Find ll solutions. Solution: Think bout the multiples of 9: 9, 8, 27, 36, 45, 54, 63, 72, 8. Note tht they use the sme pir of digits or hve no digits in common. 9 Thus, = 8 = 27 = 36 ll hve vlue /2. Note lso tht there is n odd opertion δ tht preserves frction vlue: δ 3 = 93. This opertor is the key to building solutions to the eqution. More lter on this. (b) Use ech of the digits, 2, 3, 4, 5, 6, 7, 8, 9 exctly once to fill in the boxes so tht the rithmetic is correct. + + =. Wht is the lrgest of the three frctions? Solution: We my ssume tht the second numertor is 5 nd the third is 7. If either 5 or 7 is used in denomintor, it cn never be neutrlized. Since the lest common multiple of the remining numbers is 72, we cn use /72 s the unit of mesurement. Now one of the three frctions must be close to. This cn only be 5/(2 3) or 7/(2 4). In the first cse, we re short 2 units. Of this, 7 must come from the third frction so tht the other 5 must come from the first frction. This is impossible becuse the first frction hs numertor nd 5 does not divide 72. In the second cse, we re 9 units short. In this cse, 5 must come from the second frction nd 4 must come from the third. This cn be chieved s shown below. 3

14 =. 9. Use exctly eight digits to form four two digit numbers b, cd, ed, gh so tht the sum b + ef is s smll s possible. As usul, interpret b s 0 + b, etc. cd gh Solution: The nswer is First, the four numertor digits re, 2, 3, nd the four denomintor digits re 6, 7, 8, nd 9. Also, if b + ed is s smll cd gh s possible, then < b nd c > d, e < f nd g > h. For convenience, we ssume c < g. Then = > becuse >. cd gh cd gh cd gh cd gh gh cd Now compre 3 3 with 24 ( = ) 98 = Pretty clerly, = 3 ( 76 87) > 20. Next find six different deciml digits, b, c, d, e, f so tht b + c d = e f. Solution: There re mny solutions. One is = Notice tht 9 95 = 9/ 9/5 = 5. Cn you find more pirs of two-digit numbers, with the smller one on top, so tht cncelltion of this type works? Do you hve them ll? Solution: Let us first build n eqution using plce vlue nottion. Note tht the eqution cn be written 0 + b 0b + c = c, where, b, c re digits nd < c. This leds to c(0 + b) = (0b + c), which we messge to get 0c c = 0b bc. This, in turn leds to 9c + bc = c(9 + b) = 0b. From this it follows tht either c = 5 or 9 + b is multiple of 5. Cse. c = 5. Then 0 + b 0b + 5 = 5. Next, letting =,... = 4, etc. we find tht = : 5b + 50 = 0b + 5 from which it follows tht b = 9. = 2 : b = 20b + 0 from which it follows tht 90 = 5b nd b = 6. = 3 : 30+b 0b+5 = 3 5 gives b = 30b + 5 which hs not integer solutions. 4

15 = 4 : 40+b 0b+5 = 4 5 gives rise to b = 40b + 20 which lso hs not solutions. Why do we need not to check ny higher vlues of? Cse b is multiple of 5. Agin we consider =, = 2, etc. = : 9 + b = 0 or 9 + b = 5.If b = 9 we get c = 5 cse we lredy considered. If b = 6 we get c = 4, new solution. b = 6, bc = 64, nd /c = /4. = 2 : 8 + b is either 20 or 25. One leds to b = 2 nd other b = 7 nd neither of these works. = 3 : This leds to b = 8 which does not produce n integer vlue for c. = 4 : b = 45, so b = 9. This leds to c = 8. The four solutions re 9 95 = 9/ 9/5 = = 26/ 6/5 = = 6/ 6/4 = = 49/ 9/8 = 4 8 = Problems with Four. These problems cn be very tedious, with lots of checking required. They re not recommended for children. () For ech i =, 2,..., 9, use ll the digits except i to solve the eqution b + c d + e f + g h = N for some integer N. In other words rrnge the eight digits so tht the sum of the four frctions is whole number. For exmple, when i = 8 we cn write = 4. (b) Wht is the smllest integer k such tht + c + e + g = k? Which digit b d f h is left out? Solution: The smllest chievble k is 2. It cn be chieved when the digit left out is i = 5 or i = 7: /4 + 7/6 + 2/8 + 3/9 = 5/4 + /6 + 2/8 + 3/9 = 2. 5

16 (c) Wht is the lrgest integer k such tht + c + e + g = k? Which digit b d f h is left out? Solution: The lrgest chievble k is 6. It cn be chieved when the digit left out is i = 4 or i = 5: 9/ + 7/2 + 8/3 + 5/6 = 8/ + 7/2 + 9/3 + 6/4 = 9/ + 8/2 + 7/3 + 4/6 = 6. (d) For wht i do we get the gretest number of integers N for which + b c + e + g = N, where S d f h i = {, b, c, d, e, f, g, h}? Solution: For i = 5 there re 36 solutions. For i =,..., 9 we hve 4, 3, 5, 4, 36, 3, 25, 7, nd 2 solutions respectively. (e) Consider the frctionl prt of the frctions. Ech solution of + c + e + b d f g = N belongs to clss of solutions with the sme set of frctionl prts. h For exmple, 5/2+8/4+7/6+3/9 = 6 nd 5/+7/6+4/8+3/9 = 7 both hve frctionl prts sets {/2, /3, /6}. How mny different frctionl prts multisets re there? Solution: There re sets of frctionl prts including the empty set. They re ϕ, {/2, /2}, {/4, 3/4}, {/3, 2/3}, {/4, /4, /2}, {/2, 3/4, 3/4}, {/2, /3, /6}, {/2, 2/3, 5/6}, {/3, /2, /2, 2/3}, {/6, /4, /4, /3}, {/4, /3, 2/3, 3/4}. (f) Find ll solutions to b + c d + e f + g h = i where ech letter represents different nonzero digit. Solution: There re two solutions with i = 5, one with i = 7, one with i = 8 nd four with i = 9. (g) Find ll solutions to b + c d + e f + g h = 2i where ech letter represents different nonzero digit. Solution: There re two solutions with i = 5, one with i = 6, nd three with i = 7. (h) Find ll solutions to b + c d + e f + g h = 3i where ech letter represents different nonzero digit. Solution: There is one solution with i =, one with i = 4, nd four with i = 5. 6

17 (i) Find ll solutions to b + c d + e f + g h = 4i where ech letter represents different nonzero digit. Solution: There re two solutions with i = 3 nd one with i = 4. (j) Find ll solutions to b + c d + e f + g h = 5i where ech letter represents different nonzero digit. Solution: There is only one solution: 5/ + 7/3 + 8/4 + 6/9 = 5 2 = 0. (k) Find the mximum integer vlue of b + c d + e f + g h i where ech letter represents different nonzero digit. Solution: Let G i denote the lrgest integer vlue of + c + e + g i b d f h where ech letter represents different nonzero digit. The lrgest possible vlue is 2. It is chieved when i = 4; 9/ + 7/2 + 8/3 + 5/6 4 = 2. The resoning goes like this. The lrgest possible vlue of + c + e + g is b d f h 9/+8/2+7/3+6/4 = 6+2/3, so the lrgest possible integer vlue is 6. This mens tht we need only check the vlues G, G 2, nd G 3. There re only four wys to get n integer by rrnging the digits 2, 3, 4, 5, 6, 7, 8, 9 in the form + c + e + g, nd the resulting integers re 3, 6, 6, nd 8. So b d f h G = 8 = 7. In cse i = 2 there re just three wys nd the integers 7, 0, nd 2 result, so G 2 = 2 2 = 0. Finlly, G 3 is the lrgest of 0 3, 2 3, 3 3, nd 4 3 =. It would be enough to show tht we cnnot chieve 6 using ll the nonzero digits except 3, 5 without the 2, or 4 without the, nd this does not tke too much work. 7