benchmarks.wiki / Public workspace

OlympiadBench / 2193 / Let m>1 be an integer. A sequence a₁,a₂,a₃,… is defined by…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

answer type

Numerical

is multiple answer

true

language

English

question

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 n4n \geq 4, an=m(an1+an2)an3. a_{n}=m\left(a_{n-1}+a_{n-2}\right)-a_{n-3} . Determine all integers mm such that every term of the sequence is a square.
Plain-text mathematical notation (without MathML)
Let m>1 be an integer. A sequence a₁,a₂,a₃,… is defined by a₁=a₂=1, a₃=4, and for all n≥4,

a_(n)=m(a_(n−1)+a_(n−2))−a_(n−3).

Determine all integers m such that every term of the sequence is a square.
Original LaTeX notation
Let $m>1$ be an integer. A sequence $a_{1}, a_{2}, a_{3}, \ldots$ is defined by $a_{1}=a_{2}=1$, $a_{3}=4$, and for all $n \geq 4$,

$$
a_{n}=m\left(a_{n-1}+a_{n-2}\right)-a_{n-3} .
$$

Determine all integers $m$ such that every term of the sequence is a square.

question type

Open-ended

subject

Math

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import