OSN 2009 Problem 2 Day 1 For any real xxx , let ⌊x⌋\lfloor x\rfloor⌊x⌋ be the largest integer that is not more than xxx . Given a sequence of positive integers a1,a2,a3,…a_1,a_2,a_3,\ldotsa1,a2,a3,… such that a1>1a_1>1a1>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⌊a2a1+1⌋=⌊a3a2+1⌋=⌊a4a3+1⌋=⋯ Prove that ⌊an+1an+1⌋≤1\left\lfloor\frac{a_n+1}{a_{n+1}}\right\rfloor\leq1⌊an+1an+1⌋≤1 holds for every positive integer nnn . 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. ISL 1996 N4BALTIC-WAY 2001 Problem 4ISL 2021 A3Putnam 2007 B5OMM 2016 Problem 3 PreviousProblem 1 NextProblem 3 Locator id-osn/2009/p2 · Tag 7QPFSNJ7SR · Edit this page on GitHub · Keys: j next, k previous