MODBasic Basic

Problem - 4181

Let $p$ be an odd prime, and integer $a$ has multiplicative order of $2k$ modulo $p$, then $a^k\equiv -1\pmod{p}$.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error