benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Consider the sequence: x₁=19,x₂=95,x_(n+2)=lcm(x_(n+1),x_(n))+x_(n), for n>1, where lcm(a,b) means the least common multiple of a and b. Find the greatest common divisor of x₁₉₉₅ a…

Problem

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

problem

Consider the sequence: x1=19,x2=95,xn+2=lcm(xn+1,xn)+xnx_1=19,x_2=95,x_{n+2}=\text{lcm} (x_{n+1},x_n)+x_n, for n>1n>1, where lcm(a,b)\text{lcm} (a,b) means the least common multiple of aa and bb. Find the greatest common divisor of x1995x_{1995} and x1996x_{1996}.
Plain-text mathematical notation (without MathML)
Consider the sequence: x₁=19,x₂=95,x_(n+2)=lcm(x_(n+1),x_(n))+x_(n), for n>1, where lcm(a,b) means the least common multiple of a and b. Find the greatest common divisor of x₁₉₉₅ and x₁₉₉₆.
Original LaTeX notation
Consider the sequence: $x_1=19,x_2=95,x_{n+2}=\text{lcm} (x_{n+1},x_n)+x_n$, for $n>1$, where $\text{lcm} (a,b)$ means the least common multiple of $a$ and $b$. Find the greatest common divisor of $x_{1995}$ and $x_{1996}$.

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
4d6d6422-3d32-5135-a10c-7ded8dd29b87
task_key
test--4d6d6422-3d32-5135-a10c-7ded8dd29b87
task_revision_id
1
config / split
/ test

Official source

initial import