Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Could someone provide, please, a proof of the theorem below?

"Being $x$ and $b$ integers greater than $1$, which can not be represented as powers of the same basis (positive integer) and integer exponent, then the logarithm of $x$, in base $b$, is an irrational number."

Well... Assuming that the logarithm is a rational number $p/q$ ($p$ and $q$ are relatively prime integers), I know I can write $x^q = b^p$, but I can not conclude from this fact that $b$ and $x$ are powers of a same integer (and with integer exponent).

share|cite|improve this question
up vote 7 down vote accepted

Hint:

If $\log_b\;x$ were a rational number $\frac{p}{q}$, then

$$x^q=b^p$$

Now, go back to your initial assumption...

Edited to add: This might be of interest.

share|cite|improve this answer
    
Some hint :D (I suggest you remove the identity) – AD. Nov 6 '10 at 13:03
    
@AD: Well if it isn't, to use Arturo's words, screaming at him yet, then I don't know what else to do. ;) – J. M. Nov 6 '10 at 14:17

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.