——__ ——__——_——— Euc.ip's ALGORITHM 1 AND REAL NUMBERS It is India that gave us the ingenious method of expressing all numbers by means of ten symbols, each symbol receiving a value of position as well as an absolute value; a profound and important idea which appears so simple to us now that we ignore its true ‘merit, We shall appreciate the grandeur of the achievement to be more when we remember that it escaped the genius of Archimedes and Apollonius, two of the greatest men produced by the antiquity ~ Piere Simon Laplace 1.1 Introduction In standard IX, we have studied rational numbers and irrational numbers collectively forming the set of real numbers. Actually the philosophy of numbers starts from the theory of numbers (integers), their divisibility properties and consequent results. 1.2 The Division Algorithm In mathematics and particularly in arithmetic, the usual process of division of integers gives unique integers called a quotient and a remainder. The integer division algorithm is an effective method for obtaining a quotient and a remainder. Using decimal presentation of integers (or infact any other positional notation), long division is an algorithm. Mainly there are two versions of division algorithm in use = Division Algorithm (1) Given integers a and 5, b # 0, there exist unique integers q and r such that a= bgtrO0Sr< lb). ‘This applies to division process in all integers with the condition that b # 0. is called the dividend, 6 is called the divisor, q is called the quotient and r is called the remainder. (2) Generally we use the following form of division algorithm; also called Euclid’s division Lemma, Given positive integers @ and 5, there exist unique non-negative integers q and r such that a = bg +r, 0S7< 5. Since we apply division process mainly for natural numbers form (2) is widely used. Sometimes another version of (1) is also used. a= bg +r —4|b| 3, not n+ 1 is even, they being consecutive integers. cs 2 divides n(n + DQn + 1) 3k or 3k + 1 or 3k-+2 for some k EN Also, (Uf m= 3k, mln + 12m + 1) = BGK + 1)(6K + 1) is divisible by 3 (i) m= 3k + 1 nln + Qn + 1) = Bk + IK + 26K + 3) = 3Gk + 1)Gk + 2)(2k + 1) is divisible by 3 Gil) m= 3k + 2, nln + 1) Qn + 1) = Bk + 2VGK + 3Y6E + 5) = 3G + 2k + 1N6K + 5) is di In any case 2 and 3 divide m(n + 1)2n + 1) s+ nu + 1)Qn + 1) is divisible by 6 as 2 and 3 have no common factor. sible by 3 2” for m2 2, m © N. If mis an odd positive integer, then 3" + 1 is divisible by 4 and not by 2 for m > 3, m © N. (Use the fact that square of an odd integer is of form 8k + 1.) Solution ; If m is even, say n = 2k, then 3” = 324 = 3h? = a + 1 (Gis odd) 341 = 8a +2 = 24a + 1) 2 divides 3” + | and 4a+ 1 is odd. Therefore 2", does not divide 3” + | for m > 2, m € N. If n is odd, say n= 2k +1, ‘Then 3" +1 = 34141 =3.9%4 1 = 380+ +1 GF is odd) =a +4 = 46a + 1) °. 4 divides 3" + 1 and 2", m€ N, m 23 does not divide 3" + 1 as 6a + 1 is odd, 1. Prove that 16 divides nt + 4n? + 11, if m is an odd integer. 2, Prove that if m is a positive even integer, then 24 divides n(n + 1)(n + 2). 3. Prove that if either of 2a + 36 and 9a + 56 is divisible by 17, so is the other. a, 6 N (Hint : 4a + 38) + 9a + 5b = 17a + 175) 4, Prove that every natural number can be written in the form Sk or Sk+ I or Sk+2, kE NU (0}. 4 “Marni 10Prove that if 6 has no common factor with n, n® — 1 is divisible by 6. 6, Prove that product of four consecutive positive integers is divisible by 24. * 1.3 Euelid’s algorithm We have studied division algorithm also called Euclid’s division lemma, Its most important application is to find g.c. (Greatest Common Divisor) of two positive integers. As such, we know about gcd, and Lem. (Least Common Multiple) of two positive integers. A formal approach to this concept is what we are going to understand, Before taking it up, let us understand following example from Brakmasphuta Siddhanta @Brahma's correct system) by Brahmagupta (born 598 AD). ‘An old woman goes to market and a horse steps on her basket and crashes the eggs. The rider offers to pay for the damages and asks her how many eggs she had brought. She does not remember exact figure. When she had taken them two at a time, there was one egg left. The same hhappened when she had taken them three, four, five or six at a time, But when she took them seven at a time they came out even. What is the smallest number of eggs she could have had ? (Congratulations for the patience of the rider !) ‘The problem says if n is the number of eggs she had, then n divided by 2, 3, 4, 5 or 6 leaves remainder 1 and n is divisible by 7. Thus — 1 is a multiple of 2, 3, 4, 5 and 6. s+ n= 1is a multiple of 60 (Lam. of 2, 3, 4, 5 ++ ncould be 61, 121, 181, 241, 301 ete. 7 divides 301 out of them. +. 301 is the smallest number of eggs the old woman had. Lem, and g.c.d. are co-related concepts. Definition : If for a positive integer a, there exists a positive integer 6 such that a = be for some positive integer c, then we say positive integer 6 is a factor of a or divisor of a. We write b|a. Since ¢ > 1, a = 5 or in other words 5S a. If b is not a factor of a, we write bf a. If a and 6 are positive imtegers and if c divides @ and c divides b, we say ¢ is a common divisor of a and 6. Since ¢ Sa and cS 6 and the number of positive integers less than a and 6 both is finite, there must be the largest common divisor from amongst common divisors of a and 5. This positive integer is called the greatest common divisor of a and 5. It is called g.cd. of a and 6 in short. So if d is a g.cd. of a and 6, then (dla and d|b (dja means d divides a) (i) If cla and c|d, then ¢ < d (d Is the greatest common divisor of a and b or it can be proved that (ji) is equivalent to (ii). (ii) Hela and ¢14, then | d. Eucup's Avconrris ano Reat NUMBERS 3——__ OO Now how to find gcd. of two positive integers a and b ? The procedure is known as Euclid’s algorithm. ‘The algorithm runs as follows : Let a and 6 be positive integers with a > 6. (any harm if a <6 2) Divide a by b and continue the iterative division as shown : a= bay +19 b= rq +r, nonin tn er OSrm 1) Proof : Let a = p,tt p,2 wu. pj be prime factorisation of a, where p, are distinct primes and a, € N. fea = RM pr. PED 21 Pye DEH) = ren pm Now pla’. Pip pa +. pis one of the primes in the prime factorization of a. By uniqueness part of fundamental theorem of arithmetic p = p, for some i. Pye ppt pe ” pla Lemma 2 : If m is the least positive divisor of a, then m $ Va, a € N. Proof: Leta= mn m,n © N Since m is the least positive divisor and n is also a divisor of a, m 2, 0 = 2 Similarly, if m > m, a = Po = 1, obvi ee or 2 If m= n, obviously a oo on 3003 4008-16, For, example, 2357 107 2s 25,2521) 2 ie 10 uy _ 1 so Hence we have the following theorem ‘Theorem 13 ; If a rational number is of the form a= Soy for non negative integers m and , then a has a terminating decimal expansion. Theorem 1.4 A rational number © has terminating decimal expansion if and only if q = 2"5" for non-negative integers m, 1. +} = 0.142857 is a rational number with a non-termi ing recurring decimal expansion. Theorem 15 : A rational number @ = 2 yas a non-terminating recurring decimal expansion if and only ifq is not of the form 2"5" m,n € NU {0} or in other words gcd. (p, 9)=1 and q has at least one more prime factor other than 2 or Example 20 : Decide if the following rational numbers have terminating decimal expansion or not and if it has, find it) Zi QQ d>@z@s 318 _ 2696 TX ~ Toop ~ 2.696 Solation + (1) 32 = Here 125 = 59 = 53-29 and guesd. (337, 125) = 1 + 2B} has a terminating decimal expansion, i @ ges Here, 54-2! is of the form 2"5" and g.eud(1l, 1250) = 1. . dieu. = Tas Fag 7 Sa ~ Toms ~ 00088 c+ qhep has a terminating decimal expansion @ 3-34 Here, g.c.d. (12, 35) = 1 and 35 = 5-7 has a prime factor 7 other than 2 or 5. 22 oes not havea terminating dima exp Evcun’s Avconrrvi ano Rvat. NUMBERS 9_ ae 216 6 O BTS Thus equivalent fraction $ has g.c.d(6, 5) = 1 and q = 5 = 2"5" with m= 0n 1.2 is @ terminating decimal expansion. 1, State whether following rational numbers have terminating decimal expansion or not if it has terminating decimal expansion, find it Oo @Oc% Od © ts Om Om oF oz Ow 00) 2. Following real numbers are expressed in decimal form. Find whether they are rational oF not. If rational, express them in the form +. Comment on factors of q: (1) 0.010010001 00001... (2) 3. 456789123 (3) 5.123456789 (4) 0.090909... = 0.09 (©) 2.312 (6) 0.742857 (7) 0.9999...... = 0.9 (8) 5.781 (9) 2.312 (10) 0.12345 * 1.7 Surds ‘Now we will study some special type of irrational numbers like ¥2, V3, ¥3 +02. They are called surds If a is a positive rational number, n € N,m #1 and if Ya ¢ Qt, then we say that Ya is a surd. So2€ Qtand V2 ¢ Qt. Hence V2 isa sud. 2 € Qt. But fF € Qt. Thus fF is a surd. aa We write 2 = V5. simiteiy (2 = Far — T7NS. So we consider Ya = mb where me Q'b€ Nand n © N~ {1}. Hence we will think of surds {iq where a is a positive integer. Our study will be confined to surds of type va where a is a positive integer. This type of surds, are called quadratic surds. Now V12 = 2V3, J48 = 4V3, V72 = 6¥2. Hence we can write Ya = be where c is a square free number i.e. c has no factor p? where p is a prime. Surds like Ji2 = 2¥3, J48 = 44/3 are called like surds. So if the square free part Vc is same, then be and d¥é are like surds, Surds like Vi2 = 2v3, ¥72 = 62 are called unlike surds. If the square free parts of AP and V2 are different, then VP and Va are unlike surds. Like surds can be added as JI2 + V48 = 2V3 + 4V3= 6y3. V3, V5, SV2are called monomial surds. ¥3 + V2, v5 + 1, J3 —2 etc. are called binomial surds. If product of two binomial surds is a rational number, they are called rationalising factors of each other, ¥3 + V2 and V3 — V2 are ‘conjugate surds’. Ya + Vb and Va — Vb are, in general, conjugate surds of each other. Multiplication of conjugate binomial quadratic surds results into a rational number. 20 ‘Marienearics 10Note :2 + 3 and 2 — ¥3 are conjugate quadratic surds of each other as well as rationalising factor of each other. But 3 + V2 and 15 — S¥2 are rationalising factors of each other, but not the conjugate surds of each other. (a + Voyda - o)=a-6 ‘We will use some results about surds Result 1: If a+ Vb = Ve where a € Q and Vb and Vc are surds, then Result 2: Ifa + Vb = c+ Vd where a, ¢ € Q, vb, Vd are surds, then a= ¢, b= d. Note : It is necessary that Vb, Vd are surds icc. irrational 3+ 925 =1+ J49 but3 #1, 25 #49 Square root of a surd : (V3 + V2? =3 +2V6 +2=5+2¥6 So we can write J5yaV6 = V3 + VB. Here we say that a square root of binomial surd $+ 2V6 is ¥3 + V2. We accept following results : =Oand b=c. Result 3: In order that Ja+2vb = Vx + Vy where x,y € Q*, vb isa surd is that a © Q* and a? — 46 is the square of a rational number. In fact x = + fa? 7 So that x + y= a and xy = 6 Hence there are two approaches to find yla+20b. Find integers x and y such that x + y = xy = b or use the formula to find x, y. (Note : We will get rid of fractions and simplify to make a and 6 integers.) ut favavo = de + Jy, then fo-20b = Vx - Wy @>y Example 21 : Find 46+2¥5- tution : Let us try to find positive integers x, y such that x + y = 6, xy = 5. Obviously x= 5, y= 1 ¥or2d5 = 45 + i= V5 +1 ee z Another method : a = 6, b = 5 _ataaab _ 6+ f= _ 644 Be -4 2 y= ale z o forad5 = v5 +1 ‘Example 22 : Find 4-3. sotwton : [Foi = f= = fieale Eucu's Auconrrive axo Reat Nuwprns, 2«>» Example 23 : Find 24/5 Solution : foe = (228 = Hee ‘Now concentrate on [442J3 xtys 43 eeayel . Bri isn fir thas 9 ae Remember : (1) Generally we do not keep vm in the denominator and so, we rationalise by multiplying and dividing it by Ym 2) To find the square root, the form should be a + 2¥b If there is a factor other than 2 multiplying vb , then keep only 2 as multiplier of Vb . As for example, 4V3 = 2012, 143 = 2v147 (3) If there is no 2 as multiplier of Jé bring it as follows. J6 = 326 = 32V6 ) Also write like VIZ = 23 and ¥72 = 2Vi8. In other words bring the binomial surd whose square root is to be found out to the form a+2vb where a and b are positive integers. Sit a —1_ Example 24 ; Simplify Batgetuntt Tea fe G8 inna * Wid aD tt Unt apn — a = BAI BB EB et A = evn=1 : —41— ,; 1 Example 25 : Simplify Joos * Fane ‘ 2 ‘Marnesearics 10 Solution : Given expression =_ _ 4B +y fi- Si) ~ B= * Ws BiB =B+it8-8 =1- 8+ Br & 1, Find the square roots of following surds : @s+Wv6 @otwd @2-4 Met fe-F O1+ve ©6442 Ms+d = @ 8-307 2. Simllty: Toss + cad ~ Jaca : Miscellaneous Examples Example 26 : Find the largest oumber which leaves remsioders 4 and 6 respectively when it divides 220 and 186. Solution : Given condition implies 220 = dg, + 4, 186 = dy, + 6 for some integers g, and 4. For required divisor d, 220 — 4 ~ 216 and 186 — 6 ~ 180 must be divisible by the required divisor d. Since we require the largest divisor, wo must find g.cd. of 216 and 180. Now, 216 = 2? x 3? 180 = 22x 32x 5 2 Bead 216, 180) = 2 x 3? = 36 36 is the largest number dividing 220 and 186 and leaving remainders 4 and 6 respectively. Example 27 : It ia required to fit square granite tiles for the flooring of a room of size 20m X 6m. Find the length of the each square tile and the number of square tiles required. Solution : We want to divide the length and breadth of the room auch that each is a multiple of the length of a tle. Thus we require gcd. (20, 6). 20= 225 and 6=2%3 2. ge (20, 6) = 2 So each granite tle must bo a square of sizo 2m. Area of room = 120m? Area of each tile = 4m? +The mamber of ties reuied = UD = 30 10 X 3 = 30 tiles (Note ; Infact we should arrange so that we fit 22 = 10 tiles along the length and £ = 3 tiles ‘along the breadth. Otherwise the tiles would have to be broken] Example 28 : What is the smallest number which when divided by 20, 30 and 40 leaves a remainder 5? Solntion : The number m must be of the form m = 20g, + 5, m = 30g, +5, m= 40g, +5 Eveuo's Avconrrant avn Reat NUMaEns ey——__ OO s+ m= 5 must be a multiple of 20, 30 and 40. ‘We require the smallest multiple i.e. Lem of 20, 30 and 40. 20 = 22 x 5,30 2X3 5, 40 = 29x 5 2. Lem, (20, 30, 40) = 23 x3 x 5 = 120 so m=5=120 ‘The required number is 125. ‘Example 29 : Find the smallest number which is a multiple of all natural numbers from 2 to 10 (both inclusive). Solution : The natural numbers from 2 to 10 are 2, 3, 4, 5, 6, 7, 8,9, 10 2|4 and 4|8 and 5| 10 and 36 and 319. So may consider Lem of 6, 7, 8, 9, 10 only. ‘Any multiple of 6 and 8 is a multiple of 24 (their Lem.) we may consider Lem, of 7, 9, 10, 24. Similarly 9 and 24 can be replaced by 72. We require Loam, of 7, 10, 72 Now, 7= 71, 10 = 2+5, 72= 23 x 3? Le.m{7, 10, 72) = 23 x3? X57 ‘The required number is 2520. ‘Example 30 : There is a circular path in a sports ground. Rucha takes 15 minutes to complete one round of the ring and Dev takes 20 minutes for the same, If they start running at the same initial point in the same direction at 8 A.M. when will they meet again for the first time ? How many rounds will be taken by cach of them ? Solution : Suppose Rucha takes m rounds and Dev takes » rounds before they meet. Then the time elapsed (in minutes) is 15m = 20n + We want the least common multiple of 15 and 20 for meeting again for the first time. Now 15=3+5 20= 2265 Lem(I5, 20) = 22 x 3 x 5 = 60 minutes They will meet again at 9 A.M. Rucha will have completed {2 = 4 rounds and Dev would have completed $2 = 3 rounds by then. Example 31 : Prove that fn+i + yn=T is not rational for any n € N. Solution ; Let a= Ym + Yn=T be rational. a~ fmt ~ fet we @—2afnat tn-1snt1 we Qafn=1 = a? -2 is rational. (as a is rational) Similarly, fn+T E22 is ration eet ey Maranvexrics 10—— OT Let fav =p, yn—1 = 4g. Then p and g are integers as m € N and p and g are rational. n+1=prandn—1=@ o Pu-Pa2 5 @+De-H=2 ‘The only factors of 2 are 2 and 1. s. ptq=2andp—q=1 Since p - q # 0, p and q are distinct postive integers. Minimum value of p + q is 2+ 1 = 3 and p+q #2. Yard + JamT is not rational for n © N. ‘Example 32 : Is following true ? ged. (a, B) = 32, Lem (a, b) = 48 Solution : No, as g.c.d. (a, b) always divides Lem. (a, b). But 32 does not divide 48. This is not true. Find ged. and Lem. (1 to 10) : 1, 25,35 2,105,125 3.220, 132 4.3125, 625 5. 15625, 35 6, 15,25,35 7.18, 12,16 8.16, 24,36 9.35, 28, 63 10, 112, 128, 144 Prove following numbers are irrational, (11 to 20) uw. V34+V5 12 sv 3. T+ 8 15.2 +1 16. 10V2 +7¥3 17. V5 —V2 18. V2 19. Vi 20. S37 Which of the following numbers bave terminating decimal expansion and why ? (21 to 25) a. 2, HS 23, 2 24, 2s, Find the square root of the following in the form of a binomial surd (26 to 30) : 26.124 298 27,8427 28.24 2N5 29.14 +6¥5 30.n+ Yr? Simplify (31 to 32) : 3. Gig twit 2 2. oe 5 33. Find the largest number dividing 230 and 142 and leaving remainders 5 and 7 respectively. 34, Find the langest number dividing 110, 62, 92 and leaving remainders 5, 6 and 1 respectively. 35. The length and the breadth and the height of a room are 735 cm, 625 cm and 415 cm. Find the length of the largest scale measuring instrument which can measure all the three inenen [EUCLID'S ALGORTTIOM AND REAL NUMBERS——__ OO 36. A milk man has 150 litres of milk of higher fat and 240 litres of milk of lower fat. He wants to pack the milk in tins of equal capacity. What should be the capacity of each tin 2 37. Find the smallest number which decreased by 15 is a multiple of 125 and 225 38. Find the smallest number of six digits divisible by 18, 24 and 30 39. Prove if 3|(a? + 6?) then 3|a and 3|b,a€ N,bEN. 40. Prove nf +4 is a composite mumber for m > 1 41, Tn-a morning walk a man, a woman and a child step off together. Their steps measure 90 cm, 80 cm and 60 cm. What is the minimum distance each should walk to cover the distance in complete steps ? 42, Find the number nearest to 24001 and between 24001 and 25000 divisible by 16, 24, 40 43. Select proper option (a), (b), (¢) oF (d) from given options and write in the box given ‘on the right so that the statement becomes correct (1) Product of any four consecutive positive integers is divisible by .... « oOo (@) 16 4s om @2 @ Vo +3 is oO (@) rational () rational but not integer. (c) nonrecurring decimal (@) integer (3) If g.cd of two numbers is 8 and their product is 384, then their Lem is ...... oO m4 (16 48 (32 (4) If Lem. of two numbers (greater than 1) is the product of them, then their g.cd is . oO @1 2 (©) one of the numbers (4) a prime () If p; and py are distinct primes, their gad. is... oOo @r (b) py ©) Ppr @I (© If p, q, r are distinct primes, their Lem. is o @) par © pa 1 O pat art per (7) ged (15, 24, 40) = oo @ 40 Ol ou (@ 15x24 x40 (8) Lem, (15, 24, 40) = oOo @1 () 15x 24x40 (©) 120 (60 (9) 0.02222... is aan - oO (@) rational number (b) integer (©) irrational number (@ 2210 aoy3+v5 = Oo @ +i ) 5 +1 oo (@) does not exist x ‘Macrnenarics 10————— anion Oo (a) does not exist as a real number (b) does not exist as a binomial surd © i + Vat @ Jia - (12)g.e.d, (136, 221, 391) oOo (a) 136 (b) 17 (©) 221 (d) 391 (13)Lem. (136, 221, 391) = oO (@) 40664 (b) 136 x 221 x 391 (©) g.c.d(136, 221, 391) (d) 136 x 221 (1A)If ged, (a, b) = 8, Lem. (a, b) = 64 and a > b then a = ..... @ 64 ws © 16 @32 (15)If gcd. (a, b) = 1, then ged. (a — b, a+ 6) = o (@ 1or2 (b) aor b (@atbora-b 4 (Of n> 1, nh +4 is neNn oOo () @ prime (b) « composite integer ©! (@ infinite (IDE ged. (a, 6) = 18, Lem, (a, BY # ou. oO (a) 36 (b) 72 © 48 (d) 108, (28)HF has .... digits after decimal point, Oo @s 4 ©3 @2 (19)the decimal expansion of 2537 will terminate after ... digits. o @4 ws ©3 @6 (20)5" (n € N) ends with .... Oo @o ws ©25 @10 (21)2"5" (m, n © N) ends with o @o 5 (©) 25 (d) 125 (22) 3105 represents . oO (a) a terminating decimal (b) a non recurring decimal (©) a recurring decimal (@) an integer (23){Sk +1)? leaves remainder... on dividing by 5. oO (a2 bo ©-lorl @1 (24)0n division by 6, a® cannot leave remainder ...... . (@.€ N) o @1 4 5 @3 (25)Product of three consecutive integers is divisible by .. (24 () 8 but not by 24 (©) 6 2 * Eucun's Auconrrist ano Real. NuMMERs 27a aa ‘gb 4 5. 6 In this chapter we have studied following points : Division algorithm ; If a, b are positive integers, there exist unique integers g and r such that a= bg +7, 0Sr, Tr-1~ TInt Bed, (a, 5) = 7 Also Lem. (a, 5) ged (a, b) = ab Fundamental theorem of Arithmetic : If n > 1 is a positive integer, Pek where Py» PrnPy are prime divisors of m and a; € N. n= ptt pe This representation is unique. Irrational numbers. Decimal Expansions. Surds and their square roots. Ya+2vb = Vx + Jy, ifa e Qt and a? — 4b is the square of a rational number. Vb is a surd, 5- SHOR, af w, Z i Alsoit fav 2ve = vx + Jy, (>), then \a-2b = Ve - 7 Five Pirates and a monkey are shipwrecked on an island. The pirates have collected a number ‘of coconuts which they plan to divide the next morning. Not trusting others, one pirate ‘wakes up during the night and divides the coconuts into five equal parts and one is left which he gives to the monkey. He hides his portion. During the night each of the five pirates does the same thing equally dividing coconuts in five equal parts, giving one left one to the monkey ‘and hiding his share. In the morning they all wake up and divide them equally and one is left ‘over and given to the monkey. What is the smallest number of coconuts they could have collected for their original pile ? 28 Marissexrics 10——___ = Let the number of coconuts be n. Then after the first pirate divides in five parts and one ‘coconut remains, n = Sa + 1. Here a is the part taken by pirate 1, Now 4a coconuts remain. $a +1 — 1 (monkey) — a(Pirate 1). c+ As before 4a = 5b + 1, where 6 is the part taken by pirate 2. Similarly 44 = Sc + 1, c is the part taken by pirate 3. 4c = Sd+ 1, dis the part taken by pirate 4, 4d = Se + 1, e is the part taken by pirate 5. In the end 4e = 5f+ 1, where 1 coconut is given to the monkey and f is the equal part taken by each pirate, Hence n= Sa +1, 4a = 5b +1, 40= Se +1, 4e=5Sd4+1, 4d = Se +1, 4e= 5/41. ares terme asics o (4) = 25f+ 9, giving us 64c = 125+ 61. de = Sd+1) ” oo 2) = s+ 01 (40 = 5c +1) 256 = 625f-+ 369 = 625f + 369 Continuing finally 1024a~3125f= 2101 0 Now, 3125 = 1024-3 + 53 1024 = 53-19 +17 53= 17-342 17=2-841 7 = 2-8 = 17 ~ 8 (53 — 17-3) = 25-17 8-53 = 25(1024 — 53-19) ~ 8-53 = 25 + 1024 — 483 +53 = 25 - 1024 — 4833125 — 1024-3) 1 = 1474. 1024 ~ 483 3125 1474-2101 - 1024 — 483 -2101 - 3125 = 2101 Solution of (i) is a = 1474-2101, b= 483-2101 or a= 1474-2101 —3125¢ teN = 3096874 — 31251 £=990 gives the smallest a = 3096874 — 3093750 = 3124 a= 3124, Hence n = Sa+ 1 = 15621 Original pile contained 15621 coconuts. (We can see a = 3124, b = 2499, ¢ = 1999, d= 1599, ¢ = 1279, f= 1023 each pirate had respectively 3124 + 1023, 2499 + 1023, 1999 + 3123, 1599 + 1023, 1279 + 1023 coconuts. They got 4147, 3522, 3022, 2622, 2302 cocontus and the monkey got 6 coconuts ‘otallying to 15621. Bucu's Auconrruve axo Reat, Numpens. 29