If $pq=1$, then $p=q=1$ for $p,q \in \mathbb {Z}$, $p,q >0$
I tried to do this by contradiction and I get
$(pq=1) \land (p\neq 1 \lor q \neq 1)$
then I have no ideas how to continue with a formal proof. What I know is if i choose q not equal to 1 and it is greater then 0, I will get
$p = \frac{1}{q}$
and p will be in the interval (0-1) and I get a contradiction.
Do I have to do (1) if p is not 1 and (2) both p and q is not 1?
real-analysisis surely not. – Mariano Suárez-Álvarez May 12 '13 at 03:05