Home
Class 12
MATHS
Let Z be the set of all integers and R b...

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

Promotional Banner

Topper's Solved these Questions

  • MODEL TEST PAPER-6

    ICSE|Exercise Section -B|10 Videos

  • MODEL TEST PAPER-6

    ICSE|Exercise Section -C|10 Videos

  • MODEL TEST PAPER-5

    ICSE|Exercise Section -C|10 Videos

  • MODEL TEST PAPER-9

    ICSE|Exercise SECTION - C|10 Videos

Similar Questions

Explore conceptually related problems

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 m be a given fixed positive integer. Let R={(a.b) : a,b in Z and (a-b) is divisible by m} . Show that R is an equivalence relation on Z .

Prove that the relation R on Z defined by (a ,\ b) in RhArr a-b is divisible by 5 is an equivalence relation on Z .

Let S be the set of all real numbers and Let R be a relations on s defined by A R B hArr |a|le b. then ,R is

Let Z be the set of all integers. A relation R is defined on Z by xRy to mean x-y is divisible by 5. Show that R is an equivalence relation on Z.

Show that the relation R defined by R={(a , b):a-b is divisible by 3; a , bZ} is an equivalence relation.

Show that the relation R defined by R={(a , b):a-b is divisible by 3; a , bZ} is an equivalence relation.

Show that the relation R defined by R={(a , b):a-b is divisible by 3; a , bZ} is an equivalence relation.

Let R be the relation on Z defined by R = {(a , b): a , b in Z , a b is an integer}.Find the domain and range of R.