Question types

Relations question types

114 questions across 4 question groups — pick any mix to generate a Maths paper with step-by-step answer keys.

114
Questions
4
Question groups
5
Question types
Sample Questions

Relations questions

One sample from each question group in this chapter. Select any group above to see the full set with answer keys.

The relation S defined on the set R of all real number by the rule aSb iff a ≥ b is:
  1. An equivalence relation.
  2. Reflexive, transitive but not symmetric.
  3. Symmetric, transitive but not reflexive.
  4. Neither transitive nor reflexive but symmetric.
View full solution
S is a relation over the set R of all real numbers and it is given by $(\text{a, b})\in\text{S}\Leftrightarrow\text{ab}\geq0.$ Then, S is:
  1. Symmetric and transitive only.
  2. Reflexive and symmetric only.
  3. Antisymmetric relation.
  4. An equivalence relation.
View full solution
The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is:
  1. Symmetric only.
  2. Reflexive only.
  3. An equivalence relation.
  4. Transitive only.
View full solution
Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if l is perpendicular to m for all l, m ∈ L. Then, R is:
  1. Reflexive.
  2. Symmetric.
  3. Transitive.
  4. None of these.
View full solution
In the set Z of all integers, which of the following relation R is not an equivalence relation?
  1. xRy : if $\text{x}\leq\text{y}$
  2. xRy : if x = y
  3. xRy : if x - y is an even integer
  4. xRy : if $\text{x}\equiv\text{y}\ (\text{mod 3})$
View full solution
Q 82 Marks2 Marks
Write the domain of the relation R defined on the set Z of integers as follows:
(a, b) ∈ R ⇔ a2 + b2 = 25
View full solution
Q 102 Marks2 Marks
State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive.
View full solution
Q 113 Marks3 Marks
If A = {1, 2, 3, 4} define relations on A which have properties of being:
Reflexive, transitive but not symmetric.
View full solution
Q 123 Marks3 Marks
Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}. Find whether or not the relations Ron A is:
  1. Reflexive.
  2. Symmetric.
  3. Transitive.
View full solution
Q 133 Marks3 Marks
Let A = {1, 2, 3}, and let R3 = {(1, 3), (3, 3)}. Find whether or not the relations Ron A is:
  1. Reflexive.
  2. Symmetric.
  3. Transitive.
View full solution
Q 143 Marks3 Marks
The following relation are defined on the set of real numbers.
aRb if $|\text{a}|\leq\text{b}$
Find whether these relation are reflexive, symmetric or transitive.
View full solution
Q 164 Marks4 Marks
m is said to be related to n if m and n are integers and m - n is divisible by 13. Does this define an equivalence relation?
View full solution
Q 174 Marks4 Marks
Show that the relation R, defined on the set A of all polygons as R = {(P1, P2): P1 and P2 have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?
View full solution
Q 184 Marks4 Marks
Let R be the relation defined on the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b): both a and b are either odd or even}. Show that R is an equivalence relation. Further, show that all the elements of the subset {1, 3, 5, 7} are related to each other and all the elements of the subset {2, 4, 6} are related to each other, but no element of the subset {1, 3, 5, 7} is related to any element of the subset {2, 4, 6}.
View full solution
Q 194 Marks4 Marks
Show that the relation R on the set Z of integers, given by R = {(a, b): 2 divides a - b},  is an equivalence relation.
View full solution
Q 204 Marks4 Marks
Let Z be the set of all integers and Z0 be the set of all non-zero integers. Let a relation R on Z × Z0 be defined as (a, b)R(c, d) ⇔ ad = bc for all (a, b), (c, d) ∈ Z × Z0, Prove that R is an equivalence relation on Z × Z0.
View full solution

Generate a Relations paper free

Pick question groups from the list above, set marks and difficulty, and export a branded PDF with step-by-step answer keys. First 3 chapters free — no signup.

Download App