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 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. 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 0.75. Here s nother wy to think bout the difference. Consider the question Are these numbers getting bigger or smller? 3 4 5 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 denoted 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.. 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. Sylor URL : www.sylor.org/courses/m 0 Hrold Reiter
3. Prove tht the number midwy between two rtionl numbers is rtionl. 4. For this essy, we ssume the set R of rel numbers is the set of ll positive nd negtive deciml numbers. These decimls hve three forms, those tht terminte, ie. hve only finitely mny non-zero digits, like.500...; those tht repet like.3333... = 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. 5. Let z be positive irrtionl number. Prove tht there is positive rtionl r 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. In the following 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 /, /, /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 =, m = 3, you get /3, /6, /6//3. For n = 3, m = 4, you get /4, /, /6, /6, /, /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.. 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 you know. there re severl tricks tht cn help you. You often get frctions whose numertors re one less tht their denomintors, for instnce, 3 4. It s esy to figure out the difference between two such frctions. 3 4 = 4 4 = 4. Simple, right? Cn you lwys use this method? 3. Show tht every unit frction cn be expressed s the sum of two different unit frctions. Sylor URL : www.sylor.org/courses/m 0 Hrold Reiter
4. Sums of unit frctions () Notice tht /7 is expressible s the sum of two unit frctions: /7 = /4 + /8. 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 = 3, 4, nd 5. (c) Cn you write s sum of different unit frctions ll with odd denomintors? (d) Cn ny rtionl number r, 0 < r < be represented s sum of unit frctions? 5. In the Spce Between () Nme frction between / nd /3. frction stisfies the condition. Give n rgument tht your (b) Nme frction between /5 nd 7/0. How bout 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 7 + 3 = 0 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 009. Some of the mteril is from the book Algebr by Gelfnd nd Shen. 6. 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 Sylor URL : www.sylor.org/courses/m 3 0 Hrold Reiter
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. 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 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 8 9 6 = left over. The strnger gets on the 8 th horse re rides wy. How ws this kind of division possible. 7. Consider the eqution + b = 5. Find ll the ordered pirs (, b) of rel number solutions. 8. Suppose {, b, c, d} = {,, 3, 4}. () Wht is the smllest possible vlue of + (b) Wht is the lrgest possible vlue of + b +. c+ d b +. c+ d 9. 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/96 + 97/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 Sylor URL : www.sylor.org/courses/m 4 0 Hrold Reiter
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 is 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 {,, 3, 4}, nd b? (b) How mny of the frctions in () re less thn? (c) Wht is the smllest number of the form + c, where {, b, c, d} = {,, 3, 4}? (d) Wht is the lrgest number of the form + c, where {, b, c, d} = {,, 3, 4}? 0. Simpsons (with thnks to http://www.cut-the-knot.com) 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. The numbers / nd /0 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? (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, /) 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 represent Brt s frctions, L, L Lis s frctions, Sylor URL : www.sylor.org/courses/m 5 0 Hrold Reiter
nd M B, M L the two medints. L B M B M L L (e) (Brt wins) Nme two frctions B = /b nd B = c/d stisfying 0 < /b < / < c/d <. Then find two more frctions L = s/t nd L = u/v such tht i. b t c ii. <, nd d v s+u iii. t+u b+d (f) (Lis wins) Nme two frctions B = /b nd B = c/d stisfying 0 < /b < / < c/d <. Then find two more frctions L = s/t nd L = u/v such tht s i. < <, t b u ii. < c <, nd v d +c iii. < s+u. b+d t+v. Fbulous () Use ech of the digits,, 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? =. (b) Find four different deciml digits, b, c, d so tht + c < nd is s close to s possible. Prove tht your nswer is the lrgest such number less thn. (c) Next find six different deciml digits, b, c, d, e, f so tht b + c d + e f < nd the sum is s lrge s possible. (d) Find four different deciml digits, b, c, d so tht + c < but is otherwise s lrge s possible. Prove tht your nswer is correct. Then chnge the to 3 nd to 4. (e) Next find six different deciml digits, b, c, d, e, f so tht b + c d + e f < nd the sum is s lrge s possible. Then chnge the to 3 nd to 4. (f) Finlly find four different deciml digits, b, c, d so tht + c > but is otherwise s smll s possible. Prove tht your nswer is correct. Then chnge the to nd to 3. B Sylor URL : www.sylor.org/courses/m 6 0 Hrold Reiter
. 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 3. Next find six different deciml digits, b, c, d, e, f so tht b + c d = e f. 4. Problems with Four. These problems cn be very tedious, with lots of checking required. They re not recommended for children. () For ech i =,,..., 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 9 + 5 + 4 3 + 7 6 = 4. (b) Wht is the smllest integer k such tht + c + e + g = k? Which digit f h is left out? (c) Wht is the lrgest integer k such tht + c + e + g = k? Which digit f h is left out? (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}? (e) Consider the frctionl prt of the frctions. Ech solution of + c + e + f g h = N belongs to clss of solutions with the sme set of frctionl prts. For exmple, 5/+8/4+7/6+3/9 = 6 nd 5/+7/6+4/8+3/9 = 7 both hve frctionl prts sets {/, /3, /6}. How mny different frctionl prts multisets re there? (f) Find ll solutions to b + c d + e f + g h = i where ech letter represents different nonzero digit. (g) Find ll solutions to b + c d + e f + g h = i where ech letter represents different nonzero digit. (h) Find ll solutions to b + c d + e f + g h = 3i where ech letter represents different nonzero digit. Sylor URL : www.sylor.org/courses/m 7 0 Hrold Reiter
(i) Find ll solutions to b + c d + e f + g h = 4i where ech letter represents different nonzero digit. (j) Find ll solutions to b + c d + e f + g h = 5i where ech letter represents different nonzero digit. (k) Find the mximum integer vlue of b + c d + e f + g h i where ech letter represents different nonzero digit. 5. Ford Circles. Let r = /b be rtionl number where nd b re positive integers with no common fctors. The Ford circle F r is circle tngent to the x-xis t the point r with dimeter /b. For exmple F / hs the eqution (x ) + (y 4 ) = 64. () Find n eqution for the Ford circles F nd F /3. (b) Drwing the Ford circles F nd F, it ppers tht they re tngent to one nother. Prove it. (c) Next, construct the Ford circle F, nd notice tht it ppers to be 3 tngent to both F nd F. Prove tht it is. (d) Now consider two rbitrry Ford circles F r nd F p, where r is close to s q s p in the sense tht ps qr =. Show tht the two Ford circles re q tngent. 6. Frey Sequences. A Frey sequence of order n is the sequence of completely reduced frctions between 0 nd which, when in lowest terms, hve denomintors less thn or equl to n, rrnged in order of incresing size. Ech Frey sequence strts with the vlue 0, denoted by the frction 0/, nd ends with the vlue, denoted by the frction / (lthough some uthors omit these terms). So F = {0/, /}, F = {0/, /, /}, nd F 3 = {0/, /3, /, /3, /}. () Build the sequences F 4, F 5 nd F 6. (b) How is ech Frey sequence relted to the one tht cme just before it? Sylor URL : www.sylor.org/courses/m 8 0 Hrold Reiter