Maths Olympiad Prep

Library / /173 of 520

Number theory Difficulty 5.8 AIME, harder Prove it

8. In question 2, let v0>v1>1v_{0}>v_{1}>1; and set c0=1,c1=2c_{0}=1, c_{1}=2 and
cj+1=2cj+cj1,j=1,2,c_{j+1}=2 c_{j}+c_{j-1}, \quad j=1,2, \cdots

Then, we have v1chv_{1} \geqslant c_{h}. Furthermore, prove:
(i) h(lnv1)/ln2h \leqslant\left(\ln v_{1}\right) / \ln 2;
(ii) When v132v_{1} \geqslant 32, h+1(lnv)/ln2h+1 \leqslant(\ln v) / \ln 2.

Solution

8. Estimate the lower bound of ckc_{k} using the recurrence formula of cjc_{j}.

Translate the above text into English, please keep the original text's line breaks and format, and output the translation result directly.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.