olymmath

US-TST 2019 Problem 2

  • Answer

Let Z/nZ\mathbb{Z} / n \mathbb{Z} denote the set of integers considered modulo nn (hence Z/nZ\mathbb{Z} / n \mathbb{Z} has nn elements). Find all positive integers nn for which there exists a bijective function g:Z/nZ→Z/nZg: \mathbb{Z} / n \mathbb{Z} \rightarrow \mathbb{Z} / n \mathbb{Z}, such that the 101 functions g(x),g(x)+x,g(x)+2x,…,g(x)+100xg(x), g(x)+x, g(x)+2 x, \ldots, g(x)+100 x are all bijections on Z/nZ\mathbb{Z} / n \mathbb{Z}.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

all numbers relatively prime to 101!

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator us-tst/2019/p2 · Tag QWAT99GMWY · Edit this page on GitHub · Keys: j next, k previous