Assertion (A): Number of relations from set A to set B = 2n(A) · n(B)
Reason (R): A relation R from set A to set B is a subset of A × B.
Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A).
Assertion (A) is true, but Reason (R) is false.
Assertion (A) is false, but Reason (R) is true.
Answer
By definition, a relation R from a set A to a set B is a subset of A × B.
∴ Reason (R) is true.
As every relation from A to B is a subset of A × B, the number of relations from A to B is the number of subsets of A × B.
We know that a set containing n elements has 2n subsets and n(A × B) = n(A) · n(B).
∴ Number of relations from A to B = 2n(A) · n(B)
∴ Assertion (A) is true.
The formula in Assertion (A) is obtained exactly by counting the subsets of A × B, which is what Reason (R) states.
Hence, Option 1 is the correct option.
Assertion (A): Let A and B be two finite sets such that n(A) − n(B) = 1. If number of relations from set A to set B is 64 then n(A) = 3, n(B) = 2.
Reason (R): Number of relations from set A to set B = 2n(A) + n(B) + 1
Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A).
Assertion (A) is true, but Reason (R) is false.
Assertion (A) is false, but Reason (R) is true.
Answer
We know that,
Number of relations from set A to set B = 2n(A) · n(B) and not 2n(A) + n(B) + 1.
∴ Reason (R) is false.
Given,
Number of relations from A to B = 64
⇒ 2n(A) · n(B) = 64 = 26
⇒ n(A) · n(B) = 6
Also given, n(A) − n(B) = 1.
The pairs of positive integers whose product is 6 are 1 and 6, 2 and 3, 3 and 2, 6 and 1.
Out of these, only n(A) = 3 and n(B) = 2 satisfy n(A) − n(B) = 1.
∴ Assertion (A) is true.
Hence, Option 3 is the correct option.
Assertion (A): Range of the function is .
Reason (R):
Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A).
Assertion (A) is true, but Reason (R) is false.
Assertion (A) is false, but Reason (R) is true.
Answer
By the definition of the modulus function,
∴ Reason (R) is true.
Given,
, which is defined for every real number except 0.
Using the above definition,
when , , so ,
when , , so .
So takes only the values 1 and .
∴
∴ Assertion (A) is true.
The range of is obtained exactly by splitting into its two cases, which is what Reason (R) states.
Hence, Option 1 is the correct option.
Assertion (A): Domain of the function is .
Reason (R): Range of the function is .
Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A).
Assertion (A) is true, but Reason (R) is false.
Assertion (A) is false, but Reason (R) is true.
Answer
Given,
is not defined when the denominator is zero.
⇒
⇒
⇒
⇒
⇒ or
∴
∴ Assertion (A) is true.
For the function , we know that for every real number , and for every the number gives .
∴
∴ Reason (R) is true.
Reason (R) speaks about the range of a different function and it is of no use in finding the domain stated in Assertion (A).
Hence, Option 2 is the correct option.
Assertion (A): Relation R from a finite set A to a finite set B given by R = {(1, 2), (2, 3), (3, 4), (4, 5)} is a function.
Given that A = {1, 2, 3, 4} and B = {1, 2, 3, 4, 5, 6}.
Reason (R): All relations are functions.
Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A).
Assertion (A) is true, but Reason (R) is false.
Assertion (A) is false, but Reason (R) is true.
Answer
Every function is a relation, but a relation need not be a function. For example, the relation {(1, 2), (1, 3)} is not a function, as the element 1 has two different images.
∴ Reason (R) is false.
Given,
A = {1, 2, 3, 4}, B = {1, 2, 3, 4, 5, 6} and R = {(1, 2), (2, 3), (3, 4), (4, 5)}
Each of the four elements 1, 2, 3 and 4 of A occurs exactly once as a first component of the ordered pairs of R, so every element of A has one and only one image in B.
∴ R is a function.
∴ Assertion (A) is true.
Hence, Option 3 is the correct option.
Assertion (A): Range of the greatest integer function is (set of integers).
Reason (R): Domain of the function is .
Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A).
Assertion (A) is true, but Reason (R) is false.
Assertion (A) is false, but Reason (R) is true.
Answer
For the greatest integer function , the value is by definition the greatest integer not exceeding , so every value of is an integer.
Also, for any integer , , so every integer is attained.
∴
∴ Assertion (A) is true.
Now, for , the expression must be a real number and it must not be zero.
⇒
⇒
∴ and not , as makes the denominator zero.
∴ Reason (R) is false.
Hence, Option 3 is the correct option.