olymmath

BALTIC-WAY 2005 Problem 1

    Let a0a_{0} be a positive integer. Define the sequence an,n≥0a_{n}, n \geq 0, as follows: If

    an=∑i=0jci10ia_{n}=\sum_{i=0}^{j} c_{i} 10^{i}

    where cic_{i} are integers with 0≤ci≤90 \leq c_{i} \leq 9, then

    an+1=c02005+c12005+⋯+cj2005.a_{n+1}=c_{0}^{2005}+c_{1}^{2005}+\cdots+c_{j}^{2005} .

    Is it possible to choose a0a_{0} so that all the terms in the sequence are distinct?

    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

    Similar problems

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

    Locator baltic-way/2005/p1 · Tag K3PG9A9PES · Edit this page on GitHub · Keys: j next, k previous