Question

Explain negative modulo like I'm five?

score 87 · Answer 1 · 2019-12-03 23:02:49

87

Views

Explain negative modulo like I'm five?

Published on 03 Dec 2019 - 23:02

score 35 · Answer 2 · 2026-04-12 08:12:43

35

Views

Multiple solutions for a monic degree-5 polynomial in $\mathbb{Z}_{5}[x]$ for which all elements of $\mathbb{Z}_{5}$ are roots

Published on 12 Apr 2026 - 8:12

score 206 · Answer 3 · 2026-03-29 07:29:07

206

Views

Prove that given 17 integers, the sum of 9 of them is divisible by 9.

Published on 29 Mar 2026 - 7:29

score 52 · Answer 4 · 2026-04-09 04:28:40

52

Views

Modular Arithmetic: Problem with the calculation

Published on 09 Apr 2026 - 4:28

score 37 · Answer 5 · 2026-04-13 08:41:58

37

Views

Modular Arithmetic: What is the solution in this case?

Published on 13 Apr 2026 - 8:41

score 75 · Answer 6 · 2026-03-27 23:31:18

75

Views

For equation $B^e \bmod M = X$, if all values except exponent $e$ are known, can an $e$ value that works be efficiently found?

Published on 27 Mar 2026 - 23:31

score 51 · Answer 7 · 2019-12-04 20:46:28

51

Views

Modular Exponentiation $a^n \bmod10$ for $a=\{2,3,...,9\}$

Published on 04 Dec 2019 - 20:46

score 76 · Answer 8 · 2019-12-05 10:58:10

76

Views

$ x^2 \equiv a \mbox{ } \mbox{mod} \mbox{ } p$ has solution $x$ $\Leftrightarrow a^\frac{p-1}{2} \equiv 1\mbox{ } \mbox{mod} \mbox{ } p $

Published on 05 Dec 2019 - 10:58

score 448 · Answer 9 · 2019-12-06 12:19:21

448

Views

If $a+b = 2020$ and $ab$ is a multiple of $2020$ , find all pairs of $(a,b)$

Published on 06 Dec 2019 - 12:19

score 97 · Answer 10 · 2019-12-06 14:24:45

97

Views

Prove $k \equiv (-1)^n \bmod p$

Published on 06 Dec 2019 - 14:24

score 76 · Answer 11 · 2026-04-09 11:49:52

76

Views

how to solve this kind of modular arithmetic problems with exponents?

Published on 09 Apr 2026 - 11:49

score 716 · Answer 12 · 2026-04-10 14:47:34

716

Views

how to find multiplicative inverse in a Galois field?

Published on 10 Apr 2026 - 14:47

score 124 · Answer 13 · 2019-12-07 07:51:54

124

Views

If $m \equiv 5\mod 10 $ prove that $1991 \mid 12^m + 9^m + 8^m + 6^m$

Published on 07 Dec 2019 - 7:51

score 164 · Answer 14 · 2026-04-13 05:33:38

164

Views

Why does $(g^b \bmod m)^a \bmod m = (g^a \bmod m)^b \bmod m$?

Published on 13 Apr 2026 - 5:33

score 58 · Answer 15 · 2026-04-11 05:56:12

58

Views

How to do division of two numbers which are already under modulo 'm'?

Published on 11 Apr 2026 - 5:56

List Question

Explain negative modulo like I'm five?

Multiple solutions for a monic degree-5 polynomial in $\mathbb{Z}_{5}[x]$ for which all elements of $\mathbb{Z}_{5}$ are roots

Prove that given 17 integers, the sum of 9 of them is divisible by 9.

Modular Arithmetic: Problem with the calculation

Modular Arithmetic: What is the solution in this case?

For equation $B^e \bmod M = X$, if all values except exponent $e$ are known, can an $e$ value that works be efficiently found?

Modular Exponentiation $a^n \bmod10$ for $a=\{2,3,...,9\}$

$ x^2 \equiv a \mbox{ } \mbox{mod} \mbox{ } p$ has solution $x$ $\Leftrightarrow a^\frac{p-1}{2} \equiv 1\mbox{ } \mbox{mod} \mbox{ } p $

If $a+b = 2020$ and $ab$ is a multiple of $2020$ , find all pairs of $(a,b)$

Prove $k \equiv (-1)^n \bmod p$

how to solve this kind of modular arithmetic problems with exponents?

how to find multiplicative inverse in a Galois field?

If $m \equiv 5\mod 10 $ prove that $1991 \mid 12^m + 9^m + 8^m + 6^m$

Why does $(g^b \bmod m)^a \bmod m = (g^a \bmod m)^b \bmod m$?

How to do division of two numbers which are already under modulo 'm'?

Trending Questions

Popular # Hahtags

Popular Questions