I was playing around and thought of the following question:
If given a≠1∈R+, prove that there are infinitely many integers n, such that n√a is irrational.
I have proven a very simple case:
If 1<m∈N, then there are infinitely many positive integer n such that n√m is irrational. To show this, I argue by noting the polynomial, p(x)=xn−m is irreducible in Z[x] for n>m, hence it is irreducible in Q[x] as it is also primitive. So there are no rational solutions to xn=m. And n√m is irrational.
How do I prove the general case? As it does seem quite intuitive.
Answer
The “simple” case is all you need.
Suppose a>0 is irrational; then n√a is irrational as well, otherwise a=(n√a)n would be rational.
For a general rational a=p/q, consider that
n√a=n√pqn−1q
Therefore n√a is rational if and only if n√pqn−1 is rational.
No comments:
Post a Comment