2 2 2 5 5 5 , 3 3 3 4 4 4 , 4 4 4 3 3 3 , 5 5 5 2 2 2
Which of these four numbers has the largest value?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Yes. This is the correct approach. Using calculus, can you show that the first number is larger than the fourth number? This applies for the second number is larger than the third number. Hint: let f ( x ) = x ln x .
Excellent solution, very convincing and a very clean argument. Have you tried Part III , it's similar to this puzzle but slightly more difficult.
Since the second to fourth numbers are all less than 6 6 6 4 4 4 , it suffices to show that 6 6 6 4 4 4 < 2 2 2 5 5 5 , or , after taking 111th roots, show that 6 6 6 4 < 2 2 2 5 . But 6 6 6 4 = 3 4 2 2 2 4 < 2 2 2 5 since 3 4 = 8 1 < 2 2 2 .
Great bounding of values!
@Otto Bretscher How did you come up with the idea of comparing with 6 6 6 4 4 4 ?
My first thought, when I saw the question, was to take the logarithm of everything. So... l o g a ( 2 2 2 5 5 5 ) = 5 5 5 l o g a ( 2 2 2 ) = 5 5 5 ( l o g a ( 1 1 1 ) + l o g a ( 2 ) ) l o g a ( 3 3 3 4 4 4 ) = 4 4 4 l o g a ( 3 3 3 ) = 4 4 4 ( l o g a ( 1 1 1 ) + l o g a ( 3 ) ) l o g a ( 4 4 4 3 3 3 ) = 3 3 3 l o g a ( 4 4 4 ) = 3 3 3 ( l o g a ( 1 1 1 ) + l o g a ( 4 ) ) l o g a ( 5 5 5 2 2 2 ) = 2 2 2 l o g a ( 5 5 5 ) = 2 2 2 ( l o g a ( 1 1 1 ) + l o g a ( 5 ) ) It's entirely up to me to which base to take logs, so let a = 2 .
First, we want to compare 5 5 5 ( l o g 2 ( 1 1 1 ) + l o g 2 ( 2 ) ) and 4 4 4 ( l o g 2 ( 1 1 1 ) + l o g 2 ( 3 ) ) . This is equivalent to comparing l o g 2 ( 1 1 1 ) + 5 l o g 2 ( 2 ) and 4 l o g 2 ( 3 ) . Now, 6 < l o g 2 ( 1 1 1 ) < 7 , making the former equal to at least 1 1 . Moreover, l o g 2 ( 3 ) < 2 , so the latter is at most 8 , whence 2 2 2 5 5 5 > 3 3 3 4 4 4 .
The same argument holds for 2 2 2 5 5 5 and 4 4 4 3 3 3 ; now you have 2 l o g 2 ( 1 1 1 ) which dominates the inequality, and the former is larger again.
Similarly for 5 5 5 2 2 2 .
2 2 2 4 4 4 5 5 5 = 8 5 6 > 5 5 5 S o 2 2 2 5 5 5 l a r g e s t . Root of the biggest power and still bigger than the biggest number-base.
Can you solve this without a calculator? Note that this question can be done simply by using properties of indices.
Another cute way which generalizes the problem: prove that ( 1 1 1 a ) 7 − a > ( 1 1 1 ( a + 1 ) ) 6 − a . It's equivalent to 1 1 1 ( a + 1 ) > ( 1 + a 1 ) 7 − a . Note that 1 + a 1 < 2 , so if the opposite of our inequality was true, then 1 1 1 ( a + 1 ) < 2 7 − a which is clearly false for a ≥ 1 . Thus the function ( 1 1 1 a ) 7 − a is strictly decreasing for a ≥ 1 .
Problem Loading...
Note Loading...
Set Loading...
Let's start with the immediately obvious inequality: 2 5 ⋅ 1 1 1 > 3 4 . (Note that the left-hand-side is clearly more than 1 0 0 , while the right-hand-side is only 8 1 .)
Multiplying by 1 1 1 4 , we get 2 5 ⋅ 1 1 1 5 > 3 4 ⋅ 1 1 1 4 , or 2 2 2 5 > 3 3 3 4 . Raising to the 1 1 1 st power, we get: 2 2 2 5 5 5 > 3 3 3 4 4 4 We prove that 3 3 3 4 4 4 > 4 4 4 3 3 3 in a similar way; this time, start off by noticing that 3 4 ⋅ 1 1 1 > 4 3 , and follow the same argument. Again, 4 4 4 3 3 3 > 5 5 5 2 2 2 can be proven using the same argument if you start with 4 3 ⋅ 1 1 1 > 5 2 .