Let $p>1$ be a natural number. Prove that $n=\sqrt[p-1]{p}$ can't be a natural number if $p>2$. $n=2$ for $p=2$ of course !
Equivalently show that $p=n^{p-1}$ admits for $p>1$ $(n,p)=(2,2)$ as the only pair of non zero natural numbers as solution.
The question is related to exercise n°5 of Bourbaki's first treatise on Algebra [chapter I-III]. At this stage the reader is supposed to have read the treatise covering Set theory. He/She isn't supposed to know what a square root nor even know what a real number is :-)
Thanks
Claim: For all $n\geq 3$, $2^{n-1}\gt n$.
This holds for $n=3$: $2^{3-1} = 4\gt 3=n$.
Assume that $2^{n-1}\gt n$, $n\geq 3$. Then $2^{n}\gt 2n$, and $2n = n+n\gt n+1$. Therefore, $2^{(n+1)-1} \gt n+1$.
This establishes the claim by induction.
Now, this means that for all $p\gt 2$, $n\geq 2$, $n^{p-1}\geq 2^{p-1}\gt p\gt 1^{p-1}$. Thus, $p$ cannot be a $(p-1)$st power of a natural number.