benchmarks.wiki / Public workspace

Omni-MATH / Determine all integers n≥2 such that there exists a permutation x₀,x₁,…,x_(n−1) of the numbers 0,1,…,n−1 with the property that the n numbers …

Problem

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

problem

Determine all integers n≥2n \geq 2 such that there exists a permutation x0,x1,…,xn−1x_0, x_1, \ldots, x_{n - 1} of the numbers 0,1,…,n−10, 1, \ldots, n - 1 with the property that the nn numbers $$x_0, \hspace{0.3cm} x_0 + x_1, \hspace{0.3cm} \ldots, \hspace{0.3cm} x_0 + x_1 + \ldots + x_{n - 1}$$ are pairwise distinct modulo nn.
Plain-text mathematical notation (without MathML)
Determine all integers n≥2 such that there exists a permutation x₀,x₁,…,x_(n−1) of the numbers 0,1,…,n−1 with the property that the n numbers
$$x_0, \hspace{0.3cm} x_0 + x_1, \hspace{0.3cm} \ldots, \hspace{0.3cm} x_0 + x_1 + \ldots  + x_{n - 1}$$
are pairwise distinct modulo n.
Original LaTeX notation
Determine all integers $n \geq 2$ such that there exists a permutation $x_0, x_1, \ldots, x_{n - 1}$ of the numbers $0, 1, \ldots, n - 1$ with the property that the $n$ numbers
$$x_0, \hspace{0.3cm} x_0 + x_1, \hspace{0.3cm} \ldots, \hspace{0.3cm} x_0 + x_1 + \ldots  + x_{n - 1}$$
are pairwise distinct modulo $n$.

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