olymmath

NMC 2013 Problem 3

    Define a sequence (nk)k≥0\left(n_{k}\right)_{k \geq 0} by n0=n1=1n_{0}=n_{1}=1, and n2k=nk+nk−1n_{2 k}=n_{k}+n_{k-1} and n2k+1=nkn_{2 k+1}=n_{k} for k≥1k \geq 1. Let further qk=nk/nk−1q_{k}=n_{k} / n_{k-1} for each k≥1k \geq 1. Show that every positive rational number is present exactly once in the sequence (qk)k≥1\left(q_{k}\right)_{k \geq 1}.

    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 nordic/2013/p3 · Tag 2G06FGQANM · Edit this page on GitHub · Keys: j next, k previous