Advertisements
Advertisements
Question
Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.
Advertisements
Solution
We have,
R = {(a, a3) : a is a prime number less than 5}
Or,
R = {(2, 8), (3, 27)}
So, the range of R is {8, 27}.
RELATED QUESTIONS
Let A = {1, 2, 3,......, 9} and R be the relation in A × A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation. Also, obtain the equivalence class [(2, 5)].
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y) : y is divisible by x}.
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set Z of all integers defined as R = {(x, y) : x – y is an integer}.
Show that the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12} given by R = {(a, b) : a = b} is an equivalence relation. Find the set of all elements related to 1.
Given an example of a relation. Which is reflexive and transitive but not symmetric.
Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.
Let A = {x ∈ Z : 0 ≤ x ≤ 12}. Show that R = {(a, b) : a, b ∈ A, |a – b| is divisible by 4}is an equivalence relation. Find the set of all elements related to 1. Also write the equivalence class [2]
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and transitive ?
Is it true that every relation which is symmetric and transitive is also reflexive? Give reasons.
Give an example of a relation which is symmetric and transitive but not reflexive?
Give an example of a relation which is transitive but neither reflexive nor symmetric?
Let n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.
Show that the relation R on the set A = {x ∈ Z ; 0 ≤ x ≤ 12}, given by R = {(a, b) : a = b}, is an equivalence relation. Find the set of all elements related to 1.
If R and S are relations on a set A, then prove that R is reflexive and S is any relation ⇒ R ∪ S is reflexive ?
Let A = {3, 5, 7}, B = {2, 6, 10} and R be a relation from A to B defined by R = {(x, y) : x and y are relatively prime}. Then, write R and R−1.
For the set A = {1, 2, 3}, define a relation R on the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Write the ordered pairs to be added to R to make the smallest equivalence relation.
If a relation R is defined on the set Z of integers as follows:
(a, b) ∈ R ⇔ a2 + b2 = 25. Then, domain (R) is ___________
If A = {a, b, c}, then the relation R = {(b, c)} on A is _______________ .
Let A = {2, 3, 4, 5, ..., 17, 18}. Let '≃' be the equivalence relation on A × A, cartesian product of Awith itself, defined by (a, b) ≃ (c, d) if ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) is _______________ .
R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3. Then, R−1 is ______________ .
Let A = {1, 2, 3} and B = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ________________ .
If R is a relation on the set A = {1, 2, 3, 4, 5, 6, 7, 8, 9} given by x R y ⇔ y = 3 x, then R = _____________ .
Mark the correct alternative in the following question:
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then, R is _____________ .
If A = {a, b, c}, B = (x , y} find B × B.
Write the relation in the Roster form and hence find its domain and range :
R1 = {(a, a2) / a is prime number less than 15}
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.
Consider the non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then R is ______.
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 ______.
Let A = { 2, 3, 6 } Which of the following relations on A are reflexive?
A relation R on a non – empty set A is an equivalence relation if it is ____________.
The relation R is defined on the set of natural numbers as {(a, b) : a = 2b}. Then, R-1 is given by ____________.
Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
Let the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, is:
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let R = {(L1, L2 ): L1 is parallel to L2 and L1: y = x – 4} then which of the following can be taken as L2?
There are 600 student in a school. If 400 of them can speak Telugu, 300 can speak Hindi, then the number of students who can speak both Telugu and Hindi is:
Let R = {(a, b): a = a2} for all, a, b ∈ N, then R salifies.
Read the following passage:
|
An organization conducted bike race under two different categories – Boys and Girls. There were 28 participants in all. Among all of them, finally three from category 1 and two from category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. |
Based on the above information, answer the following questions:
- How many relations are possible from B to G? (1)
- Among all the possible relations from B to G, how many functions can be formed from B to G? (1)
- Let R : B `rightarrow` B be defined by R = {(x, y) : x and y are students of the same sex}. Check if R is an equivalence relation. (2)
OR
A function f : B `rightarrow` G be defined by f = {(b1, g1), (b2, g2), (b3, g1)}. Check if f is bijective. Justify your answer. (2)
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
