benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For each positive integer n, define s(n) to equal the sum of the digits of n. The number of integers n with 100≤n≤999 and 7≤s(n)≤11 is S. What is the integer formed by the rightmos…

Problem

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

problem

For each positive integer nn, define s(n)s(n) to equal the sum of the digits of nn. The number of integers nn with 100≤n≤999100 \leq n \leq 999 and 7≤s(n)≤117 \leq s(n) \leq 11 is SS. What is the integer formed by the rightmost two digits of SS?
Plain-text mathematical notation (without MathML)
For each positive integer n, define s(n) to equal the sum of the digits of n. The number of integers n with 100≤n≤999 and 7≤s(n)≤11 is S. What is the integer formed by the rightmost two digits of S?
Original LaTeX notation
For each positive integer $n$, define $s(n)$ to equal the sum of the digits of $n$. The number of integers $n$ with $100 \leq n \leq 999$ and $7 \leq s(n) \leq 11$ is $S$. What is the integer formed by the rightmost two digits of $S$?

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
2221384d-14d4-5423-aecc-a573ffae0409
task_key
test--2221384d-14d4-5423-aecc-a573ffae0409
task_revision_id
1
config / split
/ test

Official source

initial import