benchmarks.wiki / Public workspace

Omni-MATH / Let p>3 be a prime and let a₁,a₂,...,a_((p−1)/(2)) be a permutation of 1,2,...,(p−1)/(2). For which p is it always possible to determine the sequence a₁,a₂,...,a_((p−1)/(2)) if it …

Problem

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

problem

Let p>3p>3 be a prime and let a1,a2,...,ap−12a_1,a_2,...,a_{\frac{p-1}{2}} be a permutation of 1,2,...,p−121,2,...,\frac{p-1}{2}. For which pp is it always possible to determine the sequence a1,a2,...,ap−12a_1,a_2,...,a_{\frac{p-1}{2}} if it for all i,j∈{1,2,...,p−12}i,j\in\{1,2,...,\frac{p-1}{2}\} with $i\not=j$ the residue of aiaja_ia_j modulo pp is known?
Plain-text mathematical notation (without MathML)
Let p>3 be a prime and let a₁,a₂,...,a_((p−1)/(2)) be a permutation of 1,2,...,(p−1)/(2). For which p is it always possible to determine the sequence a₁,a₂,...,a_((p−1)/(2)) if it for all i,j∈{1,2,...,(p−1)/(2)} with $i\not=j$ the residue of a_(i)a_(j) modulo p is known?
Original LaTeX notation
Let $p>3$ be a prime and let $a_1,a_2,...,a_{\frac{p-1}{2}}$ be a permutation of $1,2,...,\frac{p-1}{2}$. For which $p$ is it always possible to determine the sequence $a_1,a_2,...,a_{\frac{p-1}{2}}$ if it for all $i,j\in\{1,2,...,\frac{p-1}{2}\}$ with $i\not=j$ the residue of $a_ia_j$ modulo $p$ is known?

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