If A={1, 2, 3, 4, 5, 6} and a relation R on A is defined by R={(a, b):`a, binA` and b is exactly divisible by a} then write R is roster form.

Let A = {1,2,3,4,5,6} and Let R be a relation on A defined by R {(a,b)| a divides b} Find R.

Let A = {1,2,3,4,5,6} and Let R be a relation on A defined by R {(a,b)| a divides b} Find dom R.

Let A = {1,2,3,4,5,6} and Let R be a relation on A defined by R {(a,b)| a divides b} Find rng R.

Let A={1, 2, 3, 5}, B={4, 6, 9}, A relation R form A to B is defined by R={(x,y) : x inA,yin B and x-y is odd}.write R in roster form.

Let A = {1,2,3,4,5,6} and Let R be a relation on A defined by R {(a,b)| a divides b} Find R^(-1) .

Let A = {1,2,3,4,5,6} and Let R be a relation on A defined by R {(a,b)| a divides b} Find rng R^(-1) .

Let A = {1,2,3,4,5,6} and Let R be a relation on A defined by R {(a,b)| a divides b} Find Dom R^(-1) .

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

Let. X = {1, 2, 3, 4, 5, 6, 7, 8,9}. Let R_(1) , be a relation on X given by R_(1) ={(x, y): x - y is divisible by 3)} and R_(2) , be another relation on X given by R_(2) ={(x, y): {x,y) sub (1,4,7) or (x, y) sub (2,5,8) or (x, y) sub (3, 6, 9)}. Show that R_(1)=R_(2) .

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