olymmath

IN-TST 2001 Problem 14

  • Day 5

A strictly increasing sequence (an)(a_n) has the property that gcd⁡(am,an)=agcd⁡(m,n)\gcd(a_m,a_n) = a_{\gcd(m,n)} for all m,n∈Nm,n\in \mathbb{N} . Suppose kk is the least positive integer for which there exist positive integers r<k<sr < k < s such that ak2=arasa_k^2 = a_ra_s . Prove that r∣kr | k and k∣sk | s .

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 in-tst/2001/p14 · Tag QGK7G2WF16 · Edit this page on GitHub · Keys: j next, k previous