Suppose that m and n are integers such that n | m and m | n. Are these hypotheses sufficient to prove that m = n? If so, give a proof. If not, supply a simple additional hypothesis that will guarantee m = n and provide a proof.
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.