3.3.3 THEORETICAL TESTS 83 Theorem D. Let h, (Web server hosting)
3.3.3 THEORETICAL TESTS 83 Theorem D. Let h, k, c be integers with 0 < h 5 k, 0 2 c < k, and h relatively prime to k. Form the Euclidean tableau as defined in (33) above, and assume that the process stops after t steps with mt+l = 1. Let s be the smallest subscript such that c, = 0, and let h be defined by (36). Then a(h, k, c) = T + c (-l) + (a, -6b, + 6mjzJ+I) 1