The question is quite famous and is generally included under the topic of induction, but I didn't actually catch how to do it. And it goes as follows:

Two sequences \((a_{1},a_{2},...)\) and \((b_{1},b_{2},...)\) are defined as \(a_{1}=3, a_{n}=3^{a_{n-1}}\) and \(b_{1}=4, b_{n}=4^{b_{n-1}}\). Show that \(a_{1000}>b_{999}\).

Thank you to everyone who shall participate in the discussion and help me. Please explain how to do it, as well.

No vote yet

9 votes

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestFirst, you should prove that \(a_{n}>b_{n-1}\) using induction. For the base case, let \(n=2\), and it is obvious that \(a_{n}=a_2=3^{a_1}=3^3=27\) is greater than \(b_{n-1}=b_1=4\).

Now we must show that \(a_{n+1}>b_n\) if we assume that \(a_n>b_{n-1}\). \(a_{n+1}=3^{a_n}\) and \(b_n=4^{b_{n-1}}.

\(3^{a_n}>4^{b_{n-1}}\)

\(\log_4{3^{a_n}}>b_{n-1}\)

\(a_n \cdot \log_4{3} > b_{n-1}\)

\(\log_4{3}>\frac{b_{n-1}}{a_n}\)

This is the best I could do. I'm not sure how to proceed from here.

Log in to reply

I had proceeded in a similar manner, but to no avail. Maybe we need to prove it for certain powers or pattern and complete the proof by reverse induction, because I am sure that reverse induction works. But a reference point is what is required to be found.

Log in to reply

That's is a good start. However, as you realized, you needed to use a statement that is stronger than the induction hypothesis that you currently have. That factor of \( \log_4 3 \) seems to mess things up.

This suggests that you should make your induction hypothesis stronger, which was what Sebastian was doing.

For example, if the induction hypothesis was that \( a_{n+1} > 2 b_n \), then you can see that the previous statement we wanted is true. However, of course, this strengthen the inequality that we get in the induction step, and hence may longer be true. Thus part of this problem is to find the stronger induction statement to prove.

I call this method of induction proof "stronger induction" (this terminology is not standard), because you have to guess at a stronger statement to show than the obvious guess. I am planning a series of posts on induction, and hope to cover this at some point in the future.

Log in to reply

Well so the "stronger induction" here refers to the "stronger inequality" which is being used to prove the statement true.

Log in to reply

Another example of a question approached by "stronger induction" is as follows:

For this example, the induction hypothesis of

is not sufficient enough for us to work on the induction step.

Log in to reply