If R is a relation on a finite set A having n elements, then the number of relations on A is -Maths 9th

1 Answer

Answer :

(d) \(2^{n^2}\)Set A has n elements ⇒ n(A) = n ⇒ A × A has n × n = n2 elements ∴ Number of relations on A = Number of subsets of A × A = \(2^{n^2}\)

Related questions

Description : On a set N of all natural numbers is defined the relation R by a R b iff the GCD of a and b is 2, then R is -Maths 9th

Last Answer : (c) Symmetric only Let a ∈N. Then (a, a) ∉R as the GCD of a' and a' is a' not 2. R is not reflexive Let a, b ∈N. Then, (a, b) ∉R ⇒ GCD of a' and b' is 2 ⇒ GCD of b' and a' is 2 ⇒ (b, a) ∈R ∴ R ... , let a = 4, b = 10, c = 12 GCD of (4, 10) = 2 GCD of (10, 12) = 2 But GCD of (4, 12) = 4.

Description : If R is a relation defined on the set of natural numbers N such that (a, b) R (c, d) if and only if a + d = b + c, then R is -Maths 9th

Last Answer : (d) An equivalence relationWe can check the given properties as follows: Reflexive: Let (a, b) ∈ N x N. Then (a, b) ∈ N ⇒ a + b = b + a (Communtative law of Addition) ⇒ (a, b) R (b, a) ⇒ (a, b) R (a, ... , f) ⇒ (a, b) R (e, f) on N x N so R is transitive.Hence R is an equivalence relation on N N.

Description : Let R be a relation on the set N, defined by {(x, y) : 2x – y = 10} then R is -Maths 9th

Last Answer : (a) ReflexiveGiven, {(\(x\), y) : 2\(x\) – y = 10} Reflexive, \(x\) R \(x\) = 2\(x\) – \(x\) = 10 ⇒ \(x\) = 10 ⇒ y = 10 ∴ Point (10, 10) ∈ N ⇒ R is reflexive.

Description : Let R be a relation defined on the set A of all triangles such that R = {(T1, T2) : T1 is similar to T2}. Then R is -Maths 9th

Last Answer : (d) An equivalence relation.Every triangle is similar to itself, so (T1, T1) ∈ R ⇒ R is reflexive. (T1, T2) ∈ R ⇒ T1 ~ T2 ⇒T2 ~ T1, ⇒ (T2, T1) ∈ R ⇒ R is symmetrictransitive. ∴ R is an equivalence relation.

Description : On the set R of all real numbers, a relation R is defined by R = {(a, b) : 1 + ab > 0}. Then R is -Maths 9th

Last Answer : (a) Reflexive and symmetric only(a, a) ∈ R ⇒ 1 + a . a = 1 + a2 > 0 V real numbers a ⇒ R is reflexive (a, b) ∈ R ⇒ 1 + ab > 0 ⇒ 1 + ba > 0 ⇒ (b, a) ∈ R ⇒ R is symmetricWe observe that \(\big(1,rac{1}{2}\big) ... }{2},-1\big)\) ∈ Rbut (1, - 1) ∉ R as 1 + 1 (-1) = 0 \( ot>\) 0 ⇒ R is not transitive.

Description : Let R be a relation on the set of integers given by a = 2^k .b for some integer k. Then R is -Maths 9th

Last Answer : (c) equivalence relationGiven, a R b = a = 2k .b for some integer. Reflexive: a R a ⇒ a = 20.a for k = 0 (an integer). True Symmetric: a R b ⇒ a = 2k b ⇒ b = 2-k . a ⇒ b R a as k, -k are both ... = 2k1 + k2 c, k1 + k2 is an integer. ∴ a R b, b R c ⇒ a R c True ∴ R is an equivalence relation.

Description : Let A = {1, 2, 3, 4}, B = {5, 6, 7, 8}. Then R = {(1, 5), (1, 7), (2, 6)} is a relation from set A to B defined as : -Maths 9th

Last Answer : (d) R = {(a, b) : b/a is odd} Since (2, 6) ∈R, the relation a and b are odd does not exist. Since (1, 5) and (1, 7) ∈R, the relation a and b are even does not exist. None of the ... \(rac{7}{1}\) = 7, \(rac{6}{2}\) = 3, quotients being all odd numbers, the relation b/a is odd exists.

Description : Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then R is -Maths 9th

Last Answer : (b) Reflexive and transitive but not symmetricLet A = {1, 2, 3, 4} • ∵ (1, 1), (2, 2), (3, 3) and (4, 4) ∈R ⇒ R is reflexive • ∵ (1, 2) ∈ R but (2, 1) ∉ R ; (1, 3) ∈ R and (3, 1) ∉ R ; (3, 2) ∈R and (2, 3) ∉ R ⇒ R is not symmetric • (1, 3) ∈ R and (3, 2) ∈ R and (1, 2) ∈ R ⇒ R is transitive.

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

Description : Write ‘yes’ if each of the following relations is an equivalence relation. -Maths 9th

Last Answer : (i) is parallel to' is reflexive, because any line is parallel to itself. Symmetric, because if line l is parallel to line m, then line m is parallel to line l. Transitive, because if l || m ... y cannot be a factor of x. (v) No, because the relation is reflexive and transitive but not symmetric.

Description : If n(A) = 5 and n(B) = 7, then the number of relations on A × B is -Maths 9th

Last Answer : (b) 235n(A) = 5 and n(B) = 7 ∴ n(A × B) = 5 × 7 = 35 Total number of relations from A to B = Total number of subsets of (A × B) = 235.

Description : If R is a relation in N × N defined by (a, b) R (c, d) if and only if ad = bc, show that R is an equivalence relation. -Maths 9th

Last Answer : (i) R is reflexive. For all (a, b) ∈ N N we have (a, b) R (a, b) because ab = ba ⇒ R is reflexive. (ii) R is symmetric. Suppose (a, b) R (c, d) Then (a, b) R (c, d) ⇒ ... ) R (e, f) ⇒ R is transitive. Since R is reflexive, symmetric and transitive, therefore, R is an equivalence relation on N N.

Description : Choose the correct option. The relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} on a set A = {1, 2, 3} is -Maths 9th

Last Answer : R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} on set A = {1, 2, 3}. (i) Since (1, 1), (2, 2), (3, 3) ∈ R ⇒ R is reflexive. (ii) (1, 2) ∈ R but (2, 1) ∉ R ⇒ R is not symmetric. (iii) (1, 2) ∈ R, (2, 3) ∈ R and (1, 3) ∈R ⇒ R is transitive. ∴ Option (a) is the right answer.

Description : Show that the relation R in the set A of all the books in a library of a school given by R = {(x, y): x and -Maths 9th

Last Answer : Given: A = {All books in a library of a school} R = {(x, y): x and y have the same number of pages} Reflexivity: (x, x) ∈ R ⇒ R is reflexive on A Symmetric: Since books x and y have the same number of pages ... and (y, z) ∈ R ⇒ (x, z) ∈ R ⇒ R is transitive on A. Hence, R is an equivalence relation.

Description : Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as R = {(a, b): b = a + 1} is reflexive, symmetric or transitive. -Maths 9th

Last Answer : Reflexive: R = {(a, b) : b = a +1} = {(a, a + l) : a, a + 1∈{l, 2, 3, 4, 5, 6}} = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)} ⇒ R is not reflexive since (a, a) ∉R for all a. Symmetric: R is not symmetric as (a ... as (a, b) ∈ R and (b, c) ∈ R but (a, c) ∉ R e.g., (1, 2) ∈ R (2, 3) ∈ R but (1, 3) ∉R

Description : The relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is: -Maths 9th

Last Answer : (c) Symmetric onlyAs (1, 1), (2, 2) ∉ R so R is not reflexive. A relation a R b is said to symmetric if (a, b) ∈ R ⇒ (b, a) ∈ R. Here (1, 2) ∈ R and (2, 1) ∈ R so it is symmetric. Also, as (1, 2) ∈ R, but (2, 3), (1, 3) ∉ R, so R is not transitive.

Description : Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 12), (3, 6)} be a relation on set A = {3, 6, 9, 12}. The relation is -Maths 9th

Last Answer : (c) Reflexive and transitive onlyHere A = {3, 6, 9, 12} and R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 12), (3, 6)} ∵ (3, 3), (6, 6), (9, 9), (12, 12) all belong to R ⇒ {(a, a): ∈R V a ∈A} ... 12) ∈ R and (3,12) ∈ R ⇒ (3, 12) ∈ R (x, y) ∈ R, (y, z) ∈ R ⇒ (x, z) ∈ R Hence R is transitive.

Description : Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, -Maths 9th

Last Answer : (d) 7A = {1, 2, 3}. R = {(1, 2), (2, 3)} To make R an equivalence relation, it should be: (i) Reflexive: So three more ordered pairs (1, 1), (2, 2), (3, 3) should be added to R to make it ... 2, 1), (3, 2), (1, 3), (3, 1)} is an equivalence relation. So minimum 7 ordered pairs are to be added.

Description : Let N be the set of natural numbers. Describe the following relation in words giving its domain -Maths 9th

Last Answer : The given relation stated in words is R = {(x, y) : x is the fourth power of y; x ∈ N, y ∈ {1, 2, 3, 4}}.

Description : Consider the following relations R = {(x, y) | x, y are real numbers and x = wy for some rational number w}; -Maths 9th

Last Answer : (c) S is an equivalence relation but R is not an equivalence relationR = {(x, y) | x, y ∈ R, x = wy, w is a rational number} Reflexive: x R x ⇒ x = wx ⇒ w = 1, (a rational number) Hence R is reflexive. Symmetric ... \(rac{r}{s}\) ⇒ \(rac{m}{n}\) S \(rac{r}{s}\) (True)∴ S is an equivalence relation.

Description : Let R be a relation defined as a Rb if | a – b | > 0, then the relation is -Maths 9th

Last Answer : (d) Symmetric and transitive| a - a | = | 0 | = 0 so (a, a) ∉R ⇒ R is not reflexive(a, b) ∈ R ⇒ | a - b | > 0 ⇒ | b - a | > 0 ⇒ (b, a) ∈R (∵ | a - b | = | b - a |) ⇒ R is symmetric (a, b) ∈ R ... a, b, c. ∴ | a - b | > 0 and | b - c | > 0 ⇒ | a - c | > 0 ⇒ (a, c) ∈ R ⇒ R is transitive.

Description : Let A = {(2, 5, 11)}, B = {3, 6, 10} and R be a relation from A to B defined by R = {(a, b) : a and b are co-prime}. Then R is -Maths 9th

Last Answer : (c) {(2, 3), (5, 3), (5, 6), (11, 3), (11, 6), (11, 10)}

Description : If the roots of the equation x^2 + x + 1 = 0 are in the ratio of m : n, then which one of the following relation holds ? -Maths 9th

Last Answer : answer:

Description : I is the set of integers. Describe the following relations in words, giving its domain and range. -Maths 9th

Last Answer : R = {(0, 0), (1, – 1), (2, – 2), (3, – 3) ...} = {(x, y) : y = – x, x ∈ W} Domain = {0, 1, 2, 3, ....} = W, Range = {...,– 3, – 2, – 1, 0}

Description : For any two real number a b and , we defined aRb if and only if sin^2a + cos^2b = 1. The relation R is -Maths 9th

Last Answer : (d) an equivalence relationGiven, a R b ⇒ sin2a + cos2b = 1 Reflexive: a R a ⇒ sin2 a + cos2 a = 1 ∀ a ∈ R (True) Symmetric: a R b ⇒ sin2 a + cos2 b = 1 ⇒ 1 - cos2 a + 1 - sin2 b = 1 ⇒ sin2 b + ... + cos2 b + sin2 b + cos2 c = 2 ⇒ sin2 a + cos2 c = 1 ⇒ a R c (True)∴ R is an equivalence relation.

Description : Let R be a relation from A = {1, 2, 3, 4, 5, 6} to B = {1, 3, 5} which is defined as “x is less than y”. -Maths 9th

Last Answer : R = {a, b : a < b, a ∈ A, b ∈ B}, where A = {1, 2, 3, 4, 5, 6} and B = {1, 3, 5}. ∴ R = {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)} Domain of R = {1, 2, 3, 4} Range of R = {3, 5} Codomain of R = {1, 3, 5}.

Description : Let A = {1, 2, 3} and R = {(1, 2), (1, 1), (2, 3)} be a relation on A. -Maths 9th

Last Answer : (a) 1For the relation R to become transitive: (1, 2) ∈R and (2, 3) ∈R should imply (1, 3) ∈R ∴ Minimum one ordered pair (1, 3) should be added to R.

Description : Let A = {2, 3, 5, 6}. Then, which of the following relations is transitive only? -Maths 9th

Last Answer : (d) R = {(2, 3), (3, 5), (2, 5)}.

Description : Show that the relation ‘≅’ congruence on the set of all triangles in Euclidean plane geometry is an equivalence relation. -Maths 9th

Last Answer : Reflexive : A ≅ A True Symmetric : if A ≅ B then B ≅ A True Transitive : if A ≅ B and B ≅ C, then A ≅ C True Therefore, the relation ‘≅’ is an equivalence relation.

Description : Which of the following is an equivalence relation defined on set A = {1, 2, 3} -Maths 9th

Last Answer : (c) {(1, 1), (2, 2), (3, 1), (1, 3), (3, 3)} Option (c) satisfies all the conditions of an equivalence relation. (1, 1), (2, 2), (3, 3) ∈ R ⇒ (a, a) ∈ R V a ∈ A ⇒ R is reflexive (3, 1) ∈ R and (1, 3) ∈ R ... R and (1, 1) ∈ R ⇒ (a, b) ∈ R, (b, c) ∈ R ⇒ (a, c) ∈ R V a, b, c ∈ A ⇒ R is transitive.

Description : The relation “is parallel to” on a set S of all straight lines in a plane is : -Maths 9th

Last Answer : (d) An equivalence relationLet R = {(x, y) : line x is parallel to line y, x y ∈ set of coplanar straight lines}. Every line is parallel to itself. So, if x ∈S, then (x, x) ∈R ⇒ R is ... | z ⇒ (x, z) ∈R ⇒ R is transitive ∴ R being reflexive, symmetric and transitive, it is an equivalence relation.

Description : The relation ‘is less than’ on a set of natural numbers is -Maths 9th

Last Answer : (c) Only transitiveLet N be the set of natural numbers. Then R = {(a, b) : a < b, a, b ∈N}A natural number is not less than itself ⇒ (a, a)∉R where a ∈N ⇒ R is not reflexive V a, b ∈N, (a, b) ∈R ⇒ a < b \( ot\ ... ∈N, (a, b) ∈R and (b, c) ∈R ⇒ a < b and b < c ⇒ a < c (a, c) ∈R ⇒ R is transitive.

Description : If a relation `R` on the set `N` of natural numbers is defined as `(x,y)hArrx^(2)-4xy+3y^(2)=0,Aax,yepsilonN`. Then the relation `R` is

Last Answer : If a relation `R` on the set `N` of natural numbers is defined as `(x,y)hArrx^(2) ... symmetric B. reflexive C. transitive D. an equivalence relation.

Description : Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Last Answer : Answer: 2

Description : If AB = PQ, BC = QR and AC = PR, then write the congruence relation between the triangles. [Fig. 7.6] -Maths 9th

Last Answer : Solution :- △ ABC ≅ △PQR

Description : If a, b, c, d are positive reals such that a + b + c + d = 2, then M = (a + b) (c + d) satisfies the relation -Maths 9th

Last Answer : answer:

Description : Sarkaria Commission was set up to review - (1) the relation between the President and the Prime Minister (2) the relation between the legislative and the executive (3) the relations between the executive and the judiciary (4) the relations between the Union and the State.

Last Answer : (4) the relations between the Union and the State. Explanation: Sarkaria Commission was set up to review the relations between the Union and the States. Sarkaria Commission was set up in June 1983 by the central government of India.

Description : Define the types of relations and their examples. -Maths 9th

Last Answer : There are various types of relations:Let A be a non-empty set. Then, a relation R on A is said to be Reflexive if (a, a) ∈ R for each a ∈ A, i.e., if a R a for each a ∈ A. For example, the relation is as strong as is reflexive ... a || b ⇒ b || a a || b, b || c ⇒ a || c.

Description : Let A = {a, b, c, d} and B = {x, y, z}. Which of the following are relations from A to B ? -Maths 9th

Last Answer : (i) Yes. (ii) No, because in the ordered pair (a, d), a ∈ A and d ∉ B. (iii) No, because in (y, d), y ∈ B. (iv) No. because here the first entries in all the ordered pairs are in ... ) No, because the element z is not an ordered pair. (vii) No, because the elements of the set are not ordered pairs.

Description : Determine the domain and range of the following relations: (i) {(–3, 1), (–1, 1), (1, 0), (3, 0)} -Maths 9th

Last Answer : (i) Domain = {-3, -1, 1, 3}, Range = {0, 1} (ii) Domain = {x : x is a multiple of 3} = {3n : n ∈ Z} Range = {y : y is a multiple of 5} = {5n : n ∈ Z} (iii) Relation = {(x, x2) : x is a prime number ... (7, 49), (11, 121), (13, 169)} Domain = {2, 3, 5, 7, 11, 13}, Range = {4, 9, 25, 49, 121, 169}

Description : Which of the following are relations from B to A where A = {a, b, c, d} and B = {x, y, z}? -Maths 9th

Last Answer : (c) (i), (ii) and (iv)The set of ordered pairs {(b, y), (z, a), (x, c)} does not state a relation from B to A as the ordered pair (b, y) has the first element ‘b’ from set A, whereas it should be from set B.

Description : Given A = {–2, –1, 0, 1, 2}, which of the following relations on A have both domain and range equal to A? -Maths 9th

Last Answer : (d) (i) and (iii)Let us examine the domain and range of the each relation individually: (i) R : is equal to means R = {(a, b) : a = b, a ∈ A, b ∈A} ∴ R = {(-2, -2), (-1, -1), (0, 0), (1, ... = {-2, -1, 0, 1} and range = {-1, 0, 1, 2}. ∴ Relations given in (i) and (iii) satisfy the given condition.

Description : Which of the following relations is only symmetric? -Maths 9th

Last Answer : (c) “is perpendicular to” on a set of a coplanar lines(a) Let a, b, c ∈ A where A is a set of real numbers. Then R = {(a, b) : a ≤ b, a, b ∈ A} is : Reflexive: a ≤ a ⇒ (a, a) ∈ R (Yes) Symmetric: a ≤ b ⇒ (a, b) ∈ R, but a ≤ b ⇒ a < b or a = b ⇒ b = a but b \( ot

Description : Let X be the set of all graduates in India. Elements x and y in X are said to be related, if they are graduates of the same university. -Maths 9th

Last Answer : R = {(x, y)}: x and y are graduates of same university, x, y ∈ {All graduates of India}. R is reflexive as (x, x) ∈ R, since x and x are graduates from the same university. R ... graduates from the same university ⇒ (x, z) ∈ R. R being reflexive, symmetric and transitive is an equivalence relation.

Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

Description : If nCr : nCr+1 = 1 : 2 and nCr+1 : nCr+2 = 2 : 3 determine the values of n and r. -Maths 9th

Last Answer : answer:

Description : While discussing the properties of a parallelogram teacher asked about the relation between two angles x and y of a parallelogram as shown ... -Maths 9th

Last Answer : (a) Yes , x < y is correct (b) Ð ADB =Ð DBC = y (alternate int. angles) since BC < CD (angle opp. to smaller side is smaller) there for, x < y (c) Truth value

Description : The temperature of a liquid can be measured in Kelvin units as x K or in Fahrenheit units as y°F. The relation between the two system of measurement of temperature is given by the linear equation y = 9/5 ( x - 273 ) + 32 -Maths 9th

Last Answer : Solution :-

Description : Define the term of Relation with example. -Maths 9th

Last Answer : Relation: If A and B are any two non-empty sets, then any subset of A B is defined as a relation from A to B. For example, Suppose A = {1, 2, 3} and B = {1, 2, 3, 4}. Then {(2, 3), ... 3)} is a relation in A B. Many more relations (subsets) can be selected at random from our product set A B.