| f:X>Yisoneoneit | fad=fayon=n | Vx, x,€ X. Otherwise, | fis many- one, FX Yibsontoifevery ye Y,3xeX such that f(x) = y, | Then fis surjective |reflexveitaRaV ac | + Equivalence relation (if relation has reflexive, symmetric and transitive relations) eg., Let T = the set of all triangles ina plane and {| R: TT defined by R= {(T,T)}:T, | congruent to T,}.Then, R equivalence. » First Level *Second Level * Third Level : ae | ‘Scanned wih CemScanner(oy = sins, Domain = (y= cos". Domain = | Gi) y = cosec'. Domain i's) = x,-ASzs1 (6) sina) = ins (i sin'x teos's = Eases sn xjer Coden tan ete? <1) (0) cosec"s + sec"x =F, al (evi) 2 tans = tan, ie, lexel = tan'y = tan2=¥ jay>1 ley ‘The range of an inverse trigonometric function is the principal value branchand those values called the principal value of that inverse tigonometricfunction. (ai) tan: eeceerne ale cot: R{x:x= mm neZI-4R see: R~ { xo Qnsnf mez} +R-0) cosee: R= (es = my neZ}P R41) = yet Joscostr< © lo KC, ROR +KR OFC C+ KC; ‘Transpose of for applying the operations | its pre ‘Aso, A(BC)=(ABJC,A(B+C)= AB+ AC and(A+B)C= AC+BC, but ABBA always). xy IFA, Bare two matrices of same order, then "The addition of A and B follows Operations )- on matrices k(A+B) / Nitin “bIA=KA+IA, kand Lare constants - Raia oT enter mit an ore rectangular aay of nab or functions having’! rows and columns. The matrix ArLayjpany 1S4Sm,1S]5 m1, je Nis given by i), My O12 i ot AAA Sn la oftheform [Aj] ix. Buy ng“ mx | square matrix Here, m = (no. ofrows = no, ofealumins) {Diagonal matrix: All non-diagonal ents are zero ie j= 0¥ij » Scalar matrix :4j = 0-i #j and4%j =k (Scalar) =j, for some constant k. i fev)-[o)-2 ‘samecorder and. f + Identity matrix aunty ce # Zero matrix : Allelements are zez0. two matrices : a 2 aMaes Definition and ALaybaxy ANE B=Pegenp then AB=C=[Cahany IG PIP ja | wine JoeB Jomewe-[2 | ‘Be ig sen aB= Bot = Pa | SEPT souvwanivn ‘Scanned wih CamScannerwhaxrhy+e2adyagrtby-+oz=d,ayx+ by + 62 =d, then we can write AX=B, GE deeo(i where A=|4 b; G|X=|¥|and B=) dy Unique solution of AX=B isX =A'B ,|Al#0. ‘AX Oat every point left of Candy" (x) a)is given by A= fy de oF feats eg: The area bounded by y=2",X- axisin seta | | Ifthe curve under consideration lies below X-axis, then fix) < 0 from x=a to x=b, the area bounded by the curve y=f(x) and the ordinat x=a, x=band X-axis is negative | alpen] and the lines x=2 and x=3 is - Pt PT lay pl anfyaref def]-307-9-2 Squnits. 7 sf I OF T 4 ‘Area under simple curves nx-seuig ‘{uopesedarg a1nUty 1807) ANT BSEO TPO ‘The area of the region bounded by the curve x= f(y),¥ —axis and the lines y=cand y=d(d>e) is given by 4=].xdy or [fdy |e: The area bounded by x= y", Y-axis in the I quadrant and the lines y=1 and y=2is fuser art ae) 8 Sq. units yications of per ntegra/, the | Are. | ee Trace the Mind Map (e | Wer ‘Scanned with CamScanner‘ditlerenial equation which can be expressed ) natheodaciiehper ) in the! fom - Ser)or Frey) | Independent variable (variables) i called a differential equation. there is | | order derivative occuring | where f(a shand g(<,) are homogeneous | only one independent variable, then we cll t a an oninary ferential | | nthe diferent equation | functions of degree zero is called a homogenous equation. eg: 2 ()- 0. eg: the order of 2 =e" | diferetial equation aavarnnees - a 1 | isoneand order of | cgi @@+ay)dyeQe tyr aaa | #Y , pao istwo. is, wre reve. and Pave ® (ae ‘Tosolve this, we substitute y=vs. and B= y+ xo nn te Ouerotat. if the differential equati - Seca ferential equationisa | ee pomopencous Definition’ ti | f & Differential uation | ‘The differential equation ofthe form 2+ Py =0, Equations | where P, Q areconstants or functions of 'x’ only is called | a first order linear differential equation. Its solution is defined as the highest power (positive integer | | only) ofthe highest order derivative. | eg: the degre of (SE) 0 isthe | , rat fra dy pane & | Bivenas ye fQd deve. eg: M43ya2ehas Differential ofa ax | Equations Degree Of | Order and degree if defined) ofa diferent solution ye“ fare! devon ye"=2fxedrve | th equation are always positive integers. | ‘A function which satisfies the given differential | on equation is called its solution. The solution which | { This used to solve such an equa contains as many arbitrary constants as the order of | variables can be separated comple | the differential equation is called a general solution ydx = xdy can be solved as = ; and the solution free from arbitrary constantsis called grating both sides * | Solution ofa particularsolution. z Differential ; logx=logy+loge=Zzexz=cy, | . Equation, =e tsasoluton ofy-¥ = 0, listermion Vibe She Pod and ree Puyne eat The order of a Differential equation | representing a family of curvesis same as the number of arbitrary constants the equation corresponding ly ofcurves. | family ofcurvesbe m= constant, then, y'=m | jerrnyabre cd yaa Serene cso nin a a seo rome ASE ‘Scanned wih CamScanner“i Fora given vector’ the vectora="5 gives the unit vector in the 0 vector (initial an Unit vector (magnitu. Collinear vectors (parallel to the same line) ' ‘Equal vectors (same magnitude and direction) | (i) Negative ofa vector (same magnitude, opp. direction) Unit vector Ie we have two vectors Direction Position of B=qi+aj+ajk, B= hitb, +bk and ratios and vectors 2.is any scalar then- airectoe Types B= =F=(q 2h) 2h )ir@ss)i | The position vector of a point R dividing a line segment | Vectors ing 2Q whose position vectors are Bresp. inthe ae yn atm PN ternally is oe (i) externally is As covenant Seaeeneonnis Vector tion is called a vector. The distance and terminal points of a Vector, : wgnitude.Magnitudeof | aaa Properties of B /\ el mr) y Scalar product of Bare the vector id '8', ang [x 1 vectors and 8, angle Rieti XQ : em, then their scalar product a = |Z NY thie if 4B,AC are the given vectors, j e030 | Saat _ 7 _-7 Cross product of | axe [ABsined,a isa unit vector | arte perpendisariolinecninga. | estos then B+4C= 4D ‘The vector sum of the three | sides ofa triangle taken in onderis die UraBCs given tangle then iw. cAnt. Ix-sseig (woneredasg onuny 1807) GWT TSAO [SO ‘Scanned with CamScanner| DRs of aline are the no.s which are proportional to the D.Cs of the 1 mare the DCs and. care IRs of line then _ ee TF “iF Fe | ip 2t=4 2-4 and a 4 4 ne { Vector equation of a line passing through the given ines in space which are neither parallel nor intersecting, | point whose postion vectors and parallel oa given different planes. Angle between skew lines isthe angle } 1 vector is ed 10 intersecting lines drawn from any point (origin) parallel = to-each of the skew lines. _I a a ree a _ {Vector equation of line which passes through | #Skew Equation of | two points whose postion vectors are Band 6 is lines line Vector | as Faaeng-@ Fly my Moly my mare the DCs and ay by 6B 6 are the D.Rs ofthe two lines ands the acute angle between them, then cos -+ mm, + m= ‘Angle between ihe ee f “Equation of a line through point (xy yy 2) and | having DOsL nis iaP—Hin FA, cpu fate a through to points eo Dimens Gass yon ane nS —_ iy A ey ceomet; = ‘Scanned wih CamScanneres a with finding the optimal value | function) subject to the conditions that the | negative and satisfy a s \ vear constraints). Variables are sor | J Tneorem 1 : Let R be the feasible region (convex polygon) for a P and let Z=ax+by be the objective function. When Z has an value (max. or min.), where the variables x.y are subject astraints described by linear inequalities, this optimal falue must occur at a corner point (vertex) ofthe feasible region, ‘Theorem 2: Let R be the feasible region for a LPP, and let Z=ax+by | jective function. If Ris bounded then the obj | a PrcccaceaiaaciatiiaiasanTaahaeaasensest, Se a soar eda is Satoe, | Definition The common region determined by all the ) Gin adores sta ert) ot | constraints including the non-negative constraint | q 20, al ible region | lc region is unbounded, then a max. or a min, may not Solution of 20 af a LEB is called the feasible region must occur at a comer point of R. En eame tay aLPR ‘Corner point jon. Any point in the feasible region that gives ‘method the optimal value (max. or min.) of the objective penn reesninnnen, function is called an optimal solution. 1. Find the feasible region of the linear programming problem and. eg : Max Z = 250x + 75y , subject to the || determine its comer points (vertices) either by inspection or by | scvig the ho usone the lines intersecting tha poi. | Consents Ses yc 100 2. Evaluate the objective function Z = ax+by at each corner point. | i y20,y20 isan LER [ethtandmropectvely dente he rps and salt vals of | these point hen feasible region is bounded, M and m are the maximum \d minimum values of Z ., the feasible region is unbounded, we have: | 4. (a) Mis the maximum value of Z, if the open half plane determined | ty aetysiftasn pintin common withthe ease eon Otherwise, Z has no maximum value. the open half plane in common with the feasible region. Otherwise, Z has no minimum value. SOLLVWSHLVN ‘Scanned with CamScanner) ‘The probability of the event E is called the conditional probability of \ ‘The probability distribution of a random | E given that F has already occurred, and is denoted by P(E/F). Also, IF, E, .-- » E, are events which constitute a variable x is the system of numbers | partition of sample space P(ENF) prirwise disjoint and £,UE, —F mere Gy neo meabanyerewiteoron pmb, | Fee — PEALE) 4 2 “m 0¢ P(E/F)s1, P(EY F)=1- P(E/F) then P(E, / A) n=1,2,3. Gm) P(EJP(ATE) P(E UF)/G) = P(E/G)+ P(F/G)- P(EnF)/G) J P(EOF)= P(E)P(F/E),P(E)#0 nye ee Condit | Gs) POE NE)=P@)PEIF)P(F)e0 7 3 4 | egsit PUA) PB) and PAB) then {Let bea random variable whose possible | Probability B 8 | Distribution (408) _B_4 5 | values x, x, ....%,occur with probabilities | pica cits | pire ra) 3 , pa respectively. Then, mean of Bayes! PoP t f ‘Theorem L 1. .tis also called the expectation | os = | Mean ofa random IfE and Fare independent, then } ere ais } jvariable P(EME)=PCE)P(F), P(E-F)=P(E), PIF) #0 an all Independent “and P(E—F/=PIL), PO) PIE) 20. Event (C are mutually independent events then AB)=P(A) PB) PIANC) =P(A).P(C) | P(BAC)=P(B).P(C) | Random (iv) PAMBNC)=PCA)PB).P(C) | qecuble Theorem of _—- total probabil { Real valued function | } : , wanE,) be a partition | {Real valued funtion J whose domain is the | roPabilig, of a sample space 'S' and suppose | sample space of a | wv that each of E, Ey .wE, has non-zer random experiment. | = probability. Let ‘A’ be any event associated with S, then P(A) = PCE, ‘Scanned wih CemScanner