Theorem 2.17 Let n be a positive integer. For each Z^*_n, and all l, m Z with gcd(l,m) = 1, if ^l (Z^*_n)^m, then (Z^*_n)^m

In this exercise, you are to make the result of Theorem 2.17 effective. Suppose that we are given a positive integer n, two elements , Z^*_n, and integers l and m, such that ^l = ^m and gcd(l, m) = 1. Show how to compute Z^*_n such that = ^m in time O(len(l) len(m) + (len(l) + len(m)) len(n)²). NO SPAM Please