benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Denote by l(n) the largest prime divisor of n. Let a_(n+1)=a_(n)+l(a_(n)) be a recursively defined sequence of integers with a₁=2. Determine all natural numbers m such that there e…

Problem

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

problem

Denote by l(n)l(n) the largest prime divisor of nn. Let an+1=an+l(an)a_{n+1} = a_n + l(a_n) be a recursively defined sequence of integers with a1=2a_1 = 2. Determine all natural numbers mm such that there exists some i∈Ni \in \mathbb{N} with ai=m2a_i = m^2.
Plain-text mathematical notation (without MathML)
Denote by l(n) the largest prime divisor of n. Let a_(n+1)=a_(n)+l(a_(n)) be a recursively
defined sequence of integers with a₁=2. Determine all natural numbers m such that there
exists some i∈N with a_(i)=m².
Original LaTeX notation
Denote by $l(n)$ the largest prime divisor of $n$. Let $a_{n+1} = a_n + l(a_n)$ be a recursively
defined sequence of integers with $a_1 = 2$. Determine all natural numbers $m$ such that there
exists some $i \in \mathbb{N}$ with $a_i = m^2$.

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
bd0a6deb-ec12-559b-a324-135858e3022f
task_key
test--bd0a6deb-ec12-559b-a324-135858e3022f
task_revision_id
1
config / split
/ test

Official source

initial import