Maths Olympiad Prep

Library / /150 of 520

Algebra Difficulty 6.2 National olympiad Prove it

17. y=x2x+nx2+x+1y=\frac{x^{2}-x+n}{x^{2}+x+1} ( nn is a positive integer) has a minimum value of ana_{n}, a maximum value of bnb_{n}, and cn=n4(1+3anbn)c_{n}=\frac{n}{4}\left(1+3 a_{n} b_{n}\right). Prove:
321n+1<k=1n1ck<21n(n2)\frac{3}{2}-\frac{1}{n+1}<\sum_{k=1}^{n} \frac{1}{c_{k}}<2-\frac{1}{n}(n \geqslant 2)

Solution

17. First prove anbn=4n13,cn=n2a_{n} b_{n}=\frac{4 n-1}{3}, c_{n}=n^{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.