benchmarks.wiki / Public workspace

Omni-MATH / A sequence consists of the digits 122333444455555… such that each positive integer n is repeated n times, in increasing order. Find the sum of the 4501st and 4052nd digits of this …

Problem

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

problem

A sequence consists of the digits 122333444455555…122333444455555 \ldots such that each positive integer nn is repeated nn times, in increasing order. Find the sum of the 4501st and 4052nd digits of this sequence.
Plain-text mathematical notation (without MathML)
A sequence consists of the digits 122333444455555… such that each positive integer n is repeated n times, in increasing order. Find the sum of the 4501st and 4052nd digits of this sequence.
Original LaTeX notation
A sequence consists of the digits $122333444455555 \ldots$ such that each positive integer $n$ is repeated $n$ times, in increasing order. Find the sum of the 4501st and 4052nd digits of this sequence.

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