Prove that if GCD(a, b) = 1, then GCD(an, bn) = 1 for all n >1. (Hint: Use Exercise.)
Exercise
Use induction to show that if p is a prime and p | an for n >1, then p | a.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.