olymmath

ISL 2006 N3

The sequence f(1),f(2),f(3),…f(1), f(2), f(3), \ldots is defined by f(n)=1n(⌊n1⌋+⌊n2⌋+⋯+⌊nn⌋),f(n)=\frac{1}{n}\left(\left\lfloor\frac{n}{1}\right\rfloor+\left\lfloor\frac{n}{2}\right\rfloor+\cdots+\left\lfloor\frac{n}{n}\right\rfloor\right), where ⌊x⌋\lfloor x\rfloor denotes the integer part of xx. (a) Prove that f(n+1)>f(n)f(n+1)>f(n) infinitely often. (b) Prove that f(n+1)<f(n)f(n+1)<f(n) infinitely often. (South Africa)

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2006 Shortlist booklet, page 58.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2006/n3 · Tag GVG3EY2Q51 · Edit this page on GitHub · Keys: j next, k previous