I was wondering if someone could help me prove the following.
Let (a, b)=1. let d|ab. show that their exists unique such that
@Drexel28 - In your example, we have a = 4, b = 17 and d = 4. If we let and , then it seems to me that we've met the requirements of the problem.
@Chris11 - Are you allowed to use the Fundamental Theorem of Arithmetic (i.e., unique factorization) in your solution? If so, that's a hint.