I am given the following hint: Express $ q $ as a quotient of integers $ m/n $ where $ m,n $ are mutually prime, and show that $ m^2 = 2n^2 $ leads to a contradiction.
Proof solution: $2$ divides the right-hand side of this equation, hence $2\vert m^2$ ($2$ divides $m^2$). Since $2$ is prime, we must have $2\vert m$. So in fact $4\vert m^2$, and from the same equation again, $2\vert n^2$ so $2\vert n$. But now $2\vert m$ and $2\vert n$ which contradicts that $m$ and $n$ are mutually prime.
What I don't understand is:
- Why does contradicting $ m^2 = 2n^2 $ where $ m,n $ are mutually prime disprove no rational $q$ such that $q^2 = 2$? Why is the mutual prime condition necessary?
- "Since $2$ is prime, we must have $2\vert m$." Why does $2$ being prime entail that $2$ must divide $m$?
- Could the statement have been proved without the mutual prime condition?