benchmarks.wiki / Public workspace
Omni-MATH / Let Z/nZ denote the set of integers considered modulo n (hence Z/nZ has n elements). Find all positive integers n for which there exists a bijective function g:Z/nZ→Z/nZ, such that…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
Let denote the set of integers considered modulo (hence has elements). Find all positive integers for which there exists a bijective function , such that the 101 functions
are all bijections on .
[i]Ashwin Sah and Yang Liu[/i]
Plain-text mathematical notation (without MathML)
Let Z/nZ denote the set of integers considered modulo n (hence Z/nZ has n elements). Find all positive integers n for which there exists a bijective function g:Z/nZ→Z/nZ, such that the 101 functions g(x), g(x)+x, g(x)+2x, …, g(x)+100x are all bijections on Z/nZ. [i]Ashwin Sah and Yang Liu[/i]
Original LaTeX notation
Let $\mathbb{Z}/n\mathbb{Z}$ denote the set of integers considered modulo $n$ (hence $\mathbb{Z}/n\mathbb{Z}$ has $n$ elements). Find all positive integers $n$ for which there exists a bijective function $g: \mathbb{Z}/n\mathbb{Z} \to \mathbb{Z}/n\mathbb{Z}$, such that the 101 functions
\[g(x), \quad g(x) + x, \quad g(x) + 2x, \quad \dots, \quad g(x) + 100x\]
are all bijections on $\mathbb{Z}/n\mathbb{Z}$.
[i]Ashwin Sah and Yang Liu[/i]Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import