benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find the number of 10-digit numbers (a₁a₂⋯a₁₀)¯ which are multiples of 11 such that the digits are non-increasing from left to right, i.e. a_(i)≥a_(i+1) for each 1≤i≤9.

Problem

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

problem

Find the number of 10-digit numbers a1a2⋯a10¯\overline{a_{1} a_{2} \cdots a_{10}} which are multiples of 11 such that the digits are non-increasing from left to right, i.e. ai≥ai+1a_{i} \geq a_{i+1} for each 1≤i≤91 \leq i \leq 9.
Plain-text mathematical notation (without MathML)
Find the number of 10-digit numbers (a₁a₂⋯a₁₀)¯ which are multiples of 11 such that the digits are non-increasing from left to right, i.e. a_(i)≥a_(i+1) for each 1≤i≤9.
Original LaTeX notation
Find the number of 10-digit numbers $\overline{a_{1} a_{2} \cdots a_{10}}$ which are multiples of 11 such that the digits are non-increasing from left to right, i.e. $a_{i} \geq a_{i+1}$ for each $1 \leq i \leq 9$.

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
dc59d92b-db73-5a36-9c3f-48bcb9435ec1
task_key
test--dc59d92b-db73-5a36-9c3f-48bcb9435ec1
task_revision_id
1
config / split
/ test

Official source

initial import