List questions from modular-arithmetic

Published on 26 Mar 2026 - 23:44

82

Views

How to justify that the sequence $n^n\bmod 5$ is periodic?

Published on 24 Jul 2018 - 2:33

138

Views

Prove that the equation: ${a^k + b^k \equiv c^k}\mod{p}$ has no solutions under the following conditions

Published on 24 Jul 2018 - 12:19

192

Views

Check whether $k \in [0, p]$ in the equation: ${a^k + b^k \equiv c^k}\mod{p}$ has no solutions under the following conditions

Published on 26 Mar 2026 - 14:35

75

Views

$(a^n+ b^n) \pmod p = c^n \pmod p$ relation between $n$ and $p$

Published on 27 Mar 2026 - 0:03

78

Views

Count $(a,b)$ pairs such that $a^b\equiv 2 \pmod{p}$

Published on 25 Jul 2018 - 7:03

116

Views

Get the floor value under modular division for very large number.

Published on 25 Jul 2018 - 17:27

120

Views

$p\mid a^2+b^2$ Prove that $p\mid a$ and $p\mid b$

Published on 25 Jul 2018 - 21:28

84

Views

How to find the least positive $K$ such that $N^K \equiv 1 \pmod{P}$ where $P$ is prime and $P$ doesn't divide $N$?

Published on 25 Mar 2026 - 21:01

161

Views

Congruent solution implies an integer solution.

Published on 23 Mar 2026 - 20:45

52

Views

$1 + b^n \equiv c^n \pmod p$ find values of $n$ in $(0,p)$

Published on 27 Jul 2018 - 15:52

79

Views

Is security of the modulus needed to maintain the "discrete logarithm problem"?

Published on 23 Feb 2026 - 2:56

308

Views

Pattern in arithmetic progression modulo 3

Published on 25 Mar 2026 - 14:18

417

Views

Modular arithmetic power rule implications

Published on 29 Jul 2018 - 6:45

138

Views

Why does $10^{\frac{p-1}{2}}\equiv \pm1 \pmod p$ when $p \nmid 10$?

Published on 26 Mar 2026 - 1:34

List Question

Linear congruence equations

How to justify that the sequence $n^n\bmod 5$ is periodic?

Prove that the equation: ${a^k + b^k \equiv c^k}\mod{p}$ has no solutions under the following conditions

Check whether $k \in [0, p]$ in the equation: ${a^k + b^k \equiv c^k}\mod{p}$ has no solutions under the following conditions

$(a^n+ b^n) \pmod p = c^n \pmod p$ relation between $n$ and $p$

Count $(a,b)$ pairs such that $a^b\equiv 2 \pmod{p}$

Get the floor value under modular division for very large number.

$p\mid a^2+b^2$ Prove that $p\mid a$ and $p\mid b$

How to find the least positive $K$ such that $N^K \equiv 1 \pmod{P}$ where $P$ is prime and $P$ doesn't divide $N$?

Congruent solution implies an integer solution.

$1 + b^n \equiv c^n \pmod p$ find values of $n$ in $(0,p)$

Is security of the modulus needed to maintain the "discrete logarithm problem"?

Pattern in arithmetic progression modulo 3

Modular arithmetic power rule implications

Why does $10^{\frac{p-1}{2}}\equiv \pm1 \pmod p$ when $p \nmid 10$?

Trending Questions

Popular # Hahtags

Popular Questions