Let Z be the set of all integers and let a*b =a-b+ab . Then * is

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 Z be the set of all integers and let m be an arbitrary but fixed positive integer. Show that the relation "congruence modulo m" on Z Z defined by : a -= b '(mod m)' implies (a-b) is divisible by m, for all a,b in Z Z is an equivalence relation on Z Z .

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

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.