Scribd
Importer
10 vues21 pages

Maths Cet

cet

Transféré par

BCA SY 63 Aaditi Ranaware
Copyright
© All Rights Reserved
Nous prenons très au sérieux les droits relatifs au contenu. Si vous pensez qu’il s’agit de votre contenu, signalez une atteinte au droit d’auteur ici.
Formats disponibles
Téléchargez aux formats PDF ou lisez en ligne sur Scribd
10 vues21 pages

Maths Cet

cet

Transféré par

BCA SY 63 Aaditi Ranaware
Copyright
© All Rights Reserved
Nous prenons très au sérieux les droits relatifs au contenu. Si vous pensez qu’il s’agit de votre contenu, signalez une atteinte au droit d’auteur ici.
Formats disponibles
Téléchargez aux formats PDF ou lisez en ligne sur Scribd
cuapTer (paviitiaablntiictte Sets and Cartesian Product of Sets USet In our mathematical language, everything in this universe whether living or non-living is called an object. If we consider a collection of objects given in such a way that it is possible to tell beyond doubt, whether a given object is in the collection under consideration or not, then such a collection of objects is called a well-defined collection of (2) Definition Any Collection of well defined objects is called a set. By ‘well-defined objects’, we mean that given a set and an object, it must be possible to decide whether or not the object belongs to the set ‘The objects in set are called its members or elements. (b) Notations Sets are usually denoted by capital letters A, B, C etc. and their elements by small letters a, b, c, ete. Let A be any set of objects and let a be a member of A, then we write ae A and read it as “a belongs to A” or ‘a is an element of A’ or ‘a is member of A’. If a is not an object of A, then we write a ¢ A and read as ‘a does not belong to A’ or ‘a is not an element of A’ or ‘a is not member of A’. eg. 1 The collection of first five prime numbers is a set containing the elements 2, 3, 5,7, 1. e.g..2 The collection of good cricket players of India is not 4 set, since the term "good player is vague and it is not well-defined.” 1 Set Builder Form In this method, instead of listing all elements of a set, we write the set by some special property or properties satisfied by all elements and write it as, A= (x: PG) = (x1 x has the property P(x)) and read it as ‘A is the set of all elements x such that x has the property P'. The symbol *:" or ‘I’ stands for ‘such that’, eg, If A=(1, 23,4), then we can write, A={xeNx<3) 1 Empty Set 'A set consisting of no element is called an empty set or ‘null set or void set and is denoted by the symbol @ or { } e841 (x:xEN,3 A set which has atleast one element is called a non-empty set, ‘The set (0) is not an empty set as it contains the element 0 (cero). 4 Tho set (9) is not 2 null set It is.» set containing one element @ I Singleton Set_ ==K set consisting of only one element is called a singleton set e.g, The set (3) isa singleton set I Finite Set ‘A set in which the process of counting of elements surely comes t0 an end is called a finite set. eg 1 Set of all persons on the earth. eg.2 (xixel, xis. factor of 1000} 1 Infinite set ‘A set which is not finite is called an infinite set. In other words, a set in which the process of counting of elements does not come to an end is called an infinite set. e841 Set of all points in a plane. eg.2 (xeQ: 0y eA, then A and B are equal eg. 1 (4,8, 10) = (8,4, 10) {The order in which the elements of a set is also immaterial] —— 4)! CHAPTER = Sots and Cartesian Product of Sets eee? (247) [Link],2) {The repetition of elements ofa set is also immaterial} CDOS 1 Equivalent Sets ‘Two finite sets A and B are said to be i ii ate 0 be equivalent, if ‘x ond ‘equal sets are equivalent but equivalent sets need. Equivalence of two Sets is denoted by bay q ; yy the symbol ‘~". ‘Thus, if A and B are equivalent sets, we wile AB which is read as ‘A is equivalent to B’. 1,2,3), B= (2, 3,5), then n(A)=3, n(B)=3. ‘Since, n(A)=n(B), therefore A and B are equivalent and we write A ~ B. 1 Subset The set B is said to be subset of set A, if every element Of set B is also an clement of set A. Symbolically we write it a, BOAorADB @ BC Ais read as B is contained in A or B is subset of A (ii) A.D Bis read as A contains B or B is a subset of A Evidently ifA and B are two sets such that x¢B =3 x€ A, - B is subset of A. The symbol '=' stands for ‘implies’. We it as x belongs to B implies that x belongs to A. Gy Let =(1,2,3,4);B Here, B is a subset of A. Subset is said to be a proper subset of set A, if every B is an element of A whereas every element of of B. Bc Aand read it as ‘B is a proper subset subset of A, if every element of B there is atleast one element in A which be., every set is a subset of itself but B= (1,2), then BOA 1 Power Set The set formed by all the subsets of a given set A is called the power set of A, it is usually denoted by P(A). 8 IA = (1, 2, 3), then PIA) = (, (1}, {2}, (3), (1, 2), (2,3), (3, 1), (1,2, 3)) Some Results on Subsets () Every set is a subset of itself (i) The empty set is a subset of every set Gii) The total number of subset of infinite set containing ‘nelement in 2". 1 Comparable Sets ‘Two sets A and B are said to be comparable, if one of them, is a subset of the other ie., either AC BorBOA e.g.,The sets (1, 2,3) and (1, 2, 3, 4, 5) are comparable sets. 1 Universal Set In any discussion in set theory, there always happens to be a set that containa all the ects wader coumideation ia, tle fl super set of each of the given sets. Such a set is called the universal set and is denoted by U. ’ [Link]=(2,4,5), B=(1, 3,5}. C= (35,7, 1}, D= (2,4, 8, 10) and U= (1, 2, 3,4, 5,6, 7.8, 10, 11} be the given sets. Here, the sets A, B, C, D are subsets of the set U. Hence, U is a universal set. 1 Operations on Sets Now, we introduce some operations on sets to cons new sets from the given below @ Union of sets The union of two sets A and B, by AU Bis the set of all those elements, each one: is either in A or in B or in both A and B. Thus, =AUB=(x:xeAorxe B) Clearly, xe AUB => xe AorxeB And, = x€AUB>x€AorxeB In the figure, the shaded part represents AU B. It is evident that AC AUB, BC AUB 684 IFA = (1, 2,3) and B=(1, 3, 5,7), then AUB=(1,2,3,5,7) (i) Intersection of sets The intersection of two sets and B, denoted by AM Bis the set of all el common to both A and B. ‘Thus, AN B=(x: xe AandxeB) Clearly, xe ANB => xe AandxeB And, x€AQB => x€AandxeB In the figure, the shaded part represents ANB. Wis evident that AMBCA, ANB CB. eg IFA = (1, 23,4) and B= (2,4, 6), then AB=(2,4) Gil) Disjoint sets Two sets A and B are said to be disjoint, if AQB=[Link] ADB 4,then A and B are said to be intersecting or overlapping sets. eg A= (1.23.4, (7,8,9, 10,11) and C= (6,8, 10, 12, 14), then A and B are disjoint sets, while A and C are intersecting sets. iv) Difference of sets If A and B are two sets, then their difference A — B is the set of all those elements of A which do not belong to B. Thus, A-B= (x:xeAandxeB) Clearly, x€A-B > xe AandxeB 2). In the figure, the shaded part represents A B. Similarly, the difference B — A is the set of all those elements of B that do not belong to A ie., ces oe | In the figure, the shaded part represents B — A. egulfA = (1,3, 5, 7,9) and B= (2, 3,5,7, U1) then ‘A-B=(1,9) and B-A=(2, 11). (¥) Symmetric difference of two sets The symmetric difference of two sets A and B denoted by A AB is the set (A~B)U(B-A) Thus, AA B=(A-B)U(B-A) :x€ANB) ony LA 8 The shaded part represents A A B. egafA = (1.2.5, 7,9) and B then AA B=(A~B) U (B-A) 29,11) (vi) Complement of a set Let U be the universal set and ‘AU, then the complement of A, denoted by A’ or U—Aiis defined as A’= (x: x€U and x€ A) Clearly, xe A’ eo x A. The shaded part represents A 2,3, 5,7, Ws 1,9) {2 11) CHAPTER® Sets and Cartesian Product of Sets | 5 e.g..Let U = (x: x isa letter in English alphabet) and A= (x: xisa vowel), then A‘ = (x: x is consonant), 1 Some Results on Complementation The following results are the direction consequences of the definition of the complement of the set. @ u’ Gi) 9 =(nEU: rEg)=U; il) (A’Y = (xeU : x€ A =(xEU; xe A)=A (iv) ANA’ =(xeU re A) O(xEU re Al=o 1 Laws of Algebra of Sets @) Tdempotent Laws (a) AUA=A (b) ANA=A @ Tdentity Laws (a) AUG=A (b) ANU =A (ii) Commutative Laws (@) AUB=BUA (iv) Associative Laws (@) (AUB)UC= AU(BUO) (b) (ANB)NC= ANLBNC) (¥) Distributive Laws (@) AUB) =(AVB)A(AUC) (©) AN(BLO)=(ANB)UANO) (0) De Morgan’s Laws (@) (AUBY =A’ Bt (b) ANB=BOA (b) (An By = AUB" 1 Points to Remember @ (A) +n(B) wi (A) + n(B)—n(ANB) Gi) AVB=(A-B)U(ANB)UB-A) (iv) n(AUB) (A— B)+n(ANB)+n(B=A) (vy) n(A)=n(A-B)+n(ANB) (vi) n(B)=n(B-A)+n(ANB) (vil), MAUBUC) (A) + n(B)+n(C)—2(ANB) —n(BAC)-n(COA)+n(ANBOC) (viii) If A, B. C are finite sets, then n(AU BUC) = ANBNC)+MA' OBC) $n( A ABAC) +n(A'ABOC)HMADB OC) $n(ANBOC) +A OB OC) 6 | CHAPTER = Sets and Cartesian Product of Sets 1 Ordered Pair Two elements a and 6, listed in a specifi ordered pair. denoted by (a, b). In an onired pal Gran regarded as the first element and b the second element, It is evident from the definition that (a) (a,b) # (b, a) () (a,b) = (c,d), iffa=c,b=d, 4 Cartesian Product of Sets Let A and B be two non-empty sets. The cartesian product of A and B denoted by A x B is defined as the set of all ordered pairs (a, b), where a € A and be B. Symbolically, AX B= ((a, b);a€ A and be B} €.8., (i) Suppose A = (1, 2,3) and B= {x, y) Then, AxB = ((1, x) (1, y) (2 9, 2 y). 32, YD) and BxA=(& 1), (& 2) & 3) OD, 02.3) Note that, if A# B,then AxB# BX A. If there are three sets’A, B, C and a€A, beB, ‘EC, then we form an ordered triplet (a, b,c). The set of all ordered triplets (a, b, c) is called the cartesian product of these sets A, B and C. AXBXC={(a, b, 0): a€ A, bEB,ceC) 1. The set of intelligent students in a class is ~ @ anmull set (®) a singleton set finite set | ® aot a well-defined collection az ich of the following is the empty set? (x: risa real number and x -1=0) (b) (x is areal number and 2’ +1 (© fe: xis a real number and 2 {oes xis a real number and. =.+2) On ee tad op a Te ©) (14,34) © G3) @ (4) Ifa set A has n clements, then the total number of 4 ubsets of A is , © ©2 (d) 20 The mumber of proper subsets of the set (1, 2, 3) is @ 8 ) 7 © 6 @ 5 Given the sets A=(1, 2, 3), B=(3, 4), C=(4, 5, 6), men AU(BNC) is 3) () (1,2,3,4) 24,5) IGraph of Ax B Let A and B be two non-empty subsets of R. Then, raph of A x B is the set of all points in the plane repr by the ordered pairs of A x B. eguletA = (12.3) 4, 5), then AXB= ((, (4), 5.2, 3.2.4) 2 68.48, ‘Some Results on Cartesian Products of Sets AxBUAXO @ (a) AxBYO= (b) Ax(BNO) (iy) Ax(B-O=AXB)-(AXO (i) (AXB)N(CXD)=(ANOXBOD) (iv) If Ac Band C. ro _1ITAS 2 MG, aM =", =: ight 321 Hence, (b) is the correct option. 816 Example 15 How many different 4 letter words can be formed with the letters of the word ‘JAIPUR’ when A and I are always to be included ? wa 4 (20 Solution Since, A and I are always to be included, so frst we select 2 leters from the remaining 4, which can be done in *C; =6 ways. Now, these 4 letters can arranged 4'= 24 ways, so the required number = 6x24 = 144, Hence, (4) is the correct option. (i) Selection of objects with repetition The total number of selections of r things from n different things when each thing may be repeated any number of times is" 'C, Example 16 8 pens are to be selected from pens of 3 colours (pens of each colour being available any number of times), then total number of selections is (45 9 @ 144 (©) 180 (28 Hence, (a) 1s the correct option, (ii) Restricted selection / arrangement (a), The number of combinations of n different things taken + at a time, ‘© when £ particular objects occur is." '¢ ‘© when { particular objects never occur is ‘C, (©) The number of arrangements of n distinct objects taken r at atime so that k particular object are ‘always included =*'C, , or! rsp PEE Pe eC if r>p ae ron ‘is to be selected. The momber of ways in which the committee can ‘be formed 20 that gentlemen are in majority ie @o (b) 156 (@) None of these stated as the total number of combination of m different things. Example 1B Ramesh has 6 friends. In how many [Link] he invite one or more of them atthe dinner? @ 6 ©) 62 ©) 63 Solution He can invite one, two. three, four, five or six friends at ‘the dinner. So, total number of ways of his invitation SECC: HC HC HC HC, =2-1263 Hence, (c) is the correct option. (¥) Selection from identical objects (@) The number of combination of n identical things taking r(r Py ae the probabilites of m imdepenta vents A; Ay Ay AL then the probably of bpp at least one of these event is 1-10, )0-p,) -pD) PIA, +A, + Ast. +A,) =1- PIA) PAD PAP Example 13 A probalem of mathematic is given to three sas A. Band C. Whose chances of solving it are U2, V3 mt respectively. Then, probability that the problem is soves Solution Obviously the events of solving the problem by 4 B= C are independent. Therefore required probability eH UConditional Probability Conditional probability If A and B are any events ‘2S 3 the conditional probability of B relative to A is given by P(B/ a) =PBOA) PA) + if A)20 ent events If the occurrence of the event A does ‘on the occurrence or the non-occurrence of the ‘A and B are said to be independent events, P(B) and P{A/B) = P(A) 18 toxsed thrice. I E be the event of showing vd F the event of showing head in the first mi (5) are following 8 outcomes of three throws: HHH, 4 a 2 MEO F)= 5 and POF) = 8 probability = a Two dice are thrown. Find the probability that the appeared has a sum of 8 if it is known that the second ays exhibits 4 et A be the event of occurence of 4 always on the second = (C1, 9) 2,4) 8,4), 4,4) 5,4), 6 4)) nA be the event of occurence of such numbers on both dice ‘sum is 8={(4, 4)} AO B= Aa((44)) (4,4) MANB)=1 ) mAnB)_| nay 6 Inequality or any {wo events A and B PAU B) = PIA) + PB) ~ PAB) AAU B)SPA)+ PB) (s PAMB)20) or any three events A, B and C PAU BU C)S P(A) + PCB) + PC) general for any m events Ay, Ay ov Ay PIA, UA, U .. UAL) S PCA) + PCA) + = + PLA) 2 3G 1 rv0 events such thar PCA)=1 and P(B)= 5+ find PAG B)> UB) = Pia) + PUB) ~ PAB) y Pans! 3 2 iy PAW 2 PB) > PALB ES Let A,, A, .. A, be mutually exclusive and exhaustive events of the sample space 5 and A is event which can occur with any of the events, then a} AY Spay AIA) Example 17. A bag A contains 2 white and 3 red balls and « bag B contains 4 white and $ red bolls. One hall is drawn at random ‘from one of the bags and itis found 10 be red. Find the probably ‘that it was drawn from the bag B. Solution Let E,= The event of ball being drawn from bag A E, = The event of ball being drawn from bag B E = The event of ball being red Since, both the bags are equally likely to be selected, therefore P(A) PLATA) 1 E)3 0, fe )S P(E) =PUE)= 4 and dE}: aod of Eo 3 E s P(E) EB a E FY TS 7e ney eZ pre-e e | 2st3%9 \_LBiniomial Distribution for Repeated Trials Binomial experiment Any experiment which has only wo ‘outcomes is known as binomial experiment. Outcomes of such an experiment are known as success of success is denoted by p and probability of failure by 4. p+qzl If binomial experiment is repeated 1 times, then Prager Cer + Org * tC pg + HC al Probability of exactly r successes inn wials ="C, 7° Probability of at most r successes in m trails = "Ge & Probability of atleast r successes in m trials = "Ge" & Probability of having Ist success at the rth trials = p q” The mean the variance and the standard deviation of binomial distribution are np, mpq. Jnpa —_—_ G78 | CHAPTER = Probability and Probabiity Distribution Example 18 Two dice are tossed four times find the probability of seating (equal digits exactly two times Gi) equa digits at least two times (Gi) equal digits at the most two times Solution Let A be the event of getting equal digits on the dice. Since, rrumber of exhaustive cases is 36 and favourable cases is 6. ane 1s Plays pa Set, pAyaget- tad BO mag ge sealaces “IOI CEE ‘Thus, from above result, we have (@ Probability of getting equal digits exactly two times a'¢(5) (1-25 “(@)(¢) (i) Probability of getting equal digits at least two times Wc (SV LY ac (SY¥1 1y tal elle] tales] +e CIOROOkG) 2s Lomi 1296 ii) Probability of getting equal digits at the most two times (5) 02) (D eo (2) (2 sO he GIGaeGIG) = 625, 500 , 150 _1275 “i296 * i296 *1296 ~ 1296 1 Some Important Results @ Let A and B be two events, then (@ P(A)+ P(A) () PA +B)=1- (AB) P(AB) P(B) (@) P(A+B)=P(AB)+P(AB)+P(AB) (©) ACB= P(A)< P(B) (f) P(AB)= P(B)- P(AB) (@) PAB) < P(A) PIB) < P(A + B) < P(A) + PCB) (h) ‘PCAB) = P(A) + PCB) - PA + B) es © Plexactly one event) = P(A B)+P(A B) (A) +P (B)-2P(AB) = P(A+B)-P(AB) (© P(A/B)= () Pincither A nor B) = P(A By = pry (K) P(A +B) =1~P(AB) i {iy Number of exhaustive cares of toning simultaneously (or of tossing a coin n tim Gli) Number of exhaustive cases of 1 simultaneously (or throwing one dice 1 tim (iv) Playing Cards (a) Total cards 52(26 red, 26 black) (b) Four suits Heart, Diamond, Spade, Club. each, (©) Court cards 12 (4 kings, 4 queens, 4 jac (4) Honour cards 16 (4 aces, 4 kings, 4 4 jacks) (v) Probability regarding 1 letters and thetr en If n letters corresponding to n envelopes are; in the envelopes at random, then (@) Probability that all letters are in right e 1 nie (© Probability that no letters is in right e eet “ata @ Probability that exactly r letters are im; envelopes =e © ri2t Example 19 There are four letters and four envelopes, the lt are placed into the envelopes at random, find the - «ll lentes are placed in the wrong envelope. Solution We know, from the above given formula that peo that no letter is in right envelope out of n letters and n ex is given by 1 1 faded +or'3] Since, all 4 letters are to be placed in wrong envelopes, required probability : | Measures of Central Tendency ‘An average or a central value of tribution is the value | Arithmetic Mean (i) Individual series If x,, x, ..... x, are n values of a ‘variate x, then their arithmetic mean z is defined as yoAthtares ly, (ii) Discrete or continuous series If a variable takes Values 2), X...%, with corresponding frequencies f,, fy, ... f, then the Arithmetic mean = is given by GRF LA HAGE, = fats a LY 5 where N= see hett he WA yy Example 1 ‘Find the arithmetic mean of the following frequency tribution Solution I f=4+5+6+ 10+20=45 LS = SA) +B x 5) + (11 x 6) + (14 x 10) + (17 x 20) = 606 Zsa _ 606 _ 5-7 9571347 (ii) Short method If the values of x or (and) f are large the caleulation of arithmetic mean by the previous formula used, ‘is quite tedious and time consuming. In such case we take

Vous aimerez peut-être aussi