benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let f(n) be the number of distinct digits of n when written in base 10. Compute the sum of f(n) as n ranges over all positive 2019-digit integers.

Problem

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

problem

Let f(n)f(n) be the number of distinct digits of nn when written in base 10. Compute the sum of f(n)f(n) as nn ranges over all positive 2019-digit integers.
Plain-text mathematical notation (without MathML)
Let f(n) be the number of distinct digits of n when written in base 10. Compute the sum of f(n) as n ranges over all positive 2019-digit integers.
Original LaTeX notation
Let $f(n)$ be the number of distinct digits of $n$ when written in base 10. Compute the sum of $f(n)$ as $n$ ranges over all positive 2019-digit integers.

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
7ce0ec91-9c6c-56f5-8c3f-87cc89b666b2
task_key
test--7ce0ec91-9c6c-56f5-8c3f-87cc89b666b2
task_revision_id
1
config / split
/ test

Official source

initial import