Let A be a finite set. Then, each inject...

Let A be a finite set. Then, each injective function from A into itself is not surjective.

Promotional Banner

Promotional Banner

Topper's Solved these Questions

RELATION AND FUNCTIONS
ACCURATE PUBLICATION|Exercise QUESTIONS CARRYING 1 MARK - TYPE-II|8 Videos
PROBABILITY
ACCURATE PUBLICATION|Exercise SAMPLE QUESTION PAPER -I ( SOLVED ) ( SECTION -D )|6 Videos
SAMPLE QUESTION PAPER - I
ACCURATE PUBLICATION|Exercise Section - D|6 Videos

ACCURATE PUBLICATION-RELATION AND FUNCTIONS-QUESTIONS CARRYING 1 MARK - TYPE-III

Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. ...
Text Solution
|
Let A be a finite set. Then, each injective function from A into itsel...
Text Solution
|
Every relation which is symmetric and transitive is also reflexive.
Text Solution
|
An integer m is said to be related to another integer n if m is a inte...
Text Solution
|
Let A = {0, 1} and N be the set of natural numbers. Then the mapping f...
Text Solution
|
The relation R on the set A = {1, 2, 3} defined as R = {(1, 1), (1, 2)...
Text Solution
|
A relation R in A is said to be transitive if a R b and b R c rArr a R...
Text Solution
|
The relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is n...
Text Solution
|
Let R be the relation in the set N given by R = {(a, b) : a = b – 2, b...
Text Solution
|
A function f:X to Y is said to be bijective, if f is both one-one and ...
Text Solution
|
Show that the function f: N rarrN given by f(x)= 3x is one-one but not...
Text Solution
|