ise): Wet ie wet arree catctins of bets @ ots. clon end. mombera of set ane srenys tems Kip sets one usually, denoted by copilat tettens A,B,C, x, ¥.2 ee Ge comets 6 oe ame Mp by mall ens buts Fayed ° & 4 Rusten on tabalon” forma ents ane Uled,seponted by commas and erlstd within cany braces {1 fsamole : F0,6,1,0,u} set of vowels A set buitden:fonm : ah cements poress o engle common pnopenty. trample: 1 a! x is a vowel in toglish clphadt} i axdinalnumbem) Numden of elements of a set A (& called cuxdinal qumben and densled by nC A) We kepnyisen : A set which does not contain any element is called the emply set on the null set on the void st w& FiniteySet) + A set whieh is empty en consists of a definite numben of elements is called finite set. WMropiniterseb): A set wnieh x wot empty Q conusts of a indefinite mumben of elements is called infinite se. & Equaliset): Tuo sets A and B ane said to be equal of they have exactly the same tlements and we wxite A=® Otherwise , the sets ane said to be unequal and we waite A#B Subset) + A sei A is sold to be o subsel of 0 set B if every element of A is also an element of B. eB if och > ace & A Propennabsee) + Tf ACB ond AB, then A is called a pnopen subset of B ond B is called supenstt of A LP singletoarsee +f a set A has only one element , we call it singleton set uote: sudsets of set of nest numbers [NE ZEON QERGNET] T= Invstion! member A, Tatenvols as subsets of): (a0) = fa £0€x€b) is on open intemal, does nat conttia end points a kb (0,0) = 1506-6 b) i on closed interval, contain end points also, Cab) = €220< x bE is am opm interval from a to by including bul excluding 6, (ab) = Ext 06 eb i am open intneal jrom at by including & bal exuding a Segpror angiineriad © Ire rurben (bra) is called the tength of any of the intents (0,0), (0,83, (0,0) or (a,b) WS Powenset + The collection of ell subsets of a set A is called tne pomen set of A. denetea ty PCA) SAEED +4 se tents ets in genet 1 le nl ini 9 V. A unan"op Sets) + he union of A end 8 a4 the sel which conssts of all the clemerts of B, the common elements (eng taken only vce, ‘The symbat_‘u' a sed to denate_the enien EA on teat M4 Some Properties of Ue openction of onion co [AOE BUA] (Commutative iew) Go[AVA =A] — (taempotent taw) (io ((AUB)UC + AU CBUC) (Associetive tow) was u) (aw of v) (io AUG =A (law of identity clement , @ is the adentity of U) BG Neenteassro | Umesh saint | vaisnale SainiA renchiom of SEES) + he intersection of A and 8 Ine set ofall the ements when ene common 9 bath A and B. The symbot ‘As end te denate_the_iatensction some: tropento of the opention of “intention WAS BAA] — (Commutative ta) io fansac = ANA(BAC)] (Associative taw) wwlbake end (Law of ond v) iw (ANA = A (Tdempotent aw) © (An(sucd= (Ans) UCANCI] (Distributive tw) ie distnibutes oven U er = indi Wi ES 4 np ten galt ne: SAS CHROMIRRMENATRED + et ve the wnivenal st ond Aa. sobeet of Us thon Wie complement of Ais (Ov set of ll element, of U whien ane mot the elements of A. erated by A” Ae fain eu and xf Al ebvlously A's U-A Wh some pnopenties of a Sets reine tos? ws OTT] (RY © ema | Sa wo Gy 1 (Lai of dvableeamplementtion [CAV 4 a kan eet + [=D] end A, practical Problems an Urn Tand intention “of Wo sets + co (va WT ao) ci [RU + no) - nary Gi) Tf A, 8 ond Cane finite sets, then nC AUEUC)= nla) + m(a)+ nCe) -n(ansl-néaac)-n(anc) + n(aaBac) WOE): If A i 0 subset of the univensal set U, then its complement A’ is oso a subsel of U crmpantent Note + eal ‘then wat equal less_then equal to subset neclen_than ral_a_subset greaten thon equ implies Supinet if and_enly if Not ‘belngs toon contains in | D | vnion ae ineeLio NE the se 9 tne ll metus a Zt the st of the all tyens @ Ete se of tne all national mombers AE Ine set ofthe all meal mumbens. ZF te se of ane oll pantie sntegens F the set of the ll prvitne ational numbers A 5 the set of tne ll. positive neal mummbessCamteienipaobich + Given tun non emgty sts P and @. The conteion Preduct XQ it the st of all ondened pain of temenls jum 7 md @ in, [Pkeelipgiperracel Tf cithen on @ i the mull set, then PXG wl alio be emply sy ie. PHO @ TEA* Loy.08 and BL b,5 by bud} then ALB = F (0,50) (0,, bya, 04 P rote cr Tae onder pins ont equol if ond only if the eumsponding fist demen’s ene equal and tne stond tlements ane als equal Gb $f mA + p and n(B)- q, then nCAKB) * pq ii sf A and Bane mon emply sts and cithen Aon Be on infinite sth ten, AKB 1S ols0 © infinite set GO AKAKA® (lb, be CA} Hene Ce, led an ondened Lriplet . SF retions « A Relaion ® fram a non-empty set A too mon-emply sit B is & subset of the contesion produit ALB. The subset in denived Dy descwtbing 9 relationship Between the finst clement and the second element of the ondened pains in AXB The second element 5 called te smage of the [int denen. ‘Domiin = Te set of all fist chmenls of the endened pains in a nelation R from a set A toa sel B is called the domain of the melatin & 1 C5 6), Cebu), Cord), (asd), Copdy)} Range = the set of all swore elements me relation R from & Set A te Sel B is caled the nenge of the wl Cadaemain The wncle set Ox called we codomtin of the latin @ Wale: A etn from A te A ts oho steed as & nelatun on A @ Wate: If mea) * p ond niodeg, then, -nCAXS) = pq the total no. of elation is + 2°* A fietion): A netation f from 0 SHA toa SLB is said to be a function if feveng element of Set has one ond only one image in Set 3. Tf F is @ furction from A to 8 end (a,b) Ef, then 6 is called the Image of © unden f and a is called the pntimage of & anden f. the function f from A to B is denoted by f2 AB Of Reakivataea"punetion ® dy ysflzdee, TCR whene ¢ is a constant ond each xR. Here domain of f ts Rand its range is Eel. Ply feneion = fe pelynerial function if fon each xin SY TENE OH Oat tne, whene nis 4, Rotational fanetion. Rotstionel furcions one forcion of the type BP whene fC) and g(x) ane pelynomiat functions of x Acjined in & domain, hone glad #0. & cmelimilis function = me furdion J? RR defined by [lx = lal fon cosh ER is caled medates function & Signum function) he functon 2 RR sefined fo fares Sealed the signum function Gatton function: ne function FEE—*R ceinee oy fea e CED, cK essures Ue value of Whe queated tepn y lss than om equal to x, Such © fanctisn os called the greatest integen function an negative ilegn 0rd hy Oy ByyenesBy ERof Aigeona of neat functions = Let fix-R & gixRk Om: Axo -6 + Qaaite twor meal functions [CFs g) Cx) = Feud + g(a] so a aca 2 Sustain’ ofa eal faneton” from anothen + [CF 9)3) + feed = ge] eo ox 5 matipestion by wv scatan = [(0F)CD = af] .<0« 4 Maltiplication’ of wo neal functions = |(Fg)Cx) = fx) gCed] mo e+ Creme minions 5. Quotlent of "two" eol functions: [lal LY, mone pore, cen t qx)RIGONOMETRY A Angle is a measure of nolation of a given nay about its initial point A The oniginal nay is called the initiol side The final position ef the nay after notation ie engl is called tenminol side? Kiva en) Rotation is anliclechnise M60 ML co" seme degesyf1(one inate! 1" one second) te ” © an nadion = 350° vatue of 1. 22 314 % 1 nodion + 190° ¥ E> an one of lengin Ft notion 160° Fs" TL pation = 160 — Sine + tose + 1 Degree measure = 180 ia 14 tan’ = Sect Sin(-x) = -Sinx] [CosGx) = cose] [Er tote = Coser] sin Cary) = Su Cosy + Cose ect Sina = 2 Sinx Cosx = 2tanx Sin (x-y) = Sinx Cosy - Cosx sing i¢ tan’x Cos Cary) + Cost Cosy ~ Sinx Sin Cosax * (08% = sinte oe £- tan?x Cos(x-y) = Cos Cosy + Sinx Siny = 2C0s?x - 1 1+ tan?x - 7 = 1-2sin'e [eos(a-x) = (os (yx) + -Sinx (G2) = sid [ (Giz) as ton 2 = _2tonx = f= tan’x, fsin(-x) = tose] |Sin(E yx) = Coox 2 2 Sin3x = 5Sint - 4 Sin?x (os (a) =~ tose] [Sin(Mi-x) = Sine cos3x = 4 Cos*x - Stosx ane tansz - 3 tanz = tantx, (oe(en=x) = tose L_Atan tontavg)= dane otang] [lonGempy = Hamemtang] | O* 4 HY = 20 By coy 1 tanz tony Lt tans tany Cosn - Cosy = - 2 Sin ty Sinxay 2 2 col Cx4y) ~COtx coty-1 | teotCx-y) »cobx coty +! | Sinn + Sing » 2Sin xty Cos x= coty + cotx cot y - catx ag eee 9 sink = 0 gives GE=mIT] , wrene nez Sing - Sing ~ 20s ey. Sin aap % Cosx = 0 gives |x=(2n4t) I}, unene nee 2. 2¢osx Cosy = Cos x+y) + Cos Cx-4) 9 Sinn » Sing implies ERUACOY, wee nee | a ging Sing * Cos x44) ~ Cos Cx-4) 9 cose = cosy implies [x= 2nt + y], wrere vez 2sinx Cosy > sinCuty) + Sinlx-y) P ton = tony ieolies Fars nie y J, unene nee 2.Cosx siny = sin (x+y) - Sinca-y) VG Neentearsna | umesn sein aishats sainof Bone caliee quadnantal angies F Guadnantal ongies + All ongles which ane integnal multiples Sint = 0 implies x* mM , whene n is any integer cosa + 0 implies z+ (2nt on sunene nis ang integer foster 5 Ly %F MTT, whene mis ony integen sink Stex = Li, «+ (2ntt) 1, unene nm is ony sategen cose 2 tonx = sing , 4 (2nt4) 1, whene n is ony integen cose 2 (olx + tose, A MMT, whene nis any integer Sink Txigonometnic Equations ¢ fquovions involving tnigenometnic functions of a vaniable ane called trigonometric Equotions. F Principal solutions ? me solutions of a tnigometnic equation fon which O£ 4 2M ane called principal solutions ‘Genenal solution = The expnession involving integen ‘ri which give all sclutions of 0 tugonometnic equation ts called the genenal function ® « 180°Panweamee Of) Mariemarem‘Inpuction A The Principal of Mathematical induct Suppose thene 1s a given statement PC») inwelving the matunal na nm such that Ai) The statement is true fon met, ie, PCL) is true ond ih Tf tne statement is tue fon mek Couhene Kis Some postive integer) , then the statement (true fon n= kod, ie, truth of CRD implies the truth of PC Kt). Then Plm) is true fon all natural aumbens LS WAHETSEED The first step in & proof that uses mathematical induction ts to prove that BCU) 1s tnue. Ties step is Called the base step. A Tnaeesie seep: The step where we suppose that Pk) is tnue fon some positive integen k ond we need to prove thot PCK+O) is tnwe is called Inductive step. A taduetive” hypothesis * The essumption that ne given statement ts tmue jon Inductive hypotbesis. in inductive step is called is We connect one.(el rombrs + imeginaay number) a A Compler Numbers (Zz) : Geneval form Ee pon) ime 940 * neal numbers © Mote : Two complex numbens z+ 040 and z+Ceid ane equal if ase and bea Raf Algetna of Complex mumbens : t. Addition of two complex numbens : w The closure law =? [ate] The commutative law :[2)42) = 44%, © The associative law = oa 74 (+7) te ently th The existence of additive identity £ 0+10 denoted as 0 (zeno complex na) 9) The existence of additive invense :-a+ i(-b) denoted as 2 (negative of 2) (2 Diffenence of two complex numbexs > [Z=a, = 4+ CH) |S Multiplication of two complex “nurmibens) : tet z= aio and z+ C+id, then, the product 1% is an (ae-ba)e i Cad + 00) 2+ two compler ne @ The closune faw + [Ray] 41%, * two comple no. ©) The commutative law : [2,2 = Gz, ©) Me asoitve tow + conn (H The existence of multiplicative identity +1410 denoted as tt*7z| denstee os (Dot GE] ise 7w (6) (Epp ag ot Bey) Hoty une am 4 Division of two complex numbers > |Z. 2, 1) 2, 60 % Xe ie) We Ge) Gea) a) Fa — 7 Mf Powen of i P cntote: Any integen ky i 1, EMO GT, ie oy, were a Sama ities (Gat z0* +774 2,74 22,7, Mf Identities a Sa (uaz F 734 7, [ea ag = Cy) (2%) A Modulus + tet _z= a+b A Conjugate : ui _z= atid 4 ata « (TETERUEEO lovee « [EgHSTASE Note: = ltl] @ ee 2, b0 same: w[leaiaial) «[EPEI] @|f]-AH Angand Plane + The Plane dawng « comples numben esiiged to each of is point called tne complen plane on the angond. plane. xeiy + FaTegF is the distance oetween tne point Pley) and the onigin 0 (0,0) The x-onis and y~ axis in the angond plane, nespectvelly me neal ats and the imaginary xis The point (x, +4) is the minnon image of the point Ca.y) en ine neal oxi % Polon fonm of the complex no. : set ine point P nepresent the non -zeho complex no. z= xti z=x (C050 t isind) whene x nCosé = ASiNO ne LEY = Lz Cmotatus of 2) 0+ onguernent of x Congz) fan ong complex na. 240, thene connesponds only one value of 6 in 004217 The value of @, such that -"<6£T is called the principal anguement of % ws x y y . 2 ¥ vea xx Xx x x o » y Y ry ¥ ° ro) ay “ (0<0<2n) Xo» ry x x : 6 x Xx xX! KX — She o e y y ¥ ¥ 0 ay iy wy (exsosr) of Quadnatic Equations ax+or+c 0 whene a,b,c CR , #0, then, the solution of the quadnatic equation is , * 2a © ate + A polynomial equation has at least one root 9 alee + A polynomial equation of degree n has n noots.L Inequality + Two neal numbens on two elgebnaic expressions neloted oy te syntel 'e one! fram on inqualitg Types of inequalities : fp Numenieal inequalities): 3<5 , 775 (Sock ineauolites) = ax t by 26 @ Witenol inequolities = X65, 425 @ Winean inequalities © ax+0<0 double inequalities = 20 © Solution Set > the values of x which makes on snequaiy stave satoment ane called solutions of inequality end the set of solution is called sion set BRIE + Cquat murders may 88 added (on subtnacted rom) Hn sider of on equation. flue 2 + son sides of en equation may be multiplied (ox divided) by Une some mon- tere numben A we state folowing mules fon solving an inequality: ed from) beth sides of on ineuality without affecting the sign fale: east mumbens mag be edded (on of inequality Ruled = B0tm sides. of on inequality con be maltipied Con divided) by the same (Positive, nuimiben . But when both sides ane multiplied on divided by © negative inumbin , thn the sign of imeunity is event 4 Gnophicol 5 Gnapr of inequities sll be ent of tne half plane (cated station nqion) rd nepnesoted by shading in the connesperding nalf plane Peake: 1. te meson canting tt the statins of an mequaly is ited te soon naion In eden ody the alt plane mepnesnted ny om inguliy, Cis est eet tte ony pat aot sae) ond” check satbon tt sais the ineonlly. om nck Af ak stn then the ineaiy nepsents tne hall plone end shade tne rayon which clams the pant, otherwise , the inequalily represents Wat elf plane which does mat contoin the point within it. Fon convenience the point (0,0) is pneferned. Ey om ineunty is of the type ane by Ee on ore by 4c, thn he prints On the line axe tyne one also incuded in the sition negion. So dna a donk line in the sation neyon. 17 om snmesity af We [nm an yee on one by £6, then im pains on INE fine ax by tbe leeds the leben magn. So draw a broken on dete lint w she solution gion rot 0 rumen tine, pul @ cincle on the mumben a and donk fine (9 the Peatote: 1. to nepnesent xe Con >a? lett Com might) of tne umber a Te nepnesent 6a (On 220) on @ rwmben ine, pul © donk cincle on the namen a and dank line to the tefl Con might) of the numben Ime sation negin of © sytem of inequalities in the neyion whion sates all the given equine in Ow sys simultaneetyFundamental pninciple of eaunting? = Sf on event can cccun in m different mays, following which another event con occun inn diffenent ways, then the total number of occurence of the events in the given onden és man Mo Peamitations) + The amber of permutations of mn diffeneat things taken nat a Lime, whene repetition is nol altowed , is deneted by "P, "9, = whine OSnen (n-n)| ot [RS ein T= mem OE] — Faconiat Notation (1) ee: SE + Ux DKS #6 © Theorem 1 ¢ The number of permutations of n different things , token af a time, where «ns n and the objects do nat mepeat is m (met) (nea)... (m-net) whith is deneted by % © Theorem 2 = the mumben of permutations of n different things, taken % at @ fime, whene nepelition is allowed, is nt. © ‘Theonem 3: The number of permutations of ni objects, wnene p objects one of the some kind and nest ane all diffenent aL P! The number ef permutations of n objects taken all at @ time, whent p, objects ane of finst ind, jects ont of the second. ind, By objets ane of Ue RM tind ond net, if any y ane all different is —__L PLA! @ Theorem 4 Pal Mi Combinations + The rumben of combinations ef n different things token n at a time, denoted ty %y 7 _"L__, Osnam nl (n-n) © thonm 5: | "Rs "Cn! , ocnen TH, Theorem 6: | "nt C= Cy % Note: Ay from above TL. "Cyxmt, ie "C+ nt Gon ni (rn In panticuon , if wen, "Cy *_Ml of ml Of Bi we dejne i, the mumben of combinations of m diferent things totem nething at all is considered to Be 1, touning combinations is monly counting the no. of witys swith some en all jects at & time one selected Selecting rothing ot ell és the seme as leaving behind eit the chjets and we know thot treme is only one way of doing s0. This way we define "yet. HAs BL _ r= "C,, the formula Cy-_Tl __ is opplicable for n=0 also. Hence "C2! _ , oensn, o1fn-oll a(n] nilra 4 yn "Ee nt a ty ie, selecting m objects out of m objects is some as nejecting Cr (a Cn) (nea nt (nen) objects. Ge "a2 a=b on @=n-b, ie, neathPonte + +0)? (are) aro 1 (aro)' = o's 20b+ 0 (a4 oy’ = a's 0% + sab*s b! (aro)" = (aseP (ate) = att yar + ba'bte Yabey OF A Pascal's Tiangle) + Tne coffcients of the expansion one annanged in an an Pascal's Triangle The expansion of binomial fon any posite integral n iy. This annoy is called b The notation 2", we Hence the theanem can also be stoled as (aeb)"= Z'Cye’ me "to" stands fon "Cy ate? + "Cy a0! + "C0" sent "Gye™Me™ , whene 6% 1+ ah The coffeients "Cy occuning in the binomial theorem are known as binomial cofficients Thene ont (mel) tenms in the expansion of (a+6)", ie. one mone thon the index. Te the successine lens of the expansion the index of @ goes on deeneesing by unity, Th isn im the finst erm (i) m the ecard tenm , and 50 on ending with ten in the fast tenm. Mi the same ime the indes of 3 ecnesses by unity, stating with rem in the fnst ten 1 in the strand and 50. on ending with min the last team. =ee GI the expansion of Corey", the sum of the indices of @ and b is niO~m in the fins term, (mieten in me secod (tam ond 30 on Obmen in the [ext term. Thus i con be seem that the sum of ihe indices of and b in every tenm ofthe expansion © ax and 6 # Cog) Mate Maly tye a HD Oy” © a24 and bx (t4x)"= "yt "Cyx + Cx + "Cy x) + ee? Oat and b-2 | G-x)"= My - "Eye + xt. EIN Gn” oF Gamenal tenn + tm qenenat team of an expansion (a¥6)” is[Thya = "APL 6 middie tens: W) Tf nis even, then the mumben of tenms in the expansion will be ntl. Since n is even so (ntt) és odd. Thenefore, the middle tenm is may”, ie. [ze]" term 2 2 0 Tf nis odd , then (net) is even, so thene will be two middle terms in the expansion, nomely,, [asa] tenm ond fee a a 2 an i) In the exponsion of fers] ywhene 240, the middle tenm is x [ens tenm] o metety ie cntt)™ tem, an is even. Tt is given ty *eya[a)’- *"G, (constant) xLisequence : A sequence can de veganded as 0 function whose domain is the set of atunal mumbens on Some subset of it of the type €H23...A). Sometimes , we use the functional notation an) for a, A Senies + Let a,,0),03.....2.4, be a given sequence Then, the expression ay # 0, + 03 +....+ On is called the senies associated with the given sequence. (awivnmetieprognetsion =, ard, atid 0 n teu CGenenat term) [Gn arena] [E> ar Cred] + commen diffenence % Sum of A-P. when finst and tast tenm is given, [f= Blatt] ‘= the ne, of tenms Sqr the sam of tens WZ Anithmetic Mean (4.4.) [r= 2] and b+ two numbers A= Anmetie Mon SF Geometnic Progression (G-P.) an, an’, ant, 9 generat tenm of GP [By = aN!) x common vate omc ae cael rp met Nnet NoneP(x, 4) and OCI.) is [PQ @ LG 2)"t py Mf Distance beween the points A coonbinates of © point dividing tne tine segment joining the points Cx,.ys) and (Ray ya) internally in the ratio min one [M@GtNH , Mat ny min men Tn panticulan, If man, the coordinates of tre mid point of the line segment joining the points 7 # (yyy) and Cay) one [aes fete 2 2 Mf ane of triangle 4 C4; (yp- Yo) tm Cys- ys) + Hy Cyy— yd] | vemiers ene C10 pe Chg td Cy 0? @ motes: 1f tne ones of the tmiangle ABC reno, then thnte points A,B and C lie on 0 line, ie., they one coltinean A 1006 of @ vine [an = fond] (0+ 30') @ Wo1e: me slope of x-axis is reno and slope of y-axis is nol defined ie 1 te ty i aay Guy) [rv Lee WSF the tine is parallel (0 Tana = tong Mf the ine and ty ane perpendicwtan — frm, = -1 ] oe [mmm =f ™ tonB= ton( «+ 90") + tet + - fo tang MI tand = 14mm, +0 eae aml A collinearity of thnee points once points ane collinton [Fog of AB * slope of BC (f and only if M6 paint = siope form — [y-y,= m (x=) Aton point form [yng LH (x x) eax Mf slope = intencept four case slope m and y- intenceet © Case i slope m and % - intencept d W Tntencept fox zed = 1] x intencept 0 and y- intercept & a Of Noxmal form ZCosw + ySinw =p] * Normal distance from the onigin. G oistance of 0 point from ating la» Writ Buel) ars ey te +0 froma point (x.,y,) Le S oistonce between two parallel tines d+ LG-tal | two panaiied tines Ax ¢ By ¢¢)*0 and yy aie Syee aeWA sections: of atone : The intensection of 0 ter fo emit plane with a une, cone the Sectio so obtained tener is called 0 conic sedion of Cintte, ellipse parabola and. hgpenbola): when the lane cuts mappe of the cone, we hove the following situations + => Sz @ wren 90", tne section is a cine, se when &< Be 90, the section is an ellipse. a ©) winen Bra s the section is a ponodola - @ when OS Bex; the plane cuts through both the wappes and the cunves of intenseetion is 1 hypensota : Wveqenenatea WconieNseetions): when ine plone culs ot the ventee of te cones ve have the folowing Siffenent cases = t 5 (A) wnen « gee] = tin Fe) # tim gin giy, | bis (x). J} = lim f0x). tim glx di [iy [Fee peed] = im Fw. tim ga i ® A Theonem 5: vet {ard q be any two neal valued functions with the same domain suth that {{2) < glx, for all x in the domain of definition, Fox some a, if both tim f(x) and tiem gta) evtt, ten lim fe) € tim g(x). Ts ma 40 ot A Theorem 4: (Sandwich theorem) ? cet {19 Ond A be neal functions such nat f(2)* 9¢x)¢ h(a) for alt % im the common domain of definition. Fox some neal number 0, if li f(x)e b= lim Cx), inen tim qizdel. 90 ua a A Theorem 5+ the following ane two important imits ip Sake 1 Mim 1 Lose, = 0) A Dunbvative + The deivave ota function f at a is defines by [fad = lin Flas yo (a) ef Oesivative of 9 function fat a point x is defined oy [flare AECx) = Linn eer dx 40 final prindple of derivative P enor : A Limits of polynomials and wational functions * A function f is sald to be @ polynomial function if f(x) ts zeno function om if fx) * Ont O42 t O,2°4 2... + OqK” whent 6)8 one neal mumbens such thal o,%0 fon some natunal numben a M% Theorem 6 + fox functions u and v the following holds + (Leibnitz nate) @ (utes wee @ Gwe uve fay sae provided all ane defined ’ AM Theonem ts feds ae > fea) on™ fon ang positive integen SF Theorem 8: F070 = age + Op E74... # A,X +4, dE a polynomial furdtion wnene a;5 ane all ‘neal numbers and oy #0. Then the denivative function i given bg GECO, mage! § (met) Og 284 t 20 tO, dx g 9) a= ne) =O |LGsiny) = cose] | dh = - Sine " dx an dxA eetnematicat Statement): The basic unit involved in malhematical reasoning Is & mathemaicl statement. Caveman acetate * A sentece Is called a mathematically axepable statement of ik 1s eithon true on false but not doth A uigetionop a statement = the denial of a statement is called the negation of the statement. Tf p is a statement, then the negation of pis also a statement and is denoted by ~p,and nead as ‘not p’ @ wot : white forming the negation of @ statement , phnasts tike gt is mot the cose” on “ it is also false that” ane also used A compound statement is a statement which is made up of two on mone Tn this case , each statement is called @ component statement statements. oS pales fon the compound statement with” *AND™ 4 the compound statement with ‘And’ is tawe if all its component statements ane true. 4 The compnurd statement with ‘And’ is foise if any of its component statement 1s false Seals for the campaind statement with “OR” Grune: “ip ont oniy if” (2) LA compound statement with an ‘On’ is true when ane component statement is tnut on both the component statements ane tnue, 2 A compound statement with an ‘On’ is false wben bath the component statement one false A quantifiens + quontiviens ane phnases like , “ Tene exists * and “fon alt” A rmplications + Trplications ane “ if-then™, “only if” and “if and only if? 1 a numben is 0 rmultiple of 9 x EE PtOM ORY Ss a murin is @ multiple of 3. “te p implies q Cp-Sq) this sop Gat © number is a enullile of ample thet ik us a mullite of 5 hp vt sufficient condition fon q. Mis says tat knowing that a ramben as a multiple of 9 is sufficient to contude nat ¢ is @ multiple of 3. Sop only if qs says that a ma. és a muttie of $ only if i is 0 multiple of 5 4 is @ neccssong eondion fon p. his says that when a no. iS a multiple of 9, Ut {s necessary @ multiple of 3 4-4 implies =p. this soys that if a no. 1S not o multiple of J, then it is mot a multiple of 9 A contnapositierandimeonvense : Conlnapositive and convense one centain other statements which can be formed from a given statement with “if - then” of validating statements + @ euler: “Tf p ond q ane mathematical statements , then in o “p ond q” is thut, tne following steps axe followed yndlen to show that the statementStep T Show that the statement p is tnue Step 1 snow that the statement q is tnue Y euter. statements with “on” Tf p and q ane mathematical Statements , then in onden to show that the statement “p ond q” is tnue, one musi Considen the following ease r ay assuming that p is false , show that q must be true (ase By assuming that q is false , show that p must be true. P ewes. statements with “if- then” In onden to prove the statement “if p and q” we need to show that ony one of the following case is true. (axe Tay assuming that p is false , show that q must be true. (Dinect Method) (ase Uy assuming that q is false , show that p must be folse . ( Contnapositive Method ) P eates, statements with “if and only if” In onden to pnove the statement “if p if and only if q” we need to show Go If p is true, then q is true ti If q is true, then p is true A oyetontmadietion : Hene to check whetnen a statement p is tue, we assume that p ts not true ie. ~p ts tnue. Then we annive at some nesult which contnadicts oun assumption. Thencjone , we conclude that p is true wi countenctxample : The method involves giving an example of 0 situlation whene the statement ts not valid.Voniance Standand eviation Bosman igs <= a ms of [Range = Maximum value - Minimum value Sum of absolute values of deviations from ‘a’ i B+ 42, 45 No. of _obsenvations let mn observations Be, ty, yp Re E |x-#| MD. (%) = Lb nin Me meaien MD (M) = £ Elan] E> Hem nist MD (ROLE fF Ix a ti ltael ywhene N+ Ef mot LF B wR filacal w 100], <+0 Yasiance (e*) Stondond deviaticn (+) Qn t nae A G on Gj a fr Oe LER (y- 2) ea of 7 4 Poa DnB iT) where y, = [NS py iy pn kN Efi Efig?(4) « Numben of foveunable_outeomes Tolal_rumben of outcomes & Probobitity formula F Outcomes space = A possible nesalt of a random experiment is called its outcome. ff Sample space : The set of outcomes is called the sample space of the experiment. MW Sample point + Goch element of the sample space is called @ sample point Si Event): Any subset € of o sample space S is called on event Types: of events “A. impossible Frents and “SURE EHents * the emply set Impossible Events . he whtle somple space S Sunt Events B SimpleErent) + tf ony event Cras only one somple point of @ sample space , it is called a Simple event. (elementary tvent) | Compound Feeat = If an event nas mone than ont sample point , it is called @ compound event. ge of eens ts Comolementong Event of A: The Set A’ on S-A The Event ‘A on‘: The set AUB OF The vent ‘A and "Bs The set ANB A, The Gvent "AY but nat AE matuoliy excsive events = 6 ard 8 exclusive if ANB => Nate simple events of & somule space ane aluays mutually exclusive A tahoustive vente TH Es guess in avents_of sere space Sond if EUR U. UE UE S| ten ive events, Favela ane called ex L paabttity + Mumten #01 erecated with sample point 1, suth tnat : OF PCuDEL — iy EPC fou all ESL — id) PLAD= E PCu,) fan all wich The no. of Plas) is coled probability of the outcome w. A Rqually tokes cudeomes = All outcomes with equal probability faba of an event + Fen afte ample spre vith eqaly ey. vteomes pay = tay] omen we nis) | et eee ts Sf A and & one any tuo events, ren [PCAUBD = PLAY + PCB) — PCANBD Fi A and 8 ane mutually exclusive, then A ip Ae ong event then [ECE ATs PCA SF Conditional Probability, = If E and F one two events with the same space ef @ nandom experiment , then the conditional Pobig of thee € ges at Fas armed HE) FEAT eet 100 #0 F BY A Probably of Conditional Prebobility e (2) *(é) (2 If A ond B ant two events in a sample space $ and F is an event of S, Ei ict such that PCE) #0. Inens ee ? A) @ pas) o eS