Maths Olympiad Prep

Library / /223 of 520

Number theory Difficulty 6.0 National olympiad Prove it

7. Let u0>u1>1u_{0}>u_{1}>1 as in Theorem 4 of § 3; and let b0=1,b1=2b_{0}=1, b_{1}=2 and
bj+1=bj+bj1,j=1,2,b_{j+1}=b_{j}+b_{j-1}, \quad j=1,2, \cdots

Then, in the notation of Theorem 4 of § 3, we have u1bku_{1} \geqslant b_{k}. Furthermore, prove that:
k+12(lnu1)/ln2k+1 \leqslant 2\left(\ln u_{1}\right) / \ln 2

Explain the significance of this result.

Solution

7. Prove by the recursive formula of bjb_{j}: when k1k \geqslant 1, bk2(k+1)/2b_{k} \geqslant 2^{(k+1) / 2}.

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.