Question: Use the proof technique illustrated in exercise to prove that if n is any positive integer that is not a perfect square, then √n is irrational.
Exercise: An alternative proof of the irrationality of √2 counts the number of 2's on the two sides of the equation 2n2 = m2 and uses the unique factorization of integers theorem to deduce a contradiction. Write a proof that uses this approach.