benchmarks.wiki / Public workspace

MATH / Let m be a positive integer, and suppose that 9 is its own inverse pmod m, but 3 is textbf{not} its own inverse pmod m. How many possible values for m are there?

Problem

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

problem

Let mm be a positive integer, and suppose that 99 is its own inverse $\pmod m$, but 33 is $\textbf{not}$ its own inverse $\pmod m$. How many possible values for mm are there?
Plain-text mathematical notation (without MathML)
Let m be a positive integer, and suppose that 9 is its own inverse $\pmod m$, but 3 is $\textbf{not}$ its own inverse $\pmod m$.

How many possible values for m are there?
Original LaTeX notation
Let $m$ be a positive integer, and suppose that $9$ is its own inverse $\pmod m$, but $3$ is $\textbf{not}$ its own inverse $\pmod m$.

How many possible values for $m$ are there?

level

Level 5

type

Number Theory

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