benchmarks.wiki / Public workspace

MATH / Suppose m is a two-digit positive integer such that 6^-1pmod m exists and 6^-1equiv 6^2pmod m. What is m? · Discussion

Discussing Suppose m is a two-digit positive integer such that 6^{-1}pmod m exists and 6^{-1}equiv 6^2pmod m. What is m? · 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.