Let R be a relation on the set N of natural numbers defined by if divides . Then R is:
Reflexive and symmetric
Transitive and symmetric
Equivalence
Reflexive, transitive but not symmetric
(4)
Ans. Reflexive, transitive but not symmetric
Explanation:
Since divides is reflexive. is not symmetric since for .
is transitive since for , whenever and i.e., divides and divides , then will divide .
For real numbers and , define if and only if is an irrational number. Then the relation is:
reflexive
symmetric
transitive
equivalence
(1)
Ans. reflexive
Explanation:
is an irrational number.
Thus, is reflexive.
Also, as is an irrational number, but as is a rational number. So is not symmetric. Since, and but 1 is not related to . So, is not transitive.
For the set A = {1, 2, 3}, define a relation R in the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Then, the ordered pair to be added to R to make it the smallest equivalence relation is:
(1, 3)
(3, 1)
(2, 1)
(1, 2)
(2)
Ans. (3, 1)
Explanation:
To make an equivalence relation, we can add (3, 1).
Clearly, is reflexive and transitive. For to be symmetric, we should add (3, 1) in R.
Which one of the following is an identity relation?
(1, 2), (2, 3), (1, 3)
(5, 5), (4, 4), (2, 2)
(1, 3), (3, 1), (2, 3)
None of the above
(2)
Ans. (5, 5), (4, 4), (2, 2)
Explanation:
A relation is called an identity relation if
So, (5, 5), (4, 4), (2, 2) is an identity relation.
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is:
reflexive
transitive
symmetric
none of these
(4)
Ans. none of these
Explanation:
R on the set {1, 2, 3} be defined by R = {(1, 2)}
It is clear that R is not reflexive, transitive and symmetric.
Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}
Then R is:
reflexive but not symmetric
reflexive but not transitive
symmetric and transitive
neither symmetric nor transitive
(1)
Ans. reflexive but not symmetric
Explanation:
Given that,
A = {1, 2, 3}
and R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}
(1, 1), (2, 2), (3, 3) R
Hence, R is reflexive.
(1, 2) R but (2, 1) R
Hence, R is not symmetric.
(1, 2) R and (2, 3) R
(1, 3) R
Hence, R is transitive.
Relation R on real numbers is defined as
Reflexive and symmetric but not transitive
Symmetric and transitive but not reflexive
Reflexive and transitive but not symmetric
Equivalence relation
(3)
Ans. Reflexive and transitive but not symmetric
Explanation:
R is reflexive.
Therefore, is transitive.
Therefore is not symmetric.
If and , then
(1)
If and ,
then
Let Y = {1, 2, 3, 4, 5}, A = {1, 2}, B = {3, 4, 5} and denotes null set. If (A × B) denotes Cartesian product of the sets A and B, then (Y × A) ∩ (Y × B) is
Y
A
B
(4)
Let , B = {2, 4}, C = {4, 5} then
{(2, 4), (3, 4)}
{(4, 2), (4, 3)}
{(2, 4), (3, 4), (4, 4)}
{(2, 2), (3, 3), (4, 4), (5, 5)}
(1)
The cartesian product has 9 elements among which two elements are found (−1, 0) and (0, 1), then set A = ?
{1, 0}
{1, −1, 0}
{0, −1}
{1, −1}
(2)
If A and B be two sets such that consists of 6 elements. If three elements of are (1, 4), (2, 6) and (3, 6), find .
{(1, 4), (1, 6), (2, 4), (2, 6), (3, 4), (3, 6)}
{(4, 1), (4, 2), (4, 3), (6, 1), (6, 2), (6, 3)}
{(4, 4), (6, 6)}
{(4, 1), (6, 2), (6, 3)}
(2)
Since, (1, 4), (2, 6) and (3, 6) are the elements of A × B, therefore 1, 2, 3 are the elements of A and 4, 6 are the elements of B. Also, A × B has 6 elements.
A = {1, 2, 3} and B = {4, 6}
B × A = {(4, 1), (4, 2), (4, 3), (6, 1), (6, 2), (6, 3)}
If A and B have elements in common, then the number of elements common to A × B and B × A is
(4)
A set A has 5 elements. Then the maximum number of relations on A (including empty relation) is
(3)
The function satisfies the functional equation for all real . The value of is
8
4
- 8
11
(2)
...(i)
...(ii)
If , , then is
(4)
Let A = {1, 2, 3} and B = {2, 3, 4}, then which of the following relations is a function from A to B?
{(1, 2), (2, 3), (3, 4), (2, 2)}
{(1, 2), (2, 3), (1, 3)}
{(1, 3), (2, 3), (3, 3)}
{(1, 1), (2, 3), (3, 4)}
(3)
A relation is a function from set A to set B, if every element in A maps to one and only one element of B. So, relation {(1, 3), (2, 3), (3, 3)} is a function from A to B.
If a relation R is defined from a set A = {2, 3, 4, 5} to a set B = {3, 6, 7, 10} as follows divides . Expression of is represented by
{(6, 2), (10, 2), (3, 3), (6, 3)}
{(6, 2), (3, 3), (10, 5), (10, 2)}
{(6, 2), (10, 2), (3, 3), (6, 3), (10, 5)}
None of these
(3)
Recall that stands for divides . For the elements of the given sets and , we find
If , then
2
1
12
17
(1)
If denotes the number of elements in set and if , and , then
8
9
10
11
(2)
Given
Let the number of elements of the sets and be and respectively. Then the number of the relations from the set to the set is
(2)
Number of possible relations from to
If is a relation on a finite set having elements, then the number of relations on is
(2)
Number of elements in set
Number of elements in
Relations on are subsets of .
Number of relations
Suppose that the number of elements in set is , the number of elements in set is and the number of elements in is 7 then ________.
50
42
51
49
(1)
We have,
If and , then the number of relations on is , where unit digit of is ________.
(5)
.