olymmath

CMO 2020 Problem 5

  • Day 2

Given any positive integer cc , denote p(c)p(c) as the largest prime factor of cc . A sequence {an}\{a_n\} of positive integers satisfies a1>1a_1>1 and an+1=an+p(an)a_{n+1}=a_n+p(a_n) for all n≥1n\ge 1 . Prove that there must exist at least one perfect square in sequence {an}\{a_n\} .

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 cn-mo/2020/p5 · Tag 39BSY17664 · Edit this page on GitHub · Keys: j next, k previous