# Prove that if m, n are natural, then the root

by rangerjoe
Tags: natural, prove, root
 Math Emeritus Sci Advisor Thanks PF Gold P: 39,361 I would imagine you would start by proving it for m= p, a prime number. That would make it easy to prove "If integer k is not divisible by p then neither is kn" so you could mimic Euclid's proof that $\sqrt{2}$ is irrational. After that, look at products of prime.