olymmath

VN-TST 1999 Problem 1

  • Day 1

Let an odd prime pp be a given number satisfying 2h≠1(modp)2^h \neq 1 \pmod{p} for all h<p−1,h∈N∗,h < p-1, h \in \mathbb{N}^{*}, and an even integer a∈(p2,p).a \in \left(\frac{p}{2},p \right). Let us consider the sequence {an}n=0∞\{a_n\}^{\infty}_{n=0} defined by a0=aa_0 = a and an+1=p−bna_{n+1} = p - b_n for n=0,1,2,…n = 0, 1, 2, \ldots , where bnb_n is the greatest odd divisor of an.a_n. Show that {an}\{a_n\} is periodical and find its least positive period.

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