I'm sorry, Gam, I still don't get it. Your examples I understand just fine (or maybe I don't). I still don't get what Frenkel is presenting.
But he states "if N=12"
12 - 1 = 11. 12 - 2 = 10.
Where are you getting 5 from? What am I missing?
I really appreciate the help btw
N can be any Natural (Whole) Number. Twelve is an example, I chose six.
If N = 12
then { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 } is the set of modulo 12.
The clock just references the circular nature of the modulo arithmetic.
1 is equivalent to 1 mod(12)
2 " " 2 mod(12)
3 " " 3 mod(12)
...
10 is equivalent to 10 mod(12)
11 is equvalent to 11 mod(12)
12 is equivalent to 0 mod(12)
...
24 is equivalent to 0 mod(12) [2*12=24]
...
36 is equivalent to 0 mod(12) [3*12=36]
37 is equivalent to 1 mod(12)
38 " " 2 mod(12)
39 " " 3 mod(12)
The clock just serves a visual of the cyclical nature of the way this works, except twelve is zero. You could have any number of divisions of a circle, 360 degrees for example but it can be arbitrary.
If I write {0, 1,2,3, ..., M-2, M-1}, that's the set from zero to M-1. M can really be anything but here it should be greater than six as to not have repeat elements in this set. The first few elements are listed to show the pattern of the set, some sets are too large and too random to list like that but this is easy enough to recognize the next element is one lager than its previous.
edit: five just came as to not have a repeated element, so M-2 is "4" or more because "3" is listed in the set already. Eh, that seems confusing...
He's just saying pick an N bigger than five (or five) that is a natural number.
Say N is six, then the set is { 0 ,1 ,2 ,3, 4, 5 }
Just from the way it was written, {1,2,3, ..., N-2, N-1}
You want N-2 > 3
so N-2+2 > 3+2
N > 5