olymmath

EGMO 2020 Problem 6

  • Day 2

Let m>1m > 1 be an integer. A sequence a1,a2,a3,…a_1, a_2, a_3, \ldots is defined by a1=a2=1a_1 = a_2 = 1 , a3=4a_3 = 4 , and for all n≥4n \ge 4 , an=m(an−1+an−2)−an−3.a_n = m(a_{n - 1} + a_{n - 2}) - a_{n - 3}. Determine all integers mm such that every term of the sequence is a square.

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