Skip to content
Question of 104

Q.Prove that the relation R in the set of integers Z given by R = {(a, b) : (a − b) is divisible by number 2} is an equivalence relation. OR Find g∘f and f∘g if f : R→R and g : R→R are given by f(x) = cos x and g(x) = 3x². Show that g∘f ≠ f∘g.

Chhattisgarh CgbseCGBSE Intermediate Board 2021Subjective· 4mImportance★★★★★
0% · 0/104 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Check the three defining properties — reflexivity, symmetry, transitivity — directly from the divisibility condition; all three hold, so RR is an equivalence relation.

Given R={(a,b):a,b∈Z, (a−b) is divisible by 2}R = \{(a,b): a,b\in\mathbb{Z},\ (a-b)\text{ is divisible by }2\}.

Concept: A relation RR on a set is an equivalence relation if it is reflexive, symmetric, and transitive.

Step 1 — Reflexivity: For any a∈Za\in\mathbb{Z}, a−a=0a-a = 0, and 00 is divisible by 22. So (a,a)∈R(a,a)\in R for every aa. Hence RR is reflexive.

Step 2 — Symmetry: Suppose (a,b)∈R(a,b)\in R, i.e. a−b=2ka-b = 2k for some integer kk. Then b−a=−(a−b)=−2k=2(−k)b-a = -(a-b) = -2k = 2(-k), which is also divisible by 22. So (b,a)∈R(b,a)\in R. Hence RR is symmetric.

Step 3 — Transitivity: Suppose (a,b)∈R(a,b)\in R and (b,c)∈R(b,c)\in R, i.e. a−b=2ka-b=2k and b−c=2mb-c=2m for integers k,mk,m. Adding:

a−c=(a−b)+(b−c)=2k+2m=2(k+m)a-c = (a-b)+(b-c) = 2k+2m = 2(k+m) …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.