benchmarks.wiki / Public workspace
Omni-MATH / Given distinct positive integer a_1,a_2,…,a_{2020} . For n≥2021, a_(n) is the smallest number different from a_1,a_2,…,a_{n-1} which doesn't divide a_(n−2020)...a_(n−2)a_(n−1). Pr…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
Given distinct positive integer
$ a_1,a_2,…,a_{2020} $. For , is the smallest number different from $a_1,a_2,…,a_{n-1}$ which doesn't divide . Proof that every number large enough appears in the sequence.Plain-text mathematical notation (without MathML)
Given distinct positive integer $ a_1,a_2,…,a_{2020} $. For n≥2021, a_(n) is the smallest number different from $a_1,a_2,…,a_{n-1}$ which doesn't divide a_(n−2020)...a_(n−2)a_(n−1). Proof that every number large enough appears in the sequence.Original LaTeX notation
Given distinct positive integer $ a_1,a_2,…,a_{2020} $. For $ n \ge 2021 $, $a_n$ is the smallest number different from $a_1,a_2,…,a_{n-1}$ which doesn't divide $a_{n-2020}...a_{n-2}a_{n-1}$. Proof that every number large enough appears in the sequence.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
initial import