Thread: discrete math relations simple problem help !!!!

Let A = {(x, y) | x, y integers}. Define a relation R on A by the rule (a, b) R (c, d) ↔ a = c or b = d. Determine whether R is transitive.
I know that it's not transitive but how to prove that is my problem.
shall I prove it with an example with numbers or with letters???!!!

Originally Posted by ujnikm

Let A = {(x, y) | x, y integers}. Define a relation R on A by the rule (a, b) R (c, d) ↔ a = c or b = d. Determine whether R is transitive.
I know that it's not transitive but how to prove that is my problem.
shall I prove it with an example with numbers or with letters???!!!

You give a counterexample. But it must be done with integers.

BUT ?

Originally Posted by Plato

You give a counterexample. But it must be done with integers.

BUT ?

can u illustrate more ??? please

Originally Posted by ujnikm

can u illustrate more ??? please

What do you mean. It is clear.

BUT NOT