Proof without using the proof of contradiction

82 Views Asked by At

By using the proof by contradiction I can determine that the root of a prime number is irrational. But how can I proof this by using the rational roots test to find rational factors of $x^n - p$. How does this information leads me to get a proof?

$p=$ prime number, $n > 1$ (integer)