Cartisean Product help

[mathguy78]

Let S = T = {2, 3, 4, 5, 6, 7, 8, 9, 10}

Make a graph on S relation equal mod 5 which is set

{(p,q):5|(p-q)


This is asking for the cartisean product of the difference between p and q to be divisible by 5 right?

I'm a little confused on the whole situation.

Can anyone help steer me in the right direction?

Thanks

 

[pka]

Let S = T = {2, 3, 4, 5, 6, 7, 8, 9, 10} Make a graph on S relation equal mod 5 which is set

(2,2),(3,3),(4,4),(5,5),(6,6),(7,7),(8,8)(9,9),(10,10)
(2,7),(7,2),(3,8),(8,3),(4,9),(9,4),(5,10),(10,5)

 

[mathguy78]

So

If the set started at 0 and was mod 4

{(p,q):4|(p-q)

S = T = {0,1,2,3,4,5,6,7,8,9}

It would be something like this?

(0,0), (1,1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6), ..... (9,9)
(0,4), (4,0), (0,8), (8,0), (1,4), (4,1), (1,8), (8,1), (2,6), (6,2) and so on?


Thanks

 

[pka]

If the set started at 0 and was mod 4
{(p,q):4|(p-q) S = T = {0,1,2,3,4,5,6,7,8,9}
(0,0), (1,1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6), ..... (9,9)
(0,4), (4,0), (0,8), (8,0), (1,4), (4,1), (1,8), (8,1), (2,6), (6,2)…

(0,0), (1,1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6), ..... (9,9) YES!
(1,4), (4,1), (1,8), (8,1), (2,6), (6,2)… BUT NO!

It would be:
(0,4), (4,0), (0,8), (8,0), (8,4), (4,8)
(1,5), (5,1), (1,9), (9,1)
(2,6), (6,2),
(3,7), (7,3),
(5,9),(9,5)

The idea is: two numbers are in a pair if and only if their difference is divisible by 4.

 

[mathguy78]

ooooooooo

I get it now!!!


Thank you very much.