Wednesday, 22 October 2014

abstract algebra - Showing numbers are irrational.



I was playing around and thought of the following question:




If given a1R+, prove that there are infinitely many integers n, such that na is irrational.








I have proven a very simple case:



If 1<mN, then there are infinitely many positive integer n such that nm is irrational. To show this, I argue by noting the polynomial, p(x)=xnm 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 nm 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 na is irrational as well, otherwise a=(na)n would be rational.



For a general rational a=p/q, consider that
na=npqn1q
Therefore na is rational if and only if npqn1 is rational.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...