olymmath

EGMO 2023 Problem 5

  • Day 2

We are given a positive integer s⩾2s \geqslant 2. For each positive integer kk, we define its twist k′k^{\prime} as follows: write kk as as+ba s+b, where a,ba, b are non-negative integers and b<sb<s, then k′=bs+ak^{\prime}=b s+a. For the positive integer nn, consider the infinite sequence d1,d2,…d_{1}, d_{2}, \ldots where d1=nd_{1}=n and di+1d_{i+1} is the twist of did_{i} for each positive integer ii.

Prove that this sequence contains 1 if and only if the remainder when nn is divided by s2−1s^{2}-1 is either 1 or ss.

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 egmo/2023/p5 · Tag NRWRRB1NNE · Edit this page on GitHub · Keys: j next, k previous