benchmarks.wiki / Public workspace

Omni-MATH / Find the number of ordered 64-tuples (x₀,x₁,…,x₆₃) such that x₀,x₁,…,x₆₃ are distinct elements of {1,2,…,2017} and x₀+x₁+2x₂+3x₃+⋯+63x₆₃ is divisible by 2017.

Problem

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

problem

Find the number of ordered 6464-tuples (x0,x1,…,x63)(x_0,x_1,\dots,x_{63}) such that x0,x1,…,x63x_0,x_1,\dots,x_{63} are distinct elements of {1,2,…,2017}\{1,2,\dots,2017\} and x0+x1+2x2+3x3+⋯+63x63 x_0 + x_1 + 2x_2 + 3x_3 + \cdots + 63 x_{63} is divisible by 2017.
Plain-text mathematical notation (without MathML)
Find the number of ordered 64-tuples (x₀,x₁,…,x₆₃) such that x₀,x₁,…,x₆₃ are distinct elements of {1,2,…,2017} and x₀+x₁+2x₂+3x₃+⋯+63x₆₃ is divisible by 2017.
Original LaTeX notation
Find the number of ordered $64$-tuples $(x_0,x_1,\dots,x_{63})$ such that $x_0,x_1,\dots,x_{63}$ are distinct elements of $\{1,2,\dots,2017\}$ and \[ x_0 + x_1 + 2x_2 + 3x_3 + \cdots + 63 x_{63} \] is divisible by 2017.

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