- #1

- 1,462

- 44

So I started by reinterpreting the question into something more tangible. Is it true that this problem is equivalent to the following? Suppose that ##|x| = n## and that ##0 \le k,m \le n-1##. Prove that ##x^k = x^m ## if and only if ##k = m##.