Which of the numbers $1, 2^{1/2}, 3^{1/3}, 4^{1/4}, 5^{1/5}, 6^{1/6} , 7^{1/7}$ is largest, and how to find out without calculator?

23.8k Views Asked by At

$1, 2^{1/2}, 3^{1/3}, 4^{1/4}, 5^{1/5}, 6^{1/6} , 7^{1/7}$.

I got this question in an Application of Derivatives test. I think log might be used here to compare the values, but even then the values are very close to each other and differ by less than 0.02, which makes it difficult to get some specific answer to this question. How to solve this by a definite method?

Source: ISI entrance exam

11

There are 11 best solutions below

7
On BEST ANSWER

You can use calculus to find where the maximum of $f(x)=x^{1/x}$ occurs. You will find that it is at $x=e$. You will also find that $f(x)$ is increasing for $0< x<e$ and decreasing for $e<x$.

Unfortunately, the choice $e^{1/e}$ was not given. The two values of $x$ that you are given that bracket $e$ are $2$ and $3$, so the correct choice is either $2^{1/2}$ or $3^{1/3}$.

We can decide between the two of them by raising both sides to the sixth power.

\begin{align} 2^{1/2} &\stackrel{?}{=} 3^{1/3} \\ \left(2^{1/2}\right)^6 &\stackrel{?}{=} \left(3^{1/3}\right)^6 \\ 2^3 &\stackrel{?}{=} 3^2 \\ 8 &\stackrel{?}{=} 9 \end{align}

We see that $x=3$ gives us the larger function value, so the correct answer is

$$3^{1/3}$$

0
On

Hint: look at $f(x) = x^{1/x}$ and decide if this function is increasing or not. Write it as $x^{1/x} = e^{(\ln x)/x}$ to differentiate it easier.

0
On

Consider the function $f(x) = x^{1/x}$. We ask, when is this maximized? So we ask, what is $f'(x)$? To do this, we use logarithmic derivatives.

$$ \log f(x) = \log x^{1/x} = \frac{\log x}{x},$$ so $$ \frac{f'(x)}{f(x)} = \frac{1 - \log x}{x^2},$$ or rather $$ f'(x) = \frac{1 - \log x}{x^2} x^{1/x}.$$ Notice that this is positive when $1 > \log x$ and negative when $1 < \log x$, so the actual max is at $x = e$. This means that the max value of $f(x)$ will be at either $2^{1/2}$ or $3^{1/3}$. We might guess that since $e$ is closer to $3$, that $e^{1/3}$ will be the bigger of the two. Using whatever method of your choosing to evaluate $2^{1/2}$ and $3^{1/3}$, we can confirm that heuristic: $3^{1/3}$ is larger.

0
On

$3^{\frac{1}{3}}$ is the largest.

In general $y=x^{\frac{1}{x}}$ reaches its maximum at $x=e$ **. In this case, technically you can't know whether y is bigger when $x=2$ or $x=3$, but I guess you can always do quick mental math for these to realize $2^3<3^2$ and thus $2^{\frac{1}{2}}<3^{\frac{1}{3}}$.

** Proof:

$d(\ln{y})=d(\frac{\ln{x}}{x})$

$\frac{dy}{y}=\frac{1-\ln{x}}{x^2}dx$

solve $\frac{dy}{dx}=0$ to get $x=e$. It is also easy to verify that $\frac{dy}{dx}>0$ when $0<x<e$; $\frac{dy}{dx}<0$ when $x>e$.

4
On

HINT: This will helps you to solve the problem purely algebraically. $$n^{\dfrac1{n}}\lt(n+1)^{\dfrac1{n+1}}\iff n^{n+1}\lt(n+1)^n\iff n\lt\left(1+\dfrac1{n}\right)^n\color{Red}{\lt 3}.$$

0
On

Not a perfect answer but I guess this graph would help too!

Graph of $$y=x^{\frac{1}{x}}$$:

1

Graph of $$y=\dfrac{d}{dx}(x^{\frac{1}{x}})$$:

2

Hope this helps!

2
On

An alternative, brute-force way to tackle this problem is basically what Rory did to decide between $2^{1/2}$ and $3^{1/3}$: if you exponentiate all numbers by $7!$, you are sure to get all integer values

$$ \bigl\{k^{\frac{7!}{k}}|k\in\{1\ldots7\}\bigr\} $$

Unfortunately they're rather big-ish...

GHCi> [ k ^ (product [1..7] `div` k) | k<-[1..7] ]
  [1,
   394084245522141626953485431836389151728191722497516426553221541823493367658800961065564478638820000356056388337167035542074008945401913950236214360506399705231203021164366069389563701733455174652493802096528279659381259483508916176782516892616322154881870596505654577774329808187256502370468256875376316278135937985788160888518809137837873180086327183792757748702946460720720770436177477377229784500022657580657233628383930137914619684009220791267089768552182903618603146950084219242780072578071648001265726679873751772302343114358428552134991938056446803917216962620267368806273089867659639177213488960155211698149211030681779788578141054359274289556411400436598704927821275214881488970218576557325551889577507340928956338410400961096026352642413831783448576,
   3661912215373489067242249621132336961610290182229273707167398710876614002208383109152480213707986686872375122262823321167475157779382448880082398480746724280018352246496425709765006815739802937329118909032303852395641094542256170191689227965576694930360217879714593185250058052659033043099481347841901512973200683071279368653749416285340166533780186704458918301959849893495738166812440825398619614897586259234866683821976521877416906874042851545999400717457006303853919690522754781679747975594958591113536855815138459335042071169602620465754362712624336396931069121231223649220741653756791946172957229074471590534449467409015111938950424658629560623120013261353086157489463854787465723269822306205125946816633592230345910648381608113535470519096069897114291378101952082063097558331741722268578938849601,
   394084245522141626953485431836389151728191722497516426553221541823493367658800961065564478638820000356056388337167035542074008945401913950236214360506399705231203021164366069389563701733455174652493802096528279659381259483508916176782516892616322154881870596505654577774329808187256502370468256875376316278135937985788160888518809137837873180086327183792757748702946460720720770436177477377229784500022657580657233628383930137914619684009220791267089768552182903618603146950084219242780072578071648001265726679873751772302343114358428552134991938056446803917216962620267368806273089867659639177213488960155211698149211030681779788578141054359274289556411400436598704927821275214881488970218576557325551889577507340928956338410400961096026352642413831783448576,
   364556100977819874605503728407741081881676346238948447117857163982799574599912357208765752772609805609216792941532907275084174813028918904234969069220285451654066666460283261825779326556992902934023629217291059811812700201092161637033272762158365274926054054240010344187292896183070687196100649574391718146941190971541979112502472018926815402055402289908282341091909958440280410415495601978687424035436772000234314385172638320786417824167774294732269493833831511078611247246888604243991272627701581023463256401969428865555514986358611545557986044502104498878068279992795447813951124094440195256012527056812275003403114716680371040088551073162797865548409912591341398846456200999455177225172519683837890625,
   443660048414121698116896720273098111694627892639926213574513642183588830573572725097614384624929656854477362433985094367622076844148871486402466997159938815714918720533225246415719206145269164491483440088113473133271721551710902954127241545224711822871932621367309647269511669621366804962147364104873801876330729203153951698533647309818607945451914353715510545802805485379098717028338231926737028464504004503561662293072536103139720605781253399604736172810653048846227697050259155272360027923195409050025343802985259990900000152616977832620707076557885534793432774747114996460757553837938070024879032348656207289216741331217382066876812018333391389720576,
   295521314766370598718760957190961267014220876452973493503373916219890905153816181542660448581907991795732056662584461354270150436888850541545604825539840387962452645120966643398014723369507352156668886170865380118289497004228254391234909565641031507543122603146317573251628661017089188403226600800563307928140865181430255011119739367579006409418569088936445603946929350297425000321465327604294142433627464875576685927100371269660301351354927495364059849501985417777493884363882045423030414188505485925921956168425832321649711980887028510830566229638084077726689531555183493538978345530566113309436109434032001]

but looking at the length of the numbers shows the third one to be biggest (because longest).

Of course, you couldn't feasibly calculate these giant powers without a calculator (not without some approximation... but then then better do the original problem directly), however if not 7 was the highest candidate but 4 or 5, it would still be doable (if laborious).

GHCi> [ k ^ (product [1..5] `div` k) | k<-[1..5] ]
  [1, 1152921504606846976, 12157665459056928801, 1152921504606846976,
 59604644775390625]

Furthermore, you don't really need $n!$, only the least common multiple.

GHCi> [ k ^ (foldr lcm 1 [1..5] `div` k) | k<-[1..5] ]
  [1, 1073741824, 3486784401, 1073741824, 244140625]
0
On

This is not calculus-based answer. (The original question suggests that the OP is mostly interested in answers using calculus, but I guess alternative approaches can be interesting too.)

We can show that $$\sqrt[n]n \ge \sqrt[n+1]{n+1}$$ for $n\ge 3$.

The above inequality is clearly equivalent to $$n^{n+1} \ge (n+1)^n$$ (for $n\ge 3$).

Several approaches how to show this fact can be found here (and maybe in a few other posts on this site):

Now it remains to check that $1^2<2^1$ and $2^3<3^2$, so $n=3$ is indeed the first $n$ where the inequality occurs.

0
On

Since $1$ is obviously smaller than all the rest, we can skip it.

Check the rest by taking a pair of numbers, comparing them and proceeding with the larger one:


  • Take $2^{1/2}$ and $3^{1/3}$
  • Raise them both to the power of $6$ (the LCM of $2$ and $3$)
  • Since they are both positive, their order will be preserved and you will get:

$$\left(2^{1/2}\right)^{6}=2^3=8<9=3^2=\left(3^{1/3}\right)^{6}$$


  • Take $3^{1/3}$ and $4^{1/4}$
  • Raise them both to the power of $12$ (the LCM of $3$ and $4$)
  • Since they are both positive, their order will be preserved and you will get:

$$\left(3^{1/3}\right)^{12}=3^4=81>64=4^3=\left(4^{1/4}\right)^{12}$$


  • Take $3^{1/3}$ and $5^{1/5}$
  • Raise them both to the power of $15$ (the LCM of $3$ and $5$)
  • Since they are both positive, their order will be preserved and you will get:

$$\left(3^{1/3}\right)^{15}=3^5=243>125=5^3=\left(5^{1/5}\right)^{15}$$


  • Take $3^{1/3}$ and $6^{1/6}$
  • Raise them both to the power of $6$ (the LCM of $3$ and $6$)
  • Since they are both positive, their order will be preserved and you will get:

$$\left(3^{1/3}\right)^{6}=3^2=9>6=6^1=\left(6^{1/6}\right)^{6}$$


  • Take $3^{1/3}$ and $7^{1/7}$
  • Raise them both to the power of $21$ (the LCM of $3$ and $7$)
  • Since they are both positive, their order will be preserved and you will get:

$$\left(3^{1/3}\right)^{21}=3^7=2187>343=7^3=\left(7^{1/7}\right)^{21}$$


Hence the answer is $3^{1/3}$.

0
On

From the logarithmic derivative, $(\ln(x)/x)'=\left(1-\ln(x)\right)/x^2$, we deduce that the function $x^{1/x}$ has a single maximum at $x=e$.

As $2^{1/2}=4^{1/4}$ any intermediate value is higher, and so is $3^{1/3}$.

0
On

If you haven't been introduced to elementary calculus yet, you can take a look at this solution. Comparing integers is easier than comparing irrational numbers. Since $[1, 2, \cdots, 7] = 420$, we can take the $420$th powers of all these numbers will give us a bunch of integers to compare: $$1, 2^{210}, 3^{140}, 2^{210}, 5^{84}, 2^{70} 3^{70}, 7^{60}.$$ We see after some basic arithmetic that $3^{140}$ is the largest among these numbers. Taking the $140$th root, it is obvious that $3^{1/3}$ is the largest among the original bunch of numbers.