I'm trying to prove that n√st is irrational unless both s and t are perfect nth powers. I have found plenty of proofs for nth root of an integer but cannot find anything for rationals. Also trying to work up from the proofs I have found is rather difficult.
My lecturer wants me to prove this using uniqueness of prime factorisation but I also have no idea where to start with that.
Any help is greatly appreciated.
Answer
To build off Vasya and Calum's helpful comments:
Let st be an irreducible fraction (to address Vasya's comment).
Continuing with the main proof, recall Vasya's comment:
n√st=n√sn√t
We will quickly prove this.
Obviously (n√st)n=st.
Notice st=(n√s)n(n√t)n=(n√sn√t)n.
It follows that n√st=n√sn√t since the nth root is either a bijection or always positive.
Without loss of generality, let s have a prime factorization pa11pa22...paii. Let n√s be an integer with prime factorization qb11qb22...qbjj.
Clearly pa11pa22...paii=qnb11qnb22...qnbjj.
We know the prime factorization of s is unique, so we know that each power of p corresponds to some power of q.
It's not clear which p corresponds to which q, but it is clear that all the prime factors are nth powers.
No comments:
Post a Comment