benchmarks.wiki / Public workspace

Omni-MATH / A sequence of positive integers a₁,a₂,a₃,… satisfies a_(n+1)=n⌊(a_(n))/(n)⌋+1 for all positive integers n. If a₃₀=30, how many possible values can a₁ take? (For a real number x, …

Problem

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

problem

A sequence of positive integers a1,a2,a3,…a_{1}, a_{2}, a_{3}, \ldots satisfies an+1=n⌊ann⌋+1a_{n+1}=n\left\lfloor\frac{a_{n}}{n}\right\rfloor+1 for all positive integers nn. If a30=30a_{30}=30, how many possible values can a1a_{1} take? (For a real number xx, ⌊x⌋\lfloor x\rfloor denotes the largest integer that is not greater than xx.)
Plain-text mathematical notation (without MathML)
A sequence of positive integers a₁,a₂,a₃,… satisfies a_(n+1)=n⌊(a_(n))/(n)⌋+1 for all positive integers n. If a₃₀=30, how many possible values can a₁ take? (For a real number x, ⌊x⌋ denotes the largest integer that is not greater than x.)
Original LaTeX notation
A sequence of positive integers $a_{1}, a_{2}, a_{3}, \ldots$ satisfies $$a_{n+1}=n\left\lfloor\frac{a_{n}}{n}\right\rfloor+1$$ for all positive integers $n$. If $a_{30}=30$, how many possible values can $a_{1}$ take? (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer that is not greater than $x$.)

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