benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A sequence of positive integers is given by a₁=1 and a_(n)=gcd(a_(n−1),n)+1 for n>1. Calculate a₂₀₀₂.

Problem

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

problem

A sequence of positive integers is given by a1=1a_{1}=1 and an=gcd(an−1,n)+1a_{n}=\operatorname{gcd}\left(a_{n-1}, n\right)+1 for n>1n>1. Calculate a2002a_{2002}.
Plain-text mathematical notation (without MathML)
A sequence of positive integers is given by a₁=1 and a_(n)=gcd(a_(n−1),n)+1 for n>1. Calculate a₂₀₀₂.
Original LaTeX notation
A sequence of positive integers is given by $a_{1}=1$ and $a_{n}=\operatorname{gcd}\left(a_{n-1}, n\right)+1$ for $n>1$. Calculate $a_{2002}$.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. 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. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
b0d17478-ba78-5dd0-b73e-6d2186df786e
task_key
test--b0d17478-ba78-5dd0-b73e-6d2186df786e
task_revision_id
1
config / split
/ test

Official source

initial import