benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Consider a sequence {a_(n)} of integers, satisfying a₁=1,a₂=2 and a_(n+1) is the largest prime divisor of a₁+a₂+…+a_(n). Find a₁₀₀.

Problem

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

problem

Consider a sequence {an}\{a_n\} of integers, satisfying a1=1,a2=2a_1=1, a_2=2 and an+1a_{n+1} is the largest prime divisor of a1+a2+…+ana_1+a_2+\ldots+a_n. Find a100a_{100}.
Plain-text mathematical notation (without MathML)
Consider a sequence {a_(n)} of integers, satisfying a₁=1,a₂=2 and a_(n+1) is the largest prime divisor of a₁+a₂+…+a_(n). Find a₁₀₀.
Original LaTeX notation
Consider a sequence $\{a_n\}$ of integers, satisfying $a_1=1, a_2=2$ and $a_{n+1}$ is the largest prime divisor of $a_1+a_2+\ldots+a_n$. Find $a_{100}$.

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
33c196d2-194c-5838-9d98-2a4ac66a375e
task_key
test--33c196d2-194c-5838-9d98-2a4ac66a375e
task_revision_id
1
config / split
/ test

Official source

initial import