MathDB
Italian WinterCamps test07 Problem2

Source: IMO Shortlist 2006, N3, AIMO 2007, TST 3, P1

January 29, 2007
calculusfloor functionnumber theorySequenceSummationIMO Shortlist

Problem Statement

We define a sequence (a1,a2,a3,) \left(a_{1},a_{2},a_{3},\ldots \right) by a_{n} \equal{} \frac {1}{n}\left(\left\lfloor\frac {n}{1}\right\rfloor \plus{} \left\lfloor\frac {n}{2}\right\rfloor \plus{} \cdots \plus{} \left\lfloor\frac {n}{n}\right\rfloor\right), where x\lfloor x\rfloor denotes the integer part of xx.
a) Prove that an+1>ana_{n+1}>a_n infinitely often. b) Prove that an+1<ana_{n+1}<a_n infinitely often.
Proposed by Johan Meyer, South Africa