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)

    Dataset text NuminaMath olympiads. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

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