Home
Class 12
MATHS
Let Z be the set of a integers and let R...

Let Z be the set of a integers and let R be a relation on z defined by a R b `iff a>=b`. Then, R is

Text Solution

Verified by Experts

`R = {(a,b): a ge b}`
If the relation is reflexive,
then `(a,a) in R`
Here, `a ge a`
`:. f(a,a)` is true.
So, relation is reflexive.

...
Promotional Banner

Similar Questions

Explore conceptually related problems

Let Z be the set of all integers and let R be a relation on Z defined by a Rb implies a ge b . then R is

Let ZZ be the set of all integers and let R be a relation on ZZ defined by a R b hArr (a-b) is divisible by 3 . then . R is

Let Z be the set of all integers and R be the relation on Z defined by R= { (a,b): a, b in Z and (a-b) is divisible by 5} . Prove that R is an equivalence relation

Let Z be the set of all integers and R be the relation on Z defined as R = (a,b) : a,b in Z and a-b is divisible by 5) Prove that R is an equivalence relation.

Let Z be the set of all integers and R be the relation on Z defined as R={(a , b); a ,\ b\ in Z , and (a-b) is divisible by 5.} . Prove that R is an equivalence relation.

Let Z be the set of all integers and R be the relation on Z defined as R={(a , b); a ,\ b\ in Z , and (a-b) is divisible by 5.} . Prove that R is an equivalence relation.

Let Z be the set of all integers and R be the relation on Z defined as R={(a, b); a,\ b\ in Z, and (a-b) is divisible by 5} . Prove that R is an equivalence relation.

Let Z be the set of all integers and R be the relation on Z defined as R={(a , b); a ,\ b\ in Z , and (a-b) is divisible by 5.} . Prove that R is an equivalence relation.