1) > 095 dicis thrown 8 times, 1-P(X=0) > 0.95 A throw ofa fair die that gives number, which isa __(b) Given that the probability of obtaining a least, ; (©) the minimum numberof tows required so that 2 tenia ftowsraindstt (V2) as ismorethan095, ue ann) > 095 (@)_X— Number of times of obtaining a multiple of | (a=1} 2 Sutenadelsiown 14] as ~as,t)<— - ay rede ae ' follows a binomial 2y Gy umber of ale n= 8 and >" the probably of success (J 739 smminimum = 8 Hence, the minimum number of throws required so thatthe probability of obtaining atleast one success to be more than 0.95 is 8, ey etnTaran stat Ts potty tat be stithetgetincachthow is hs thrown the dart n times, the probability that all the 16 throws strike the target is? Find the value ofn Solution X~— Number oftimes of striking the target wale | Self Assess MEXIA] 1 List the elements of each of the following discrete random variables. (a) X= Number of tals obtained when 5 coins are tossed simultaneously. (b) ¥— Number of times of obtaining an even ‘number when a die is thrown 3 times. (©) Z~ Number of red balls chosen when two balls are drawn at random froma bag ‘that has 3 red balls and 7 yellow balls, (@) W-Number of times Desmond strikes the target if he fires 4 shots ina shooting ‘competition. 2 Three unbiased coins ae tossed simultaneously. _X represents the numberof tals obtained. (a) List the elements ofthe binomial discrete random variable X. (b) Calculate the probability of each ofthe elements of X. (©) Hence, plota graph to represent the binomial probability distribution of X 3 The analysis of SPM results ina schoo! shows that 60% of the SPM candidates in that school obtained a ‘eredit’ for Bahasa Malaysia, A sample of 4 candidates is chosen at random, Y represents the number of candidates who obtained a ‘credit’ in Bahasa Malaysia, (a) List the elements ofthe binomial discrete random variable ¥. (b) Calculate the probability of each of the clements of ¥. (©) Hence, plota graph to represent the binomial probability distribution of Y. Probability Distributions 4 The probability of the birth of ababy gif ina ceincomyis 3 Find roti hat ina family that consists of 4 children, there (a) isexactly 1 girl, (b) isat least one girl, 5 Itisknown that 20% of the students failed the Form 4 final examination in a school. A sample of 10 Form4 students is chosen at random, Find the probability that (a) there are no students who failed, (b) there are not more than 2 students who failed, () there are atleast 2 students who failed, 6 Inapuzzle contest, thereare 8 objective questions. Each question has 4 choices of answers and there is only one correct answer. Ifaparticipant guesses an answer at random, find the probability that he/she could guess correctly (@) allthe 8 questions, (b) not more than 2 questions, (©) atleast 3 questions. 7 Acompany has 20 workers. The probability that a worker is late for work on a certain day is 4 onaceaindy.find (@) the probability that no workers are late for work, (b) the mean and standard deviation of the number of workers who are late for work.are © ONCEPT MAP ‘tar Pec nas ‘Binomial Dstbuion Taburan Bom Probability of a. ‘Mean, Variance and Binomial Derbuton || | Standara Deviaon Kebarangkalan bagi ‘la Brom Taburan Biron Destbuon x=) (Gye | rer reese! where p+ q=1 Taburan Binomial rem sa 6% + o%=npq Graph of a Binomial Distributon Graf Taburan Binomial ‘SoWving Real-fe Problems that involve the Normal Distribution ‘Menyelesaikan Masalah Kehiupan Sebenar yang ‘melibatkan Taburan Normal ‘Solving Real-life Problems that involve the Binomial Distrbuton Menyelesaikan Masalah Kehidupan Sebenar ‘yang mefivatkan Taburan Binomial Learning Objectives(LEA Solving tinear Programming ° Problems using Graphical Method 1 Mostofthemanagement problemsthatinvolvemany condiionsean SSAA be solved mathematically by forming an inequality system and then solving it. The process of interpreting management problems by Amanat ede vey determiningttevablesandhus forming nequaliysytemis Set knownasa mathematical model. 2 Linear programming isa method of solving management problems thatcan be represented by a mathematical model. 3 Foran inequality system in terms of sandy, we can find the optimal ‘value (maximum or minimum value) of acertain function in terms of sx andy. Tis function (I= ax +by)isknownas the linear objective function. 4 The steps to solve a linear programming problem through the graphical method areas follows: Step 1 Interpret the problem and form inequalities that satisfy all the given constraints Step 2 Construct and shade the region that satisfies all the inequalities, This region is known as the region of feasible solutions or in short, the feasible region. Step 3 Determine the optimal value (maximum or minimum value) of aax+ by from the graph. 5 To find the optimal value (maximum or ‘minimum value) of ax + by ina feasible CHAPTER region R that is fixed by a few inequalities ana bea that satisfy a few constraints, the following ee steps can be followed. _& * Draw a suitable straight line for 7 yyy ax+ by=c.Usually the value ofcis given [> @ byc=axborc=(aXb) Xkwherekis ° "2 * constant ‘© Usinga ruler and a set square, move the straight line ar + by'= cin a parallel manner until it passes through the point (x,y) in the region. R that is furthest away from the origin (for the maximum value) and the nearest to the origin (for the minimum value) If (m,n) is the furthest point away from the origin, then the maximum value of ax-+ by = am + bn. If(p, 4) is the nearest point to the origin, then the minimum value of ax +by'= ap-+ bq Syarikat Wawasan is appointed by Syarikat TV4 to At least $00 people who are to be given the carry outa survey onthe quality oftheir TV questionnaires are from rural areas ‘programmes through questionnaires, The constraints IL The number of urban area people who are to be fixed by Syarikat TV4 are: given the questionnaires isnot less than the ‘number of rural area people, itiesLL The total number of people who are tobe given the questionnaies is not more than 1500. Syarikat Wawasan has given the questionnaires to ruralarea people and y urban area people. (a) State three inequaites,other than x> Oand ‘y=, that satisfy the given constraints (b) Using ascale of | emto 200 people on both axes, draw the graphs for the three inequalities. Construct and shade the feasible region & that satisfies the given constants (6) Based on your graph, answer the following questions: Syaikat Wawasan is paid RM2 by Syaikat TVS foreach person who is given the questionnaire ‘The costs of surveying te rural area people and the urban area people are RMI.SO and M100 per person respectively. Find (the minimum cost for Syarikat Wawasan toconduct the survey, Gi) the maximum profit that canbe obtained by Syarikat Wawasan, ution (a) The inequality for each constraints as follows: 1 x=500 yer MI x+y= 1300 om » 18xe y= 180 Linear Programming (©) Texpresson forthe eos given by: Cote 130 Dy Drwstnightine [> ereye 30 cpror e y [150 | 0 | [The orient 150s bane rom the prodctof 1.5 x 1.0% 100 =150 ie (coeff) x (ofc) x 100 The mupaton by | 100 Stoel ite taht ne gaph, } From the graph, forthe minimum cost, = 500 and y= 500 Hence, the minimum cost = 1.5(500) + 1.0(500) RM1250 (Gi). Prepare table as shown below to simplify the interpretation of the given problem. Area | Parmer ost | Pri fal 200 _iL30 |RADSO Urban pxn00 | RA.O0 | RYA.00 —— ny Pott Payment received ~ cost ‘The expression for the ‘profit is given by: Profit=0.5x+10y Draw straight line x | 0 | 1000 Ose+y . y [s00} 0 “The constant 500s obtained from the product of (05 x 1.0 1000, (coefficient of) x (coefcent fy) 1000. The mulation by 1000 ist enlarge the aright graph From the graph, forthe maximum profit, = 500 and.y= 1000 Hence, the maximum profit (500) + 1.0(1000) M1250Tomake a cake, 80 of flour and 60 g of sugar are ‘of buns produced’, the inequality isx = 2y=> 2y = x. needed while make abun, 120 g of flourand 4 30g of sugar are needed. A businessman who For the inequality x = 2y, the term in yhas to produces the cakes and buns has 7.2 kg of flour Boon fs otis Regaty taeeec zy fvl3.3kg of supa. The numberof cakes fas batch oy oac Pe oo rduced is totrore than? tines tho nmber of shove he signe 2 = hast be sake bons produced, Assim that the businessman 3 rhc cary bs 70 | {@) State three inequalities apart from x0 and y =O. that satisfy the above constraints, oa | (b) Using a scale of 2 em to 10 units on both axes, draw the graphs for the three inequalities, Construct and shade the feasible region R that satisfies the above constraints, (©) Based on your graph, answer the following questions: (i) Find the maximum profit that can be ‘obtained by the businessman ifthe profits from the sales of a cake and abun are '80-sen and 70-sen respectively Gi) IF the number of buns exceeds the ‘number of cakes by 20, find the maximum ‘number of cakes and the maximum number ‘of buns that are produced by the businessman, Solution (a) Prepare table as shown below. Flour(g) | Suear(@) Cake(runitsy 80 oo Bun (y units) 120 30 (©) (i) The expression for ‘profits’ is given by: ‘The mass offlouravailable is 72 kg. Profits =80x+70y <= The inequality is Draw the straight line 80x-+ 70) 80+ 120) 7200 2x-+3y< 180 g i ‘The constant 560 5 obtained by ) (Cozfcien of xx coetient fy) y | 0 | 0 10,i (80 x 70) + 10 = 560. ‘The mass of sugar available is 3.3 kg. myo [7 The inequality is > 1s | 0 60x-+30y = 33003 2x4 y= 110 in aS For the maximum profit.» = 38, ae 0 | [ Using a ler anda set squore, sce the saght ine {80x + 70y= 560 upwards unl teaches the furthest point (wth postive integer coordinates) in he feasble region ie. point (38, 34), @ —— For the constraint ‘the numberof cakes, ‘produced is not more than 2 times the numberHence, the maximum profit, = 80+ 70y “The furthest point in the feasible region Ris actually = 80(38) + 70(34) (7.5, 35). Butboth ofthe and y coordinates must 5420-sen be positive integers (because and yarerefersing to RMS4.20 the number of objects) and therefore, the second Finbssrpatie iia both tesccournate and Gi) Ifthe number of buns (y) exceeds the -coordinate are postive integers) has tobe numberof cakes (x) by 20, the straight Hine determined. y= 20has to be drawn. The points are likely tobe (36,36) of (37,35) or [0 » (68,34). 20 | 70 Profits = 80x + 70y For (36,36), profits= 80(36) +70(36) =5400-en From the graph, the furthest ponton the line For (37, 35), profits = 80(37) + 70(35) = 5410-sen For (38, 34), profis~80{38) + 70(34)= 5420-aen 7 E20 Is he Saaibleregion R (ober both the x-coordinate and y-coordinate are positive integers) is (24,44). (Gaps ve Hence , the maximum number of cakes and Hence (38,34) sthefunhest point where bot the the maximum number of burs tha are Silat co peststinatoe aie ages) produced are 24(ie-4,,= 24) and 4d ine fee region Se eget Encik Syarizalis a songkok trader. He buys x velvet Solution songkoks and y cloth songkoks from a wholesaler (a) The cost price are RM9 fora velvet songkok and ‘with the prices of RM9.00 fora velvet songkok and RMS fora cloth songkok. The capital available is RMS.00 for acloth songkok. He then sells the M900. songkoks with the prices of RMI3.00 for a velvet ‘The inequality is 9x + Sy < 900. songkok and RM8.00 for a cloth songkok. Encik ‘Syatizal has a capital of RM900 only. The number of the velvet songkoks that are supplied by the y | 180 | 0 ‘wholesaler is not more than two times the number of the cloth songkoks and the total number of songkok supplied is not more than 140, (a) State three inequalities, apart from.x = O and _y = 0, that satisfy the given constraints. x» | 0 | 10 Forthe constraint ‘the number ofthe velvet songkoks supplied is not more than two times the ‘number of the cloth songkoks supplied”, the inequality isx= 2y=3 2y =x. <4 (b) Usinga scale of 2 em to 20 songkoks on both x | 0 | 120 axes, draw the graphs for the three inequalities. > |o | «| Construct and shade the feasible region R that satisfies the given constraints For the inequality x = 2, the ter in y has to be on the (©) Baxedon your graph, answer the following LS ofthe mequsty. Thus, x = 2y hes tobe remiten as gies 2y = x Hence, the tein above the aight Ine 27 =" (@ Find the maximum profitthatean be fest Beater ‘obtained by Encik Syarizal Forthe constraint ‘the total number of songkoks (Gi) IF Encik Syarizal buys 60 velvet songkoks supplied is not more than 140”, the inequality i and ycloth songkoks, find the minimum ty = 140 profit and the maximum profit that can be » | 0 | wo ‘obtained aftr he has sold all the songkoks that he bought aa | 0 iciOy Draw the straight line 4x-+ 3y= 120, if “The canstant 120i bined by (coon of x coffee fy) x 10, Lie @ x3) x10= 120 For the maximum profit, 90. Using 2 ler and a set square, side the straight ine ‘464 3y = 120 upwards unt itreaches the furthest pont in the feasble region 8, 2 ie pore (50, 90). S Hence, the maximum profit = a4r43y 20 4(50) +390) RMI70 ° ‘80 100 120 140 160 * 30 t Gi) Ifthe numberof velvet songkoksis fixed a 60, then x= 60. 8 CHAPTER ‘Selling price Cost price | Profit When x = 60,y minimut (RM) (RM) (RM) Minimum profit = 4(60) + 330) Velvet, =RM330 songkok 13.00 900 4.00 Brom the geapls: songkok | 8.00 500 | 3.00 RSS: (y units), ‘The expression for ‘profits’ is given by: Profits=4:r+3y shoe making company employs foreign workers I The maximum total mimberf workers nd yea worker sobject tothe Following employedis 160, constants {@) Sethe inequalities, pat rom. Oand 1 The number of local workers employed exceeds y= O,that satisfy the given constraints the number of foreign workers employed by at (b) Using a scale of 2 cm to 20 workers on both er axes, draw graph frcah ofthe thee 11 The number ofoeal workers employed mustbe inequaites Construct and shade the feasible attest ofthe number of foreign workers syle tetettican tinge employed, ities(©) Based on your graph, answer the following questions: (@) Find the maximum number of the foreign workers that can be employed. (ii) Find the maximum number of the local workers that can be employed. (iii) The daily wages of foreign worker and a local worker are RM1S and RM30 respectively. Ifthe company decides to employ 60 foreign workers, find the minimum and maximum daily ‘wages that have to be paid. Solution (a) Forthe constraint ‘the number of local worker ‘employed exceeds the number of foreign workers employed by at most 60", the inequality isy x= 60, x | 0 | 50 y | | 110 Forte oni the mer ofc woes cnpbyelimanteatlewtSofthenmiero? frig wees ply engi 3 yk Fort cesta ‘the maxi tal uber of Zo | 10 ye | @ ‘workers employed is 160°, the inequality is x+y S160, y | 160) 0 Linear Programming (©) (i) Maximum numberof the foreign workers that can be employed = 100 workers —<—<$<—<————it—§, (Ths the ngest ale obi the ease epon | Gi), Maximum number of the local workers that can be employed = 110 workers. —— (hiss the lngest value of yn the feasible regon R. ) (ii) The expression for daily wage is: Daily wage= 15x + 30y Ifthe number of foreign workers employed is 60, then x = 60. Minimum value of y = 36 Minimum daily wage 15(60) + 30(36) = RM1980 Maximum value of y= 100 ‘Maximum daily wage = 15(60) + 30100) =RM3900