benchmarks.wiki / Public workspace

Omni-MATH / Three not necessarily distinct positive integers between 1 and 99, inclusive,…

Problem

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

problem

Three not necessarily distinct positive integers between 1 and 99, inclusive, are written in a row on a blackboard. Then, the numbers, without including any leading zeros, are concatenated to form a new integer NN. For example, if the integers written, in order, are 25, 6, and 12, then N=25612N=25612 (and not N=250612N=250612). Determine the number of possible values of NN.
Plain-text mathematical notation (without MathML)
Three not necessarily distinct positive integers between 1 and 99, inclusive, are written in a row on a blackboard. Then, the numbers, without including any leading zeros, are concatenated to form a new integer N. For example, if the integers written, in order, are 25, 6, and 12, then N=25612 (and not N=250612). Determine the number of possible values of N.
Original LaTeX notation
Three not necessarily distinct positive integers between 1 and 99, inclusive, are written in a row on a blackboard. Then, the numbers, without including any leading zeros, are concatenated to form a new integer $N$. For example, if the integers written, in order, are 25, 6, and 12, then $N=25612$ (and not $N=250612$). Determine the number of possible values of $N$.

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