Here's a problem that I encountered on this site:
Find all pairs of rational numbers (a,b) such that aa=bb for 0<a<b.
One solution that was proposed runs as follows:
Write b=ax for some x>1. Then x=b/a so x is rational.
Then taking logs, we get aloga=blogb=axlog(ax)loga=xlog(ax)=xlog(x)+xlog(a)=xlogx1−xa=xx1−xb=x11−xsince x≠1 and a≠0Since x is rational, it suffices to find the values of x>1 for which x11−x is rational.
We claim that the only such values of x are x=n+1n where n is an integer.
We may write x=1+1n where n∈Q, n>0.
It is easy to see if n is a positive integer that x11−x is rational.
If n is not an integer, write n=p/q where p,q∈Z+ are coprime with q>1.
We have x11−x=(nn+1)n=(pp+q)p/q.
Hence p and p+q must be qth powers.
No two qth powers can differ by q since for positive integers u,v,q, we have by the Binomial Theorem, (u+v)q−uq=quq−1v+…+vq>q.Therefore, if n is not an integer, x11−x is not rational, so the only rational solutions are given by a=(nn+1)n+1 and b=(nn+1)n with n∈Z+The initial values of a and b are shown in Figure 1.
![]() |
Figure 1: permalink |
No comments:
Post a Comment