benchmarks.wiki / Public workspace

Omni-MATH / For each integer a₀>1, define the sequence a₀,a₁,a₂,… for n≥0 as …

Problem

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

problem

For each integer a0>1a_0 > 1, define the sequence a0,a1,a2,…a_0, a_1, a_2, \ldots for n≥0n \geq 0 as $$a_{n+1} = \begin{cases} \sqrt{a_n} & \text{if } \sqrt{a_n} \text{ is an integer,} \\ a_n + 3 & \text{otherwise.} \end{cases} $$ Determine all values of a0a_0 such that there exists a number AA such that an=Aa_n = A for infinitely many values of nn. [i]
Plain-text mathematical notation (without MathML)
For each integer a₀>1, define the sequence a₀,a₁,a₂,… for n≥0 as
$$a_{n+1} = 
\begin{cases}
\sqrt{a_n} & \text{if } \sqrt{a_n} \text{ is an integer,} \\
a_n + 3 & \text{otherwise.}
\end{cases}
$$
Determine all values of a₀ such that there exists a number A such that a_(n)=A for infinitely many values of n.

[i]
Original LaTeX notation
For each integer $a_0 > 1$, define the sequence $a_0, a_1, a_2, \ldots$ for $n \geq 0$ as
$$a_{n+1} = 
\begin{cases}
\sqrt{a_n} & \text{if } \sqrt{a_n} \text{ is an integer,} \\
a_n + 3 & \text{otherwise.}
\end{cases}
$$
Determine all values of $a_0$ such that there exists a number $A$ such that $a_n = A$ for infinitely many values of $n$.

[i]

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

Official source

initial import