nor thereas VED: 304 u 39619 Sutin la Hope race 4 >) 21 We hee mr prvme yp) = wa Ore fier _ iA ote ed ond Lp, Ppa, oo Assume gk sech “Gt kf ary, hs tmples ha Kgs oc k/pP (9, both) - bees # Leas eines te Esta — fhe PS ee eg tad tmcans Chet £6 Bas spose Bl repr id (ata be Jae + Pe digdar)3.3.3 aX thy = c Let geblab)e t tlie sel 2h ath Teel axthy= (thx (Dy = € (hr thy)z = aOR ot ¢ if kr A EZ Te kxhéZ th, xgeZ Gn [2 vplty = xp 2B cance Yeh (0s deat Ay t 3 Spel Ycts,)= 1 i LL Sing 141 not gp poltiph of Gebll (6) 2, ther the oh, beng far thhte be (re ay Li MYCE by ge @lll Pyoblen 3.4.[ wxMaxima document eh (8i1) if numer#false then numer:false else numer: true; (801) true (812) 157/68; ($02) 2.308823529411765 €~% pet (13) 2.308823529411765-2;¢%- ($03) 0,30882352941176 (314) 1/0. 30882352941176; ($04) 3.238095238095287 <<"! n,=3 = (815) 3.238095238095287-3; 4 —, (805) 0.23809523809529 (#16) 1/0,23809523809529; i (806) 4.199999999999085 © 77 gn, nyaY (317) 4,199999999999085-4; (807) 0.19999999999909 < % ~My (818) 1/0.19999999999909; | ($08) 5.000000000022751 Ss Ny 2sProblem 3.4.2 The continued fraction algorithm is related to anthyphairesis because m, no, ms, ... are the number of squares of size ry, ri, rs, ... in a rectangle with height and width of a and ry and mm, Ms «.. = Qo, Qs Qs from the Euclidean algorithm, if the fraction in question is 0th ys TANGA, ‘This can be illustrated with the previous exercise, where follows; 157=68-2421, 68=21-345, 21=5-4+1, 5=1-5+0 Geometrically, this means that within a rectangle with sides 157 and 68, there fits 2 squares with sides of 68, 3 with sides of 21, 4 with sides of 5, and 5 with sides of 1 Looking closely at the top right comer sewxMaxima document Problem 3.4.4 (ily (01) (si) (408) if numer#false then numer:false else numer:true; true 3H o 807568877 1.73205080756887 0. 73205080756888 1/0.73205080756888; a 1.36602540378 er a a 403784434 €" 1,366025403784434-1; 0. 36602540378443 4-14 1/0.36602540378443; 4 — aL 2,732050807568942 a ae -732050807568942-2; 0.73205080756894 1/0.73205080756894; 1, 366025403784322 th Crtinuel treeaien fa wel sProblem 3.4.3 (sil) if numer#false then numer:false else numer:true; ($01) true (eialouee (iy 2), 02) 1.414213562373005 © (813) 1.414213562373095-1; (803) 0.41421356237309 ans (814) 1/0.414213562373097 ge _ f, (R04) 2.414213562373125 (is) 2 ($05) 0.41421356237313 (816) 1/0.41421356237313; o (806) 2.414213562372891 4213562372891-2; 21356237289