English

Let the Relation R Be Defined on N by Arb Iff 2a + 3b = 30. Then Write R as a Set of Ordered Pairs - Mathematics

Advertisements
Advertisements

Question

Let the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs

Solution

As, R = {(ab) : 2a + 3b = 30; ab ∈ N}

So, R = {(3, 8), (6, 6), (9, 4), (12, 2)}

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Relations - Exercise 1.3 [Page 30]

APPEARS IN

RD Sharma Mathematics [English] Class 12
Chapter 1 Relations
Exercise 1.3 | Q 23 | Page 30

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)].


Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation.


determination of whether the following relations are 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 R defined as R = {(a, b): a ≤ b}, is reflexive and transitive but not symmetric.


Check whether the relation R in R defined by R = {(a, b): a ≤ b3} is reflexive, symmetric, or transitive.


Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y): x and y have same number of pages} is an equivalence relation.


Given an example of a relation. Which is  Reflexive and symmetric but not transitive.


Show that the relation R in the set A of points in a plane given by R = {(P, Q): distance of the point P from the origin is same as the distance of the point Q from the origin}, is an equivalence relation. Further, show that the set of all points related to a point P ≠ (0, 0) is the circle passing through P with origin as centre.


Show that the relation R defined in the set A of all triangles as R = {(T1, T2): T1 is similar to T2}, is equivalence relation. Consider three right angle triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13 and T3 with sides 6, 8, and 10. Which triangles among T1, T2 and T3 are related?


Show that the relation R defined in the set A of all polygons as R = {(P1P2): P1 and P2have 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?


Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is

(A) 1 (B) 2 (C) 3 (D) 4


Give an example of a relation which is transitive but neither reflexive nor symmetric?


Let A = {abc} and the relation R be defined on A as follows: R = {(aa), (bc), (ab)}. Then, write minimum number of ordered pairs to be added in R to make it reflexive and transitive.


Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b},  is an equivalence relation.


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?


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.


Define a symmetric relation ?


Define an equivalence relation ?


If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.


Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.


Let A = {0, 1, 2, 3} and R be a relation on A defined as
R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}
Is R reflexive? symmetric? transitive?


Write the smallest equivalence relation on the set A = {1, 2, 3} ?


If R is the largest equivalence relation on a set A and S is any relation on A, then _____________ .


 If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .


Show that the relation R on the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.


If A = {1, 2, 3, 4 }, define relations on A which have properties of being: 
reflexive, symmetric and transitive


Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive


Give an example of a map which is one-one but not onto


R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.


Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.


If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.


A relation R on a non – empty set A is an equivalence relation if it is ____________.


Let R be a relation on the set N of natural numbers denoted by nRm ⇔ n is a factor of m (i.e. n | m). Then, R is ____________.


Let S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. Then, R is ____________.


Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.


Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.

A = {S, D}, B = {1,2,3,4,5,6}

  • Raji wants to know the number of relations possible from A to B. How many numbers of relations are possible?

A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-


Let N be the set of all natural numbers and R be a relation on N × N defined by (a, b) R (c, d) `⇔` ad = bc for all (a, b), (c, d) ∈ N × N. Show that R is an equivalence relation on N × N. Also, find the equivalence class of (2, 6), i.e., [(2, 6)].


If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×