Chapter#2 (Set, Group, Function & Logic)
Chapter#2 (Set, Group, Function & Logic)
https://www.facebook.com/ecat.netprep/
CHAPTER 02
(Sets, Functions, Groups and logics)
Following are the key points that should be kept in mind
while preparing this chapter for Entry Test.
If n(A)=n then:
1) Total Subsets= 2n
2) Total Proper Subsets=2n-1
3) Total Non-empty Proper Subset=2n-2
4) Every set is a subset and superset of itself.
5) The empty set is subset of every set
6) “Cardinality” means number of elements present in a
set.
7) “Tabular form” for representation of a set is also
known as “Roster Form”.
8) “Set Builder form” for representation of a set is also
known as “Rule Method”.
Let n(A)=m and n(B)=n
9) No. of Functions= nm
10) No. of Relations/Correspondence= 2m×n
11) No. of Bijective Function=nPn =n! whereas n=m
12) No. of One-to-One Function= nPm ; n≥m
13) If A has n elements and B has m elements then A×B
has m×n elements.
14) No. of relation in the distinct set is given by 2
15) Any Conditional and its contrapositive are equivalent.
16) The converse and inverse are equivalent.
17) All sets of residue classes under addition are groups.
18) All sets of residue classes excluding 0 under
multiplication are groups.
ii) Ran(R-1)=Domain
iii) (R-1)-1=R
Function:
-Conditions:
Let X and Y be two non-empty sets such that
1) f is relation from A to B (i.e f ⊆A×B)
2)Dom f=A
3) First Element of order pairs don’t repeat.
Then f is called a function from A to B.
The function f is also written as f:AB.
Example: X={1,2,3} , Y={2,4,7}
By arrow diagram as shown below:
Types of Function:
Into Function: A function is called into function if each
element of the 1st set is mapped to just one element of
the 2nd set.
OR If “f” is a function from set A to set B i.e
f:AB such that Range f is subset of B.
i.e Range f≠B , then the function is called an into
function from A to B.
Example: f= {(1,2),(3,4) ,(5,6)
As Range f=B
So that f is called as Onto or surjective function.
1-1 and into (Injective) Function:
A function is called (1-1) and into function if the
different elements have different images.
Example:
e.g
F(x)= {(a,z),(b,x),(c,y)}