ABCDEFGHIJKLMNOPQRSTUVWXYZAAABACADAEAFAGAHAIAJAKALAMANAOAPAQARASATAUAVAWAXAYAZBABBBCBDBEBFBGBHBIBJBKBLBMBNBOBPBQBRBSBTBUBVBWBXBYBZCACBCCCDCECFCGCHCICJCKCLCMCNCOCPCQCRCSCTCUCV
1
a*b cases
a<b
a^b=1
GCD(a,b)=1
there are a image transitions (movie) in a*b time slots
2
there are a image transitions (movie) in b slots (monitor refreshs)
3
monitor rr b5A1A2A3A4A5n2
all the rests of b|ka are finite {ka[b]}={0..b-1} to be demonstrated
4
movie fr a3123k2
longest sequence repeat is the first one n=rounddown(b/a)+1
5
result1122311223k`1
other repeat sequence is n-1
6
glitches1g1
k*n+k'*(n-1)=b and k+k'=a
7
resolution: k=(1-n)*a+b=b-a*rounddown(b/a), k'=a-k
8
monitor rr5A1A2A3A4A5n2
number of glitches: min(k,k')
9
movie fr41234k17/50=0x7+0
0+1
change
non change if r>=a
10
result1123311234k`35=0x7+5
0+1
repeat
non change if r>=a
11
glitches1g110=1x7+3
1+1
change
non change if r>=a
12
15=2x7+1
2+1
change
non change if r>=a
13
monitor rr7A1A2A3A4A5A6A7n420=2x7+6
2+1
repeat
non change if r>=a
14
movie fr212k125=3x7+4
3+1
change
non change if r>=a
15
result11112221111222k`130=4x7+2
4+1
change
non change if r>=a
16
glitches1g1
17
7/20=0x7+0
change
18
monitor rr7A1A2A3A4A5A6A7A8n32=0x7+2
repeat
19
movie fr3123k14=0x7+4
repeat
20
result1112223311122233k`26=0x7+6
repeat
21
glitches1g18=1x7+1
change
22
10=1x7+3
repeat
23
monitor rr7A1A1A1A1A1A1A1n212=1x7+5
repeat
24
movie fr41234k3
25
result11223341122334k`1
b>a, GCD(a,b)=1
b17n2
26
glitches1g1a11k6
27
a=5 b=7
k'5
28
monitor rr7A1A1A1A1A1A1A1n2g5
29
movie fr512345k2
30
result11233451123345k`3
31
glitches2g2
32
33
monitor rr7A1A1A1A1A1A1A1n2
34
movie fr6123456k1
35
result11234561123456k`5
36
glitches1g1
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100