syratt aeeett Raateioustet woI—sais ‘mame 1211/415/9, dl. 12-1-2012 alge MATHEMATICS Standard 10 @ PLepcE India is my country. All Indians are my brothers and sisters. I love my country and I am proud of its rich and varied heritage. I shall always strive to be worthy of it. I shall respect my parents, teachers and all my elders and teat everyone with courtesy. T pledge my devotion to my country and its people. ‘My happiness lies in their well-being and prosperity. Gujarat State Board of School Textbooks A ‘Vidyayan', Sector 10-A, Gandhinagar-382 010——__- = —— Authors Dr A. P. Shah (Convener) Shri Rajiv S. Choksi Shri Jaykrishna N. Bhatt Shri P. K. Vyas Shri Shailesh Sheth Shri Mrugesh Parekh Shri Sarju B. Nayar Shri Pinkesh D. Naik Language Reviewer Shri Rishi A. Thakar Artist Shri Manish P. Parekh Co-ordinator Shri Ashish H. Borisagar (Subject Co-ordinator : Mathematics) Preparation and Planning Shri Haresh S. Limbachiya (Dy. Director : Academic) Lay-out and Planning Shri Haresh S. Limbachiya (Dy, Director : Production) PREFACE The Gujarat State Secondary and Higher Secondary Education Board has prepared new syllabi in accordance with the new national syllabi prepared by the N.C.E.R.T, These syllabi are sanctioned by the Government of Gujarat, Its pleasure of the Gujarat State Board of School ‘Textbooks, to prepare and publish this textbook of Mathematics for Standard 10 based on the new syllabus. Before publishing the textbook, its ‘manuscript has been fully reviewed by experts and teachers teaching at this level. We have followed suggestions given by teachers and experts and made necessary changes in the manuscript. The Board has taken special care to see that this textbook is interesting, useful and free from errors. However, we welcome the suggestions, ifany to improve the quality of the textbook. Dr. Bharat Pandit Dr Nitin Pethani ; Executive President Director Gandhinagar Date :3-3-2015It shall be the duty of every citizen of India (A) 8) oO © ® @ © @ “w to abide by the Constitution and respect its ideals and institutions, the National Flag and the National Anthem; to cherish and follow the noble ideals which inspired our national struggle for freedom; to uphold and protect the sovereignty, unity and integrity of India; to defend the country and render national service when called upon to do so; to promote harmony and the spirit of common brotherhood amongst all the people of India transcending religious, linguistic and regional or sectional diversities; to renounce practices derogatory to the dignity of women; to value and preserve the rich heritage of our composite culture; to protect and improve the natural environment including forests, lakes, rivers and wild life, and to have compassion for living creatures; to develop the scientific temper, humanism and the spirit of inquiry and reform; to safeguard public property and to abjure violence; to strive towards excellence in all spheres of individual and collective activity so that the nation constantly rises to higher levels of endeavour and achievement; to provide opportunities for education by the parent or the guardian, to his child or a ward between the age of 6-14 years as the case may be.——__ — ———_——— NEXT 1. Euclid’s Algorithm and Real Numbers 1 2. Polynomials 30 3. Pair of Linear Equations in Two Variables 52 4. Quadratic Equations n 5. Arithmetic Progression 92 6. Similarity of Triangles 113 7. Similarity and the Theorem of Pythagoras 144 8. Coordinate Geometry 161 9. Trigonometry 182 10. Heightsand Distances 209 1. Circles 223 12. Constructions 236 13. Areas Related to a Circle 245 14. Surface Areas and Volumes 237 15. Statistics 23 16. Probability 296 © Answers 305 © Terminology (In Gujarati) 314——__ — ———_——— About This Textbook With the intention that a student of Gujarat can consolidate his position at national level in present times, Gujarat Secondary and Higher Secondary Education Board has prepared a new syllabus equivalent to NCERT syllabus with the help of experts at school, college and university level. ‘To prepare a textbook keeping in view NCF 2005, a committee of experts was formed. In the sequence of textbook of both semesters of standard IX, we are happy to prepare and publish a textbook for standard X. As earlier, this textbook was first prepared in English. It was prepared according to the syllabus prescribed by Gujarat Secondary and Higher Secondary Board and Gujarat State Textbook Board. The manuscript was reviewed in the end of August by experts from various schools, college and university in a workshop. Keeping in view the suggestions, amendments were made in the manuscript. Then in the end of September the Gujarati translation of the English version was reviewed by a panel of expert school teachers and college teachers. Then the final draft was prepared. This was reviewed again in the office of Gujarat Secondary and Higher Secondary Board by a panel of experts and authors. Chapter 1 deals with Euclid’s algorithm to find g.c.d. of two integers, their Le.m., decimal presentation of numbers, irrational numbers according to NCERT syllabus. ‘A small section on surd is useful in trigonometry in std. 11, In chapter 2 we discuss polynomials and their zeros. In chapter 3, we discuss solution of a pair of linear equations and its applications. We explain both algebraic and graphical methods. Chapter 4 deals with quadratic equations and their practical applications. We give some information on Arithmetic progression in chapter 5. Chapter 6 and 7 deal with geometry using the concept of the set theory as in standard 9. In chapter 8, we begin with study of elementary co-ordinate geomerty. In chapter 9 and 10, we begin with the study of trigonometry and its applications using a right angled triangle. Chapter 11 gives information on areas of a circle, a segment and a circle. Chapter 12 is about some constructions using straightedge and compass only. Chapter 13 and 14 are about areas and volumes of solid figures. Chapter 15 and 16 are about statistics and probability. Attractive printing in four colours, variety of illustractions and exercises and information about Indian mathematicians add to the usefulness of the book. We have tried to give enough information so that a student can study by himself too. Variety of illustrations explains diversity of questions and train a student on how to approach a problem. Vv‘The aim of this textbook is that a student of Gujarat can study national level syllabus interestingly and without any burden and place himself on national map. ‘At the ond, we oxpresa our thanks to all who gave kind co-operation in preparing this textbook. We hope that students and teachers all would like the textbook. To enhance the quality of the textbook your valuable suggestions are welcome. —Anthors e Bors 22 December, 1887 rode, Madras Presidency Died 26 April, 1920 (aged 32) Chetput, Madras, Madras Prosidoary Nationality India ious Mathamatios ‘Alma mater ‘Goverment Arts College Pachaiyappe's College ‘The University of Cambridge ‘iron Res fe Academic advisors G H. Hardy J.B, Littlewood Known for Lands-Ramansjan constant Cowra Vii Mee ten Reet Ans declared to Ramanujan conjectore capri ine Joa amma et 2012 00 ‘a year of Remunyjar-oldner constant patemeacn Ramanujan thoia function ell eae, ae a Remanojan on bie Rogera-Remanujan identities {ash Marte, Influences GH. Hardy——___- = =—— Eucuw'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 10 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 Apolionius, two of the greatest men produced by the antiquity. = Piere Simon Laplace 1.1 Introduetion Jn 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 () Given integers 2 and 5, 5 # 0, there exist unique integers q and r such that a=bg+r0Sr<|bh This applies to division process in all integers with the condition that b # 0. a is called the dividend, 5 is called the divisor, q is called the quotient and ris called the remainder. (2) Generally we use the following form of division algorithm; also called Euclid's division Lemma. Given positive integers a and b, there exist unique non-negative integers q and r such that a= bg +1, 057 < 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 —L|b| 3, nor n + 1 is even, they being consecutive integers. sD divides nv + Qn + 1) Also, n= 3k or 3k-+ 1 or 3k +2 for some ke N (ih m= 3k, n(n + 12m + 1) = 3KGK + 16K + 1) is divisible by 3 (i) m= 3k + 1 mn + NQn+ 1) = B+ NGE + 26K + 3) = 3GK-+ IGE + 2\2K + 1) is divisible by 3 Gi) m= 3k +2, n(n + 1) Qn +1) = Gk + 2KGK + 3Y6K + 5) = 3Gk + 2k + 1)G6K + 5) is divisible by 3 c+ Im any case 2 and 3 divide n(n + 1)@n + 1) c+ n(n + Qn + 1) is divisible by 6 as 2 and 3 have no common factor. ly n(n + 1)(2n + 1) = 6 oF 30 is “Note : For a 6 € N, if @ and have no common factor and if an, b| then ab|n; n € N} Example 5 : Prove that if m is an even positive integer, then 3” + 1 is di ible by 2 and not by 2" for m 2 2, m € N, If m is an odd positive integer, then 3" + 1 is divisible by 4 and not by 2” for m 2 3, mE N. (Use the fact that square of an odd integer is of form 8k + 1.) Solution : If m is even, say m = 2k, then 3” = 3% = (34? = 8a + 1 (G* is odd) S41 = 8a42= 240+ 1) s+ 2 divides 3" + 1 and 4a-+ 1 is odd. Therefore 2", does not divide 3" + 1 for m2 2, me N. If nis odd, say n = 2k+ 1, Then +1 = 3+ 1 = 3.9741 = 38a +1 @ is odd) = 24a +4 = 46a +1) ce 4 divides 3" + 1 and 2", m € N, m2 3 does not divide 3” + 1 as 6a +1 is odd. Prove that 16 divides nt + 4n? + 11, if m is an odd integer. Prove that if m is a positive even integer, then 24 divides n(n + 1X + 2). Prove that if either of 2a + 3b and 9a + 5 is divisible by 17, so is the other. a 6 € N (Hint : 42a + 36) + 9a-+ 5b = 17a + 178) Prove that every natural number can be written in the form 5k or Sk + 1 or Sk +2, kE NU {0}. ‘Mariemarics 10——___- = —— 5. Prove that if 6 has no common factor with mn, n? — 1 is divisible by 6. 6. Prove that product of four consecutive positive integers is divisible by 24. 13 Eueli algorithm We have studied division algorithm also called Euclid’s division lemma. Its most important application is to find g.c.d. (Greatest Common Divisor) of two positive integers. As such, we know about g.c.d. 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 Brahmasphuta 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 happened 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 m ~ 1 is a multiple of 2, 3, 4, 5 and 6. <. n—1 is a multiple of 60 am. of 2, 3, 4, 5 and 6) + n could be 61, 121, 181, 241, 301 etc. 7 divides 301 out of them. 301 is the smallest number of eggs the old woman had. Lom. and ged. are co-telated concepts. Definition : If for a positive integer a, there exists a positive integer 6 such that a = bc for some positive integer c, then we say positive integer is a factor of a or divisor of a. ince c > 1, a > b or in other words 6 < a. If b is not a factor of a, we We write b|a. write bf a. If @ and 6 are positive integers and if c divides a and ¢ divides 6, we say ¢ is a common divisor of a and 6. Since ¢ S a and c <6 and the number of positive integers less than @ and 5 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.c.d. of a and b im short. So if dis a g.c.d. of @and 5, then (dla and d|6 (da means d divides a) Gi) If cla and c[b, then c < d (d is the greatest common divisor of a and } or it can be proved that (ii) is equivalent to (ii). Hela and c|b, then ¢| d. vcu's ALGonrTiim ano REAL NUMBERS——__ — ———_——— ‘Now how to find g.cd. of two positive integers a and b ? The procedure is known as Euclid’s algorithm. ‘The algorithm runs as follows : Let a and 5 be positive integers with a > b. (any harm if a < b 2) Divide a by & and continue the iterative division as shown : a= bag + rp OS 1) Proof : Let a = p,% p,%2 .... p,2k be prime factorisation of a, where p; are distinct primes and a; € N. fe = BA 2 oe DEA) DM Pat me BEA) = pm 20 PPM Pp oe PME Now pla. PIP 2M p22? one Pee “. pis one of the primes in the prime factorization of a?. By uniqueness part of fundamental theorem of arithmetic p = p; for some i. Se PLB A Pye oom Biot * pla ‘Lemma 2 : If m is the least positive divisor of a, then m S va, a € N. Proof: Leta=mn omneN Since m is the least positive divisor and n is also a divisor of a, m Sn om Sim mse ems da ‘This result is a mild test to determine whether given number is a prime or not. Suppose we ‘want to factorise 257. Its earliest prime factor should be less than 257 i. 16. We check whether 2, 3, 5, 7, 11 or 13 divide 257 or not. Obviously none of them divides 257. 2. 257 is a prime. (Note : In fact 257 = 2” + 1 is a Fermat prime and regular 257 - gon be constructed using straight-edge and compass only. Guass requested that after his death heptadecagon (17 sides, 2° + '7) be inscribed on his tomb ! But the storeman declined saying that it would look almost like a circle.) 18——__ — ———_——— Example 16 : Prove that J2 is irrational. Solution : If possible, let YZ be rational. Let J2 = ¢ where g.ccd{a, b) = I,a€ N,bEN 2. eae 0 “ 2|a o Qa Let a= 2a; say, a, € N (using () @ = 2p b= 2b, say, by EN c. 2a and 2|6 But gcd. (a, 6) =1 + We come to a contradiction «+ ¥2 is irrational, Lemma 3 : If p is prime, yp is irrational. Proof :Let if possible Jp 4, ged. @,b)=1,aeNbEN P= phe ) pla * pla Let a= pm,meN 2 @=pPre ce Pm? = pb (using (9) = pm ple plo Pla and p|b But gcd. (a, 6) = 1 ‘We come to a contradiction vp is irrational. Example 17 : Prove that 5+ 2V7 is irrational Solution : Let m= 5 + 2¥7 be rational, if possible. m~5= 207 is rational. mos = V7 is rational. ‘Maruemarics 10——__ — ———_———— But V7 js irrational. (emma 3) 2. 5+ 2V7 is irrational Example 18 : Prove that 72 is irrational Solution : ¥72 = (36-2 = 6/2 If 6JZ = mis rational, so is = Y2. But J7 is irrational o. TZ is irrational, Example 19 ; Prove ¥3 + J2 is irrational, Solution : Let x = J3 + JZ be rational. oe 2 =34+24 296 is rational. If possible let J6 = $, where g.c.d. (a, 6) = 1, 2 P= 6b = 2-362 oe o 2a o 2|36? Also g.cd. 3, 2) 2 ob 2a and 2|6 +. Acontradiction results. 2.6 is irrational. x= V3 + YZ is inrational. Another Method : Let x = ¥3 + J2 be rational. (@ — 2) = 3 is rational. ce a? = 24Ty+ 2 =3 is rational os AB = 25 is rational. But ¥2 is irrational. 2. x= M3 + V2 is irrational. Eucuo's Auconrri AND REAL Nuwaens——___ “= 1. Express as a product of primes : (2) 7007 (2) 7500 (3) LO1a1 (4) 15422 2. Find g.c.d. and Lc. using the fundamental theorem of arithmetic : (1) 250 and 336 (2) 4000 and 25 (3) 225 and 145 (4) 175 and 1001 3. Find g.cd. and Le.m. : (1) 15, 21, 35 (2) 40, 60, 80 (3) 49, 42, 91 4, Prove that following numbers are irrational OB OVE OHO 407 52 ‘S. Find Lem. (105, 91) using g.c.d. (a, 6) Lem. (a, 6) = ab 6. Prove J3 + J2 + 1 is irrational. 7. Using (V7 + J3\V7 — J3) = 4 and the fact that (V7 + J/3) is irrational prove that V7 — JZ is irrational. 8. Two buses start from the same spot for the same circular root. One is a BRTS bus retuming in 35 minutes. The other is a regular express bus taking 42 minutes to retum, After how many ‘minutes will they meet again at the same initial spot ? * 1.6 Presentation of Rational Numbers in decimal system Last year, we have studied representation of rational numbers in decimal system. We know that their decimal expansion is either terminating or non-terminating recurring. Let us examine the question more closely. 1.05 = 405 = 31, 3.008 = 208 = 376, 2.003 = 2003 If a rational number has a terminating decimal expansion, it should be like aaa, a3. ay where a is an integer and aj, d,..d4 are digits (0,1, 2,...0F 9) after decimal point. (a could be negative. But it does not affect the discussion). So we assume that a is positive like in 3225.47891. a= 3225, a, = 4, ay = 7, a= 8, a= 9, ag So we could write Ha 1a a, A Agdy = 0+ Oaydyn ay = a+ AEE = g 4 AA ‘After removing common factors, we can write a.aya,..0, = a +“ where g.cd(m, n) = 1 and n= 2P59 where p and q are non-negative integers not exceeding k. ‘Thus we have the following theorem. Theorem 1.2 : If a rational number a has a terminating decimal expansion, we can write a= = where ged (p, g) = 1 and q = 2"5" for some non-negative integers m and n. Let us consider the converse situation. Let a= 8 Marnemarics 10P P =—2__.__pP_, Let m n, a= 2 If m= n, obviously a = ram Hence we have the following theorem Theorem 1.3 : If a rational number is of the form a= l= for non negative integers m and n, then @ 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, m. + = 0.142857 is a rational number with a non-terminating recurring decimal expansion. ‘Theorem 1.5 : A rational number a = a has a non-terminating recurring decimal expansion ‘if and only if q is mot of the form 2"5" m,n € N U {0} or im other words g.c.d. (p, q)=1 and q has at least one more prime factor other than 2 or 5. ‘Example 20 : Decide if the following rational numbers have terminating decimal expansion or not and if it has, find it: @) 22 @) He @ Bw Solution : (2) BZ = 328 Here 125 = 53 = 53-20 and g.c.d. (337, 125) = 1 + 33E has a terminating decimal expansion. 1 @ a9 = Hr Here, 54+2! is of the form 25" and g.cd(I1, 1250) Ue? tL -L? we aso Fez Fah * Tones = 0.0088 c+ Gly has a terminating decimal expansion. 2 @ 8-8 Here, g.cad. (12, 35) = 1 and 35 = 5-7 has a prime factor 7 other than 2 or 5. 32 does not have a terminating decimal expansion. 's ALGORITHM AND ReAL. NUMBERS 19——__eSEe 1, State whether following rational numbers have terminating decimal expansion or not and if it has terminating decimal expansion, find it Oe Om Oas ® Tes Om Om OF oz Oe (0) ae 2. Following real numbers are expressed in decimal form. Find whether they are rational or not, If rational, express them in the form ©. Comment on factors of q: (1) 0.0100100010000: . (2) 3. 456789123. (3) 5.123456789 (4) 0.090909... = 0.99 (5) 2312 (6) 0.142857 (7) 0.9999. 05 (8) 5.781 (9) 2.312 (10) 0.12345 1.7 Surds ‘Now we will study some special type of irrational numbers like J2, J3, V3 +¥2. They are called surds If a is a positive rational number, n € N, m #1 and if Ya ¢ Qt, then we say that Ya isa surd. S02 Q*and v2 € Qt Hence J is asund. 3 € Q*. But fF € Qt. Thus ff is a surd. we B= 4 si mo _ fer _ i - We write 3 = 4/3. simitary (= Gar 7 TVS. So we consider Ya = mY where me Qt, b © N and m © N — {1}. Hence we will think of surds Yq 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 ¥i2 = 2¥3, J48 = 4V3, J72 = 6V/2. Hence we can write Ja = b¥c where c is a square free number i.e. c has no factor p® where p is a prime. Surds like JI2 = 203, J48 = 4¥3 are called like surds. So if the square free part ve is same, then be and dVe are like surds, Surds like V2 = 2¥3, ¥72 = 6V2 are called unlike surds. If the square free parts of AP and V4 are different, then VP and V4 are unlike surds. Like surds can be added as 12 + ¥48 = 2V3 + 4¥3= 6¥3. V3, V5, 5VZare called monomial surds. V3 + J2, V5 + 1, ¥3 —2 ete. are called binomial surds. If product of two binomial surds is a rational number, they are called rationalising factors of each other. J3 + V2 and V3 — v2 are ‘conjugate surds’. Ja + Jb and Ja — Vb are, in general, conjugate surds of each other. Multiplication of conjugate binomial quadratic surds results into a rational number. 20 Mariemarics 10——__ — ——_———— Note :2 + V3 and 2 — ¥3 are conjugate quadratic surds of each other as well as rationalising factor of each other. But 3 + ¥2 and 15 — 5¥2 are rationalising factors of each other, but not the conjugate surds of each other. (Wa + Soya - Vo) = We will use some results about surds Result 1: If a+ Vb = Ve where a € Qand Yb and yc are surds, then Result 2: Ifa + Vb = + vd where a, ¢ © Q, Vb, Vd are surds, then Note : It is necessary that Jb, Vd are surds ic. irrational. 34+ V5 = 1+ JH but 3 #1, 25449 Square root of a surd : (V3 + J2°=3 +26 +2=5 +4206 So we can write 5426 = V3 + V2. Here we say that a square root of binomial surd 5 + 2V6 is 3 + v2. We accept following results : Result 3: In order that ya+2vp = Vx + Jy where x,y € Q*, vb isa surd is that a € Q* and a? — 45 is the square of a rational number. In ctx = SEES, y of o So that x + y =a and xy = 6 ‘Hence there are two approaches to find ya+2vb. Find integers x and y such that x + y = a, 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.) -6 =O and b=c. ob=d. ut farodb = Vi + Yy, then Ja-20b = vz - Vy @>y) Example 21: Find 46+2V5 Solution ¢ Let us try to find positive integers x, y such that x + y = 6, xy Obviously x= 5, y= 1 Yorwds = 5+ i= +1 Another method : a at ia —a z y ane for2ds = B +1 Example 22 : Find (2—¥3 Solution : {2-03 = ize Eucun's Auconrri AND REAL Nuwaens 21———_—_— OO We find 7-212 Now, x+y =7, xy = 12 fe ore4ysd ey Example 23 : Find 24-43. Solution : 2403 = sad - es Now concentrate on [4+2¥5 xty=4ya3 6 ore3yel . G1 Gini hr veel ==“ Remember : (1) Generally we do not keep Vm in the denominator and so, we rationalise by multiplying and dividing it by vm. (2) To find the square root, the form should be a + 2vb If there is a factor other than 2 multiplying vb , then keep only 2 as multiplier of Vb. As for example, 4¥3 = 2v12, 143 = 24147 (3) If there is no 2 as multiplier of Jb bring it as follows. J6 = 32/6 = F2-V6) Also write like ¥i2 = 2J3 and J72 = 218. In other words bring the binomial surd whose square root is to be found out to the form a +2 Jb where a and b are positive integers. +: Simplify = + 1 + 1 L Example 24 : Simplify Lo + Joe + ole tot ES Gi « Wei G-8 vn-yn-i Solution + Given expression = (Er nef + Wie dasa) tt nt n= ida — Jn = VBA t B= VB + EAB He tn = fd -W-1 amity 1 imply eras * evade Solution Tae + he = vo-ws * f5+2v6 Example 2 “Manienarics 10—— SED (3-42) e-es +n tis as #6414G-8 =1- 42439 + 45 1. Find the square roots of following exrda : Mstwe mete o1- 3 Oat fe? O48 |6+42 Osea @e-3d7 >, % Simply: nas * fenzas faa * ‘Miscellancosa Examples Example 26 : Fad the largest number which lewves remainders 4 and 6 rerpectively when it divides 220 and 165, Solntion : Given condition implies 220 = dg, + 4, 186 = dg, + 6 for some integers g, and g3. For required divisor d, 220 — 4 = 216 and 186 — 6 = 180 nust be divisible by the required divisor d. Since we require the largest divisor, we must find g.cd. of 216 and 180, Now, 216 = 25 x 3? Wo 2x RX ged Q16, 180) = 22 x 32 = 36 36 is the largest number dividing 220 and 186 and leaving remainders 4 and 6 respectively. ‘Example 27 + Ht is required to fit square granite tiles for the flooring of a room of size 20" X 68. FFind the length of the each equare tile and the mumber of square tiles required, Salton : We want to divide the length and breadth of the room such that each is « multiple of the Hengit of w tile, Thus we require gece (20, 6), 20=2Xx 5 md6=2K9 ped (20, = 2 So och granite tile aust be a square of size 2m. Area of room — 120m, ‘Area of oash tilo = 4m? 1 41, Ina morning walk a man, a woman and a child step off together. Their steps measure 90 cm, 80 cm and 60 em. 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 a proper option (a), (b), (c) or (d) from given options and write in the box given fon the right so that the statement becomes correct = (1) Product of any four consecutive positive integers is divisible by .... - oO @ 16 (48, ou @32 2) 4 +358 oO (@) irrational (b) rational but not integer. (© nonrecurring decimal @ integer (3) If g.cd. of two numbers is 8 and their product is 384, then their Loum. is. oO (a) 24 () 16 O48 (2 (4) If Lem. of two numbers (greater than 1) is the product of them, then their g.c.d is comes oO @t (2 (©) one of the numbers (d) a prime (5) If p, and p, are distinct primes, their g.6.d. 18 anu « Oo @r © p © Pp @1 (© If p, q, r are distinct primes, their Lem. is oO @ par ©) pg ol © pat art pr (7) ged. (15, 24, 40) o @ 40 On ou (@ 15x24 x40 (8) Lem. (15, 24, 40) = oO f@t (b) 15 x 24x 40 (c) 120 @ 60 (9) 0.02222... is a .. oO (a) rational number () integer © inrational number @ zer0 OS 405 =... oO @8+2 w+ of (@) does not exist ‘Mariemarics 10——_- = —— (no viat oO (a) does not exist as a real number (b) does not exist as a binomial surd © V9 + Jat @ vin - 9 (12)geecd. (136, 221, 391) = vow o @ 136 17 ©2I x (13)Lem. (136, 221, 391) = ... o (a) 40664 (b) 136 x 221 x 391 (©) g-c-d.(136, 221, 391) (@) 136 x 221 (LAME ged. (a, 6) = 8, Lem, (a, b) = 64 and a > b then a = o @ 64 Oy © 16 @2 (AS)If g.cd. (a, 6) = 1, then gcd. (a — b, a + b) =... oO (@) lor2 (b) aor b ()atbora—b (d)4 (Ol n> nh t4is ume N Oo (a) a prime (b) a composite integer @l (@ infinite (INE ged. (a, ) = 18, Lem. (a,b) # oes oO @ 36 won ©48 (@ 108 (28) has wun. digits after decimal point oOo @s5 (o) 4 ©3 @2 (19)The decimal expansion of 2517 will terminate after oO @4 On ©3 ws (20)5" (n © N) ends with o @o (b) 5 © 25 @10 (21)2"5" (m, n © N) ends with oO @o Oy © 2s (@ 125 (22) FUE represents .. o (a) a terminating decimal (b) a non recurring decimal (© 4 reourring decimal @ an integer (23)(5k +1)? leaves remainder ...... on dividing by 5. o @2 wo ©-lor! @1 (24)0n division by 6, a* cannot leave remainder (@eN) oOo @l w4 os @3 (25)Product of three consecutive integers is divisible by ...... . o @r (b) 8 but not by 24 (6) 6 @2 * Eucu’s AuconrTist aND Reat. NUMBERS. 27S. Csemer) In this chapter we have studied following points : Division algorithm : If a, 6 are positive integers, there exist unique integers q and r such that a= bg +7, 0S7r 1 is a positive integer, wo 191 Py vee PySk Where Py» Ppy-Py are prime divisors of m and a, € N. This representation is unique. Irrational numbers. ‘Decimal Expansions. Surds and their square roots. Ya+2¥b = Ve + Jy, fae Q* and a? — 40 is the square of a rational number. /b is a surd po SHEED, yan fw z Also if fa+2Vb = Vx + Jy, (>), then va-2¥b = Vz - Vy 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 moming. Not trusting others, one pirate ‘wakes up during the night and divides the coconuts into five equal parts and one is left which hhe 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 ?——__ 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. Sa +1 —1 (monkey) — a(Pirate 1). 1 As before 4a = 5b + 1, where b is the part taken by pirate 2. Similarly 4b = Sc + 1, ¢ is the part taken by pirate 3. 4c = Sd + 1, d is 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 fis the equal part taken by each pirate. ‘Hence Sa +1, 4a = 5b + 1, 4b = Se + 1, 4e = Sd + 1, 4d = Se + 1, de = Sft 1. ” (S ) Sf + 1, giving us 16d = 25f+ 9. (4d = 5e +1) 2 1S) = 257+ 9, giving us 64e = 1257+ 61. (te = 5d +1) ” oo 224) - vy 01 (4b = Se +1) ss 2566 = 625f + 369 * as6( 45+) = 025f + 369 Continuing finally 1024a — 3125f= 2101 @ Now, 3125 = 1024-3 +53, 1024 = 53-19 +17 S35 17-342 17=2-841 fe 1=17=2-8= 17-8 63 - 17-3) = 25-17 8-53 = 25(1024 — 53+ 19) — 8-53, = 25+ 1024 — 483 «53, = 25 + 1024 — 483(3125 — 1024-3) 151474 1024 — 483-3125 c+ 1474-2101 - 1024 ~ 483-2101 «3125 = 2101 Solution of (i) is a = 1474-2101, 6 = 483-2101 or @ = 1474-2101 — 3125 tEN = 3096874 — 3125¢ 1 = 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, e = 1279, f= 1023 each pirate had respectively 3124 + 1023, 2499 + 1023, 1999 + 3123, 1599 + 1023, 1279 + 1023 coconuts. c+ They got 4147, 3522, 3022, 2622, 2302 cocontus and the monkey got 6 coconuts totallying to 15621. ‘Eucun's Auconrri AND REAL Numaens—_—__- = POLYNOMIALS 2 2.1 Introduction We have studied about polynomials, degree and coefficients of terms in a polynomial and types of polynomials in class IX. We have also studied factor theorem, remainder theorem, division of polynomials and factorization of polynomials. We will review these by the following example. ‘Example 1 : Identify the type of the given polynomials and state the degree and the coefficient of ‘each term of them. Also find their value at x = 1. ()p@)=We+ 14 Q)p@)=32+2x+4 — GB)p@)=4P 432 +241 Solution + (1) Here pla) = 7x + 14. Degree of this polynomial is 1. So itis a linear polynomial in x. ‘The coefficient of x is 7 and the constant term is 14. p()= 70) + 1427414221 (2) Here p(x) = 3x2 + 7x + 4 Degree of this polynomial is 2. So itis a quadratic polynomial in x. ‘The coefficient of x? is 3; that of x is 7 and the constant term is 4. PI) = 302 + WI) +4=34744= 14 (3) Here pla) = 423 + 3x2 + 2+ 1 Degree of this polynomial is 3. So itis a cubic polynomial in x : ‘The coefficient of x3 is 4, that of x? is 3. The coefficient of x is 2 and the constant term is 1. PU) =A + 30 +22) + 1=4434241=10 1. Identify the type of the following polynomials : (on base of power) (1) p@) =? - 5x +6 2) p@)=2P-Btx+1 (3) pO) = 5x2 + Be +3, (®) pea? 2. Obtain the degree of the following polynomials : () po) = 3x +2 +2847 @) pa) =P - 3x +6 @) p@)=3x-9 (@) pe) = 22 —x+1 ‘Marumarics 10