Let Cn denote the cycle graph with vertices vo,..., Un-1 arranged consecutively. Define divisors Do = 0 and Di = V - vo for i = 1,.. n - 1. ..." (a) Directly from set-lendings, show by induction that k[D] = [DK] for k = 0, 1,..., n 1 and that n [D] = 0. Thus, if we take indices modulo n, we have k [D] [DK] for all k Z. Let Cn denote the cycle graph with vertices vo,..., Un-1 arranged consecutively. Define divisors Do = 0 and Di = V - vo for i = 1,.. n - 1. ..." (a) Directly from set-lendings, show by induction that k[D] = [DK] for k = 0, 1,..., n 1 and that n [D] = 0. Thus, if we take indices modulo n, we have k [D] [DK] for all k Z.