olymmath

OSN 2009 Problem 2

  • Day 1

For any real xx , let ⌊x⌋\lfloor x\rfloor be the largest integer that is not more than xx . Given a sequence of positive integers a1,a2,a3,…a_1,a_2,a_3,\ldots such that a1>1a_1>1 and ⌊a1+1a2⌋=⌊a2+1a3⌋=⌊a3+1a4⌋=⋯\left\lfloor\frac{a_1+1}{a_2}\right\rfloor=\left\lfloor\frac{a_2+1}{a_3}\right\rfloor=\left\lfloor\frac{a_3+1}{a_4}\right\rfloor=\cdots Prove that ⌊an+1an+1⌋≤1\left\lfloor\frac{a_n+1}{a_{n+1}}\right\rfloor\leq1 holds for every positive integer nn .

Dataset text AI-MO AoPS. 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

Similar problems

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

Locator id-osn/2009/p2 · Tag 7QPFSNJ7SR · Edit this page on GitHub · Keys: j next, k previous