olymmath

ILL 1987 Problem 64

    Let r>1r > 1 be a real number, and let nn be the largest integer smaller than rr . Consider an arbitrary real number xx with 0≤x≤nr−1.0 \leq x \leq \frac{n}{r-1}. By a base- rr expansion of xx we mean a representation of xx in the form x=a1r+a2r2+a3r3+⋯x=\frac{a_1}{r} + \frac{a_2}{r^2}+\frac{a_3}{r^3}+\cdots where the aia_i are integers with 0≤ai<r.0 \leq a_i < r. You may assume without proof that every number xx with 0≤x≤nr−10 \leq x \leq \frac{n}{r-1} has at least one base- rr expansion.

    Prove that if rr is not an integer, then there exists a number pp , 0≤p≤nr−10 \leq p \leq \frac{n}{r-1} , which has infinitely many distinct base- rr expansions.

    Attachments:

    IMO1987logo.gif

    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 ill/1987/p64 · Tag JBJW9KGCC5 · Edit this page on GitHub · Keys: j next, k previous