benchmarks.wiki / Public workspace

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

Discussing 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? · MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.