•  
agra,ahmedabad,ajmer,akola,aligarh,ambala,amravati,amritsar,aurangabad,ayodhya,bangalore,bareilly,bathinda,bhagalpur,bhilai,bhiwani,bhopal,bhubaneswar,bikaner,bilaspur,bokaro,chandigarh,chennai,coimbatore,cuttack,dehradun,delhi ncr,dhanbad,dibrugarh,durgapur,faridabad,ferozpur,gandhinagar,gaya,ghaziabad,goa,gorakhpur,greater noida,gurugram,guwahati,gwalior,haldwani,haridwar,hisar,hyderabad,indore,jabalpur,jaipur,jalandhar,jammu,jamshedpur,jhansi,jodhpur,jorhat,kaithal,kanpur,karimnagar,karnal,kashipur,khammam,kharagpur,kochi,kolhapur,kolkata,kota,kottayam,kozhikode,kurnool,kurukshetra,latur,lucknow,ludhiana,madurai,mangaluru,mathura,meerut,moradabad,mumbai,muzaffarpur,mysore,nagpur,nanded,narnaul,nashik,nellore,noida,palwal,panchkula,panipat,pathankot,patiala,patna,prayagraj,puducherry,pune,raipur,rajahmundry,ranchi,rewa,rewari,rohtak,rudrapur,saharanpur,salem,secunderabad,silchar,siliguri,sirsa,solapur,sri-ganganagar,srinagar,surat,thrissur,tinsukia,tiruchirapalli,tirupati,trivandrum,udaipur,udhampur,ujjain,vadodara,vapi,varanasi,vellore,vijayawada,visakhapatnam,warangal,yamuna-nagar

Operation on Sets

Operation on Sets

We all have read fundamental operations (like addition, subtraction) on numbers in our earlier classes. Similar to this we have some operations which are done on the sets. Let us consider two sets A and B, addition of these two sets is nothing but the union as shown in the figure below.

undefined
                                                 Fig :Operation on two sets

Let’s proceed to understand some ways to establish a relation & perform operations on different sets.

Table of contents

  • Operations on sets
  • Laws of Algebra of sets
  • Practice Problems
  • FAQ’s

Operations on sets

  • Union of sets

If set M and set N are two sets, then M union N will contain all the elements of set M and set N. It is denoted as M ∪ N.

Example: Let M={u,v,x} and N={l,m,n}, then M ∪ N={l,m,n,u,v,x}

  • Intersection of sets

The intersection of A and B is the set of all those elements that are common to both A and 𝐵. It is represented as 𝐴 ∩ 𝐵 and read as “𝐴 intersection 𝐵”.

Example:Let A={1,2,3,5,6,9}, B={2,3,4,5,7,8,10} then 𝐴 ∩ B={2,3,5}

  • Complement of a set

The complement of any set, say A, is the set of all the elements in the universal set which are not there in set A. The complement of a set is denoted by A’ or Ac

Properties of Complement sets

  1. A ∪ A'=U
  2. A ∩ A'= Φ
  3. Law of double complement is (A’ )′ =A
  4. Laws of empty/null set (Φ) and universal set (U), Φ′ =U and U'= Φ.
  • Difference of sets

If set P and set Q are any two given sets, then set P difference set Q is a set containing elements of P but no elements of Q. It is denoted as P – Q

Example: P={1,2,3} and Q={2,3,4}

P – Q={1}

  • Symmetric difference of sets

Symmetric difference of sets 𝐴 and 𝐵 i.e. 𝐴 ∆ B= {elements which are EITHER in 𝐴 and not in 𝐵 OR in 𝐵 and not in 𝐴.}

𝐴 ∆ B= {all those elements which belong in EITHER 𝐴−𝐵 OR in 𝐵−𝐴.}

𝐴 ∆ B= (𝐴−𝐵) ∪ (𝐵−𝐴)

For example, Let A=1,2,3,4,5,6,7,8, B=1,3,5,6,7,8,9

A-B={2,4} & B-A={9}

Since, 𝐴 ∆ B= (𝐴−𝐵) ∪ (𝐵−𝐴)

AB=2,4  9=2,4,9

Note:These laws are not only used in sets but are also used in Probability,complex numbers etc.

Practice Problems

Example : If <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi><mo>=</mo><mfenced open="{" close="}"><mrow><msup><mn>4</mn><mi>n</mi></msup><mo>-</mo><mn>3</mn><mi>n</mi><mo>-</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>&#x2208;</mo><mi>N</mi></mrow></mfenced></math>and <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>Y</mi><mo>=</mo><mfenced open="{" close="}"><mrow><mn>9</mn><mo>(</mo><mi>n</mi><mo>-</mo><mn>1</mn><mo>)</mo><mo>:</mo><mi>n</mi><mo>&#x2208;</mo><mi>N</mi></mrow></mfenced></math>, where N is a set of natural numbers. Then <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi><mo>&#x222A;</mo><mi>Y</mi></math> is equal to:

a. X
b. Y
c. N
d. Y-X

Solution:

Given <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi><mo>=</mo><mfenced open="{" close="}"><mrow><msup><mn>4</mn><mi>n</mi></msup><mo>-</mo><mn>3</mn><mi>n</mi><mo>-</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>&#x2208;</mo><mi>N</mi></mrow></mfenced></math> .

Putting some values of natural numbers, we get X={0,9,54,243}

Similarly Y={0,9,18,27,36,45,54}.

It is clear that X and Y both contain multiples of 9 and Y is the superset of X (i.e., Every element of X belongs in the set Y)

Hence X U Y= Y.

Example :

<math xmlns="http://www.w3.org/1998/Math/MathML"><mi>L</mi><mi>e</mi><mi>t</mi><mo>&#xA0;</mo><mi>S</mi><mo>=</mo><mrow><mi>x</mi><mo>&#x2208;</mo><mi>R</mi><mo>:</mo><mi>x</mi><mo>&#x2265;</mo><mn>0</mn><mo>&#xA0;</mo><mi>a</mi><mi>n</mi><mi>d</mi><mo>&#xA0;</mo><mn>2</mn><mfenced open="|" close="|"><mrow><msqrt><mi>x</mi></msqrt><mo>-</mo><mn>3</mn></mrow></mfenced><mo>+</mo><msqrt><mi>x</mi></msqrt><mo>(</mo><msqrt><mi>x</mi></msqrt><mo>&#x2212;</mo><mn>6</mn><mo>)</mo><mo>+</mo><mn>6</mn><mo>=</mo><mn>0</mn></mrow><mo>.</mo><mi>T</mi><mi>h</mi><mi>e</mi><mi>n</mi><mo>&#xA0;</mo><mi>S</mi><mo>:</mo><mspace linebreak="newline"/><mo>(</mo><mi>a</mi><mo>)</mo><mi>i</mi><mi>s</mi><mo>&#xA0;</mo><mi>a</mi><mi>n</mi><mo>&#xA0;</mo><mi>e</mi><mi>m</mi><mi>p</mi><mi>t</mi><mi>y</mi><mo>&#xA0;</mo><mi>s</mi><mi>e</mi><mi>t</mi><mspace linebreak="newline"/><mo>(</mo><mi>b</mi><mo>)</mo><mi>c</mi><mi>o</mi><mi>n</mi><mi>t</mi><mi>a</mi><mi>i</mi><mi>n</mi><mi>s</mi><mo>&#xA0;</mo><mi>e</mi><mi>x</mi><mi>a</mi><mi>c</mi><mi>t</mi><mi>l</mi><mi>y</mi><mo>&#xA0;</mo><mi>o</mi><mi>n</mi><mi>e</mi><mo>&#xA0;</mo><mi>e</mi><mi>l</mi><mi>e</mi><mi>m</mi><mi>e</mi><mi>n</mi><mi>t</mi><mspace linebreak="newline"/><mo>(</mo><mi>c</mi><mo>)</mo><mi>c</mi><mi>o</mi><mi>n</mi><mi>t</mi><mi>a</mi><mi>i</mi><mi>n</mi><mi>s</mi><mo>&#xA0;</mo><mi>e</mi><mi>x</mi><mi>a</mi><mi>c</mi><mi>t</mi><mi>l</mi><mi>y</mi><mo>&#xA0;</mo><mi>t</mi><mi>w</mi><mi>o</mi><mo>&#xA0;</mo><mi>e</mi><mi>l</mi><mi>e</mi><mi>m</mi><mi>e</mi><mi>n</mi><mi>t</mi><mi>s</mi><mspace linebreak="newline"/><mo>(</mo><mi>d</mi><mo>)</mo><mi>c</mi><mi>o</mi><mi>n</mi><mi>t</mi><mi>a</mi><mi>i</mi><mi>n</mi><mi>s</mi><mo>&#xA0;</mo><mi>e</mi><mi>x</mi><mi>a</mi><mi>c</mi><mi>t</mi><mi>l</mi><mi>y</mi><mo>&#xA0;</mo><mi>f</mi><mi>o</mi><mi>u</mi><mi>r</mi><mo>&#xA0;</mo><mi>e</mi><mi>l</mi><mi>e</mi><mi>m</mi><mi>e</mi><mi>n</mi><mi>t</mi><mi>s</mi></math>

<math xmlns="http://www.w3.org/1998/Math/MathML"><mi>S</mi><mi>o</mi><mi>l</mi><mi>u</mi><mi>t</mi><mi>i</mi><mi>o</mi><mi>n</mi><mo>:</mo><mspace linebreak="newline"/><mi>L</mi><mi>e</mi><mi>t</mi><mo>&#xA0;</mo><mi>t</mi><mo>=</mo><msqrt><mi>x</mi></msqrt><mspace linebreak="newline"/><mo>&#x21D2;</mo><mn>2</mn><mfenced open="|" close="|"><mrow><mi>t</mi><mo>-</mo><mn>3</mn></mrow></mfenced><mo>+</mo><msup><mi>t</mi><mn>2</mn></msup><mo>&#x2013;</mo><mn>6</mn><mi>t</mi><mo>+</mo><mn>6</mn><mo>=</mo><mn>0</mn></math>

<math xmlns="http://www.w3.org/1998/Math/MathML"><mi>C</mi><mi>a</mi><mi>s</mi><mi>e</mi><mo>&#xA0;</mo><mn>1</mn><mo>:</mo><mi>W</mi><mi>h</mi><mi>e</mi><mi>n</mi><mo>&#xA0;</mo><mi>t</mi><mo>&lt;</mo><mn>3</mn><mspace linebreak="newline"/><mo>-</mo><mn>2</mn><mi>t</mi><mo>+</mo><mn>6</mn><mo>+</mo><msup><mi>t</mi><mn>2</mn></msup><mo>&#x2013;</mo><mn>6</mn><mi>t</mi><mo>+</mo><mn>6</mn><mo>=</mo><mn>0</mn><mspace linebreak="newline"/><mi>t</mi><mo>=</mo><mn>2</mn><mo>,</mo><mn>6</mn><mo>&#xA0;</mo><mi>b</mi><mi>u</mi><mi>t</mi><mo>&#xA0;</mo><mi>s</mi><mi>i</mi><mi>n</mi><mi>c</mi><mi>e</mi><mo>&#xA0;</mo><mi>t</mi><mo>&lt;</mo><mn>3</mn><mo>,</mo><mspace linebreak="newline"/><mi>H</mi><mi>e</mi><mi>n</mi><mi>c</mi><mi>e</mi><mo>,</mo><mo>&#xA0;</mo><mi>t</mi><mo>=</mo><mn>2</mn><mspace linebreak="newline"/><mo>&#x21D2;</mo><mi>x</mi><mo>=</mo><mn>4</mn><mspace linebreak="newline"/></math>

<math xmlns="http://www.w3.org/1998/Math/MathML"><mi>C</mi><mi>a</mi><mi>s</mi><mi>e</mi><mo>&#xA0;</mo><mn>2</mn><mo>:</mo><mi>W</mi><mi>h</mi><mi>e</mi><mi>n</mi><mo>&#xA0;</mo><mi>t</mi><mo>&#x2265;</mo><mn>3</mn><mspace linebreak="newline"/><mn>2</mn><mi>t</mi><mo>&#x2013;</mo><mn>6</mn><mo>+</mo><msup><mi>t</mi><mn>2</mn></msup><mo>&#x2013;</mo><mn>6</mn><mi>t</mi><mo>+</mo><mn>6</mn><mo>=</mo><mn>0</mn><mspace linebreak="newline"/><mi>t</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>4</mn><mo>&#xA0;</mo><mi>B</mi><mi>u</mi><mi>t</mi><mo>&#xA0;</mo><mi>s</mi><mi>i</mi><mi>n</mi><mi>c</mi><mi>e</mi><mo>&#xA0;</mo><mi>t</mi><mo>&#x2265;</mo><mn>3</mn><mspace linebreak="newline"/><mi>H</mi><mi>e</mi><mi>n</mi><mi>c</mi><mi>e</mi><mo>,</mo><mo>&#xA0;</mo><mi>t</mi><mo>=</mo><mn>4</mn><mspace linebreak="newline"/><mo>&#x21D2;</mo><mi>x</mi><mo>=</mo><mn>16</mn></math>

Hence, <math xmlns="http://www.w3.org/1998/Math/MathML"><mo>&#xA0;</mo><mi>S</mi><mo>=</mo><mfenced open="{" close="}"><mrow><mn>4</mn><mo>,</mo><mn>16</mn></mrow></mfenced></math>. Therefore, option (c) is correct

Example :

<math xmlns="http://www.w3.org/1998/Math/MathML"><mi>L</mi><mi>e</mi><mi>t</mi><mo>&#xA0;</mo><mi>A</mi><mo>&#xA0;</mo><mi>a</mi><mi>n</mi><mi>d</mi><mo>&#xA0;</mo><mi>B</mi><mo>&#xA0;</mo><mi>b</mi><mi>e</mi><mo>&#xA0;</mo><mi>t</mi><mi>w</mi><mi>o</mi><mo>&#xA0;</mo><mi>s</mi><mi>e</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mi>c</mi><mi>o</mi><mi>n</mi><mi>t</mi><mi>a</mi><mi>i</mi><mi>n</mi><mi>i</mi><mi>n</mi><mi>g</mi><mo>&#xA0;</mo><mn>4</mn><mo>&#xA0;</mo><mi>a</mi><mi>n</mi><mi>d</mi><mo>&#xA0;</mo><mn>2</mn><mo>&#xA0;</mo><mi>e</mi><mi>l</mi><mi>e</mi><mi>m</mi><mi>e</mi><mi>n</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mi>r</mi><mi>e</mi><mi>s</mi><mi>p</mi><mi>e</mi><mi>c</mi><mi>t</mi><mi>i</mi><mi>v</mi><mi>e</mi><mi>l</mi><mi>y</mi><mo>.</mo><mo>&#xA0;</mo><mspace linebreak="newline"/><mi>T</mi><mi>h</mi><mi>e</mi><mi>n</mi><mo>&#xA0;</mo><mi>t</mi><mi>h</mi><mi>e</mi><mo>&#xA0;</mo><mi>n</mi><mi>u</mi><mi>m</mi><mi>b</mi><mi>e</mi><mi>r</mi><mo>&#xA0;</mo><mi>o</mi><mi>f</mi><mo>&#xA0;</mo><mi>s</mi><mi>u</mi><mi>b</mi><mi>s</mi><mi>e</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mi>o</mi><mi>f</mi><mo>&#xA0;</mo><mi>t</mi><mi>h</mi><mi>e</mi><mo>&#xA0;</mo><mi>s</mi><mi>e</mi><mi>t</mi><mo>&#xA0;</mo><mi>A</mi><mo>&#xD7;</mo><mi>B</mi><mo>,</mo><mo>&#xA0;</mo><mi>e</mi><mi>a</mi><mi>c</mi><mi>h</mi><mo>&#xA0;</mo><mi>h</mi><mi>a</mi><mi>v</mi><mi>i</mi><mi>n</mi><mi>g</mi><mo>&#xA0;</mo><mi>a</mi><mi>t</mi><mo>&#xA0;</mo><mi>l</mi><mi>e</mi><mi>a</mi><mi>s</mi><mi>t</mi><mo>&#xA0;</mo><mn>3</mn><mo>&#xA0;</mo><mi>e</mi><mi>l</mi><mi>e</mi><mi>m</mi><mi>e</mi><mi>n</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mi>i</mi><mi>s</mi><mspace linebreak="newline"/><mo>(</mo><mi>a</mi><mo>)</mo><mo>&#xA0;</mo><mn>256</mn><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>(</mo><mi>b</mi><mo>)</mo><mo>&#xA0;</mo><mn>275</mn><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>(</mo><mi>c</mi><mo>)</mo><mo>&#xA0;</mo><mn>510</mn><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>&#xA0;</mo><mo>(</mo><mi>d</mi><mo>)</mo><mo>&#xA0;</mo><mn>219</mn></math>

<math xmlns="http://www.w3.org/1998/Math/MathML"><mi>S</mi><mi>o</mi><mi>l</mi><mi>u</mi><mi>t</mi><mi>i</mi><mi>o</mi><mi>n</mi><mo>&#xA0;</mo><mo>:</mo><mspace linebreak="newline"/><mi>n</mi><mo>(</mo><mi>A</mi><mo>)</mo><mo>&#xA0;</mo><mo>=</mo><mo>&#xA0;</mo><mn>4</mn><mo>&#xA0;</mo><mi>a</mi><mi>n</mi><mi>d</mi><mo>&#xA0;</mo><mi>n</mi><mo>(</mo><mi>B</mi><mo>)</mo><mo>&#xA0;</mo><mo>=</mo><mo>&#xA0;</mo><mn>2</mn><mo>&#xA0;</mo><mspace linebreak="newline"/><mi>T</mi><mi>h</mi><mi>e</mi><mi>r</mi><mi>e</mi><mi>f</mi><mi>o</mi><mi>r</mi><mi>e</mi><mo>,</mo><mo>&#xA0;</mo><mi>n</mi><mo>(</mo><mi>A</mi><mo>&#xA0;</mo><mo>&#xD7;</mo><mo>&#xA0;</mo><mi>B</mi><mo>)</mo><mo>&#xA0;</mo><mo>=</mo><mo>&#xA0;</mo><mn>8</mn><mspace linebreak="newline"/><mi>N</mi><mi>o</mi><mi>w</mi><mo>,</mo><mo>&#xA0;</mo><mi>t</mi><mi>o</mi><mi>t</mi><mi>a</mi><mi>l</mi><mo>&#xA0;</mo><mi>n</mi><mi>u</mi><mi>m</mi><mi>b</mi><mi>e</mi><mi>r</mi><mo>&#xA0;</mo><mi>o</mi><mi>f</mi><mo>&#xA0;</mo><mi>s</mi><mi>u</mi><mi>b</mi><mi>s</mi><mi>e</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mi>o</mi><mi>f</mi><mo>&#xA0;</mo><mi>A</mi><mo>&#xD7;</mo><mi>B</mi><mo>=</mo><msup><mn>2</mn><mn>8</mn></msup><mspace linebreak="newline"/><mi>N</mi><mi>u</mi><mi>m</mi><mi>b</mi><mi>e</mi><mi>r</mi><mo>&#xA0;</mo><mi>o</mi><mi>f</mi><mo>&#xA0;</mo><mi>s</mi><mi>u</mi><mi>b</mi><mi>s</mi><mi>e</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mi>h</mi><mi>a</mi><mi>v</mi><mi>i</mi><mi>n</mi><mi>g</mi><mo>&#xA0;</mo><mn>0</mn><mo>&#xA0;</mo><mi>e</mi><mi>l</mi><mi>e</mi><mi>m</mi><mi>e</mi><mi>n</mi><mi>t</mi><mo>=</mo><mo>&#xA0;</mo><mmultiscripts><mi>C</mi><mn>0</mn><none/><mprescripts/><none/><mn>8</mn></mmultiscripts><mo>&#xA0;</mo><mspace linebreak="newline"/><mi>N</mi><mi>u</mi><mi>m</mi><mi>b</mi><mi>e</mi><mi>r</mi><mo>&#xA0;</mo><mi>o</mi><mi>f</mi><mo>&#xA0;</mo><mi>s</mi><mi>u</mi><mi>b</mi><mi>s</mi><mi>e</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mi>h</mi><mi>a</mi><mi>v</mi><mi>i</mi><mi>n</mi><mi>g</mi><mo>&#xA0;</mo><mn>1</mn><mo>&#xA0;</mo><mi>e</mi><mi>l</mi><mi>e</mi><mi>m</mi><mi>e</mi><mi>n</mi><mi>t</mi><mo>=</mo><mo>&#xA0;</mo><mmultiscripts><mi>C</mi><mn>1</mn><none/><mprescripts/><none/><mn>8</mn></mmultiscripts><mo>&#xA0;</mo><mspace linebreak="newline"/><mi>N</mi><mi>u</mi><mi>m</mi><mi>b</mi><mi>e</mi><mi>r</mi><mo>&#xA0;</mo><mi>o</mi><mi>f</mi><mo>&#xA0;</mo><mi>s</mi><mi>u</mi><mi>b</mi><mi>s</mi><mi>e</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mi>h</mi><mi>a</mi><mi>v</mi><mi>i</mi><mi>n</mi><mi>g</mi><mo>&#xA0;</mo><mn>2</mn><mo>&#xA0;</mo><mi>e</mi><mi>l</mi><mi>e</mi><mi>m</mi><mi>e</mi><mi>n</mi><mi>t</mi><mi>s</mi><mo>=</mo><mo>&#xA0;</mo><mmultiscripts><mi>C</mi><mn>2</mn><none/><mprescripts/><none/><mn>8</mn></mmultiscripts><mspace linebreak="newline"/><mo>&#x2234;</mo><mi>N</mi><mi>u</mi><mi>m</mi><mi>b</mi><mi>e</mi><mi>r</mi><mo>&#xA0;</mo><mi>o</mi><mi>f</mi><mo>&#xA0;</mo><mi>s</mi><mi>u</mi><mi>b</mi><mi>s</mi><mi>e</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mi>o</mi><mi>f</mi><mo>&#xA0;</mo><mi>A</mi><mo>&#xA0;</mo><mo>&#xD7;</mo><mo>&#xA0;</mo><mi>B</mi><mo>&#xA0;</mo><mi>h</mi><mi>a</mi><mi>v</mi><mi>i</mi><mi>n</mi><mi>g</mi><mo>&#xA0;</mo><mi>a</mi><mi>t</mi><mi>l</mi><mi>e</mi><mi>a</mi><mi>s</mi><mi>t</mi><mo>&#xA0;</mo><mn>3</mn><mo>&#xA0;</mo><mi>e</mi><mi>l</mi><mi>e</mi><mi>m</mi><mi>e</mi><mi>n</mi><mi>t</mi><mi>s</mi><mo>&#xA0;</mo><mo>=</mo><mo>&#xA0;</mo><msup><mn>2</mn><mn>8</mn></msup><mo>&#xA0;</mo><mo>&#x2013;</mo><mo>&#xA0;</mo><mmultiscripts><mi>C</mi><mn>0</mn><none/><mprescripts/><none/><mn>8</mn></mmultiscripts><mo>&#xA0;</mo><mo>&#x2013;</mo><mo>&#xA0;</mo><mmultiscripts><mi>C</mi><mn>1</mn><none/><mprescripts/><none/><mn>8</mn></mmultiscripts><mo>&#xA0;</mo><mo>&#x2013;</mo><mo>&#xA0;</mo><mmultiscripts><mi>C</mi><mn>2</mn><none/><mprescripts/><none/><mn>8</mn></mmultiscripts><mo>&#xA0;</mo><mspace linebreak="newline"/><mo>=</mo><mo>&#xA0;</mo><mn>256</mn><mo>&#xA0;</mo><mo>&#x2013;</mo><mo>&#xA0;</mo><mn>1</mn><mo>&#xA0;</mo><mo>&#x2013;</mo><mo>&#xA0;</mo><mn>8</mn><mo>&#xA0;</mo><mo>&#x2013;</mo><mo>&#xA0;</mo><mn>28</mn><mspace linebreak="newline"/><mo>=</mo><mn>219</mn><mspace linebreak="newline"/></math>

Example : If U={1, 3, 5, 7, 9, 11}, A={3, 5} and B={5, 7, 9}, then verify De Morgan's law.

Solution :

According to De Morgan's

  • (A  B)=AB
  • (AB)'=A'B'

Case (i)Verifying (A ∪ B)’=A’ ∩ B’

Solving LHS, (A  B)=3, 5, 7, 9 (A  B)=U-(AB)=1,11

Solving RHS, A=1,7,9,11 and B'=1, 3, 11

AB=1,11

Since, LHS = RHS, De Morgan’s law is verified.

Case (ii) Verifying (AB)'=A'B'

Solving LHS, (AB)=5(A  B)'=U-(AB)=1,3,7,9,11

Solving RHS, A=1,7,9,11 and B'=1, 3, 11

AB=1,3,7,9,11

Since, LHS = RHS, De Morgan’s law is verified.

Example : If A=x\∶ x=5n, nN, B=3,6,9,12,15,18,21,24,27,30 and C={15,30,45}. Find A(BC).

Solution :

A=5,10,15,20,25,30,  . . . . .}

Also, given that B={3,6,9,12,15,18,21,24,27,30} & C={15,30,45}

From the distributive law of sets A(BC)=(AB)(AC)

AB={15,30} & AC={15,30,45}

A(BC)=(AB)(AC)=15,3015,30,45=15,30,45

FAQ’s

1.How to take union and intersection of three or more sets?
Answer: Take pairs of sets together and use union or intersection, whichever is required and then take the outcomes together to solve further.

2.Are Tabular and Roaster forms the same or different?
Answer: They are just different names of representing a set in listed form. Hence they are the same.

3.What are the further applications of laws of algebra of sets?
Answer: Laws of algebra of sets are widely used in Permutations & Combinations & Probability.

4.What are the uses of Venn diagrams in sets?
Answer: A Venn diagram is a pictorial representation of the relationship between two or more sets.It makes the solution easier to analyze and solve.

Talk to Our Expert Request Call Back
Resend OTP Timer =
By submitting up, I agree to receive all the Whatsapp communication on my registered number and Aakash terms and conditions and privacy policy