Let `Z` be the set of integers and `f: Z -> Z` is a bijective function then

Let Z be the set of integers and f:Z rarr Z is a bijective function then

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 Z_(0) be the set of all non-zero integers.Let a relation R on Z xx Z_(0) be defined as follows: (a,b)R(c,d)hArr ad=bc for all (a,b),(c,d)in Z xx Z_(0) Prove that R is an equivalence relation on Z xx Z_(0)

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 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 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 integers and the mapping f:Z rarr Z be defined by, f(x):x^2 . State which of the following is equal to f^(-1)(-4) ?