benchmarks.wiki / Public workspace

Omni-MATH / Find the number of ordered 2012-tuples of integers (x₁,x₂,…,x₂₀₁₂), with each integer between 0 and 2011 inclusive, such that the sum x₁+2x₂+3x₃+⋯+2012x₂₀₁₂ is divisible by 2012.

Problem

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

problem

Find the number of ordered 2012-tuples of integers (x1,x2,…,x2012)\left(x_{1}, x_{2}, \ldots, x_{2012}\right), with each integer between 0 and 2011 inclusive, such that the sum x1+2x2+3x3+⋯+2012x2012x_{1}+2 x_{2}+3 x_{3}+\cdots+2012 x_{2012} is divisible by 2012.
Plain-text mathematical notation (without MathML)
Find the number of ordered 2012-tuples of integers (x₁,x₂,…,x₂₀₁₂), with each integer between 0 and 2011 inclusive, such that the sum x₁+2x₂+3x₃+⋯+2012x₂₀₁₂ is divisible by 2012.
Original LaTeX notation
Find the number of ordered 2012-tuples of integers $\left(x_{1}, x_{2}, \ldots, x_{2012}\right)$, with each integer between 0 and 2011 inclusive, such that the sum $x_{1}+2 x_{2}+3 x_{3}+\cdots+2012 x_{2012}$ is divisible by 2012.

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