olymmath

RO-TST 1999 Problem 7

    Prove that for any integer nn , n≥3n\geq 3 , there exist nn positive integers a1,a2,…,ana_1,a_2,\ldots,a_n in arithmetic progression, and nn positive integers in geometric progression b1,b2,…,bnb_1,b_2,\ldots,b_n such that b1<a1<b2<a2<⋯<bn<an.b_1 < a_1 < b_2 < a_2 <\cdots < b_n < a_n . Give an example of two such progressions having at least five terms.

    Mihai Baluna

    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 ro-tst/1999/p7 · Tag PSWKW8BWT6 · Edit this page on GitHub · Keys: j next, k previous