Maths Olympiad Prep

Library / /165 of 520

Number theory Difficulty 5.8 AIME, harder Prove it

8. Prove: When nn is a positive integer,
[n+n+1]=[4n+2][\sqrt{n}+\sqrt{n+1}]=[\sqrt{4 n+2}]

Solution

8. Proof: Let k2n2kk^{2} \leqslant n2 k, therefore
2k[4n+2]2k+12 k \leqslant[\sqrt{4 n+2}] \leqslant 2 k+1

If 4n+22k+1\sqrt{4 n+2} \geqslant 2 k+1, then
4k2+4l+24k2+4k+1\sqrt{4 k^{2}+4 l+2} \geqslant \sqrt{4 k^{2}+4 k+1}

i.e. \square
4l+24k+1,4l4k14 l+2 \geqslant 4 k+1, \quad 4 l \geqslant 4 k-1

Since ll is an integer, therefore lkl \geqslant k.
So
[4n+2]={2k+1,lk2k,l2k2+2k+1+2(k2+k)=(2k+1)2[\sqrt{4 n+2}]=\left\{\begin{array}{cl} 2 k+1, & l \geqslant k \\ 2 k, & l2 k^{2}+2 k+1+2\left(k^{2}+k\right) \\ =(2 k+1)^{2} \text {. } \end{array}\right.

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.