Let p be a binary relation defined on the integers Z by:

apb if and only if a^{2}=logically equivalent to= b^{2}(mod7)

Prove carefully that p is an equivalence relation on Z and give the equiv classes.

__________________________________________________ ____________________

Let X = {p, q}

write down the set X x X

list all the binary relations on X which are reflexive

A binary relation p on a set X is said to be irrelfexive if (x, x) not-element p for all x element X

Write down all binary relations on the set X above which are irreflexive, and also irreflexive and symmetric simultaneously

Ok, So i started with the first part and proved it by

Took each number and squared it. The ones with the same square mod 7 are in the same equivalence class.

0^1 ≡ 0(mod7)

1^2 ≡ 1(mod7), 6

2^2 ≡4(mod7), 5

3^2 ≡2(mod7), 4

Therefore equivalence classes are {0}, {1,6} , {2,5} and {3,5} I think?(clarification would do wonders here)

However I am stuck from the X = {p, q} bit... and everything that follows any help would be much appreciated...

Thanks Simmy