Question

Having trouble understanding the concept of multiplicative inverse of modulo

score 512 · Answer 1 · 2026-04-13 09:05:18

512

Views

Having trouble understanding the concept of multiplicative inverse of modulo

Published on 13 Apr 2026 - 9:05

score 43 · Answer 2 · 2026-03-25 09:35:45

43

Views

How to know when it's possible to solve a modular equation?

Published on 25 Mar 2026 - 9:35

score 123 · Answer 3 · 2020-01-01 04:58:17

123

Views

I can't understand the equation "$p-q=15-9\times$(the number of borrowing(s) of $p-q$)"

Published on 01 Jan 2020 - 4:58

score 415 · Answer 4 · 2026-04-13 01:14:52

415

Views

Finding $589x \equiv 209 \pmod {817}$

Published on 13 Apr 2026 - 1:14

score 152 · Answer 5 · 2026-04-12 18:37:59

152

Views

Easy question about closure in the multiplicative group of integers modulo m

Published on 12 Apr 2026 - 18:37

score 165 · Answer 6 · 2020-01-01 20:15:47

165

Views

Finding $9^{123456789} \pmod{100}$

Published on 01 Jan 2020 - 20:15

score 146 · Answer 7 · 2026-03-25 01:16:49

146

Views

Hensel's Lemma - Unique in what sense?

Published on 25 Mar 2026 - 1:16

score 293 · Answer 8 · 2026-04-13 19:55:55

293

Views

I can't determine the maximum natural number which is unable to be represented as $17\times x+23\times y$

Published on 13 Apr 2026 - 19:55

score 123 · Answer 9 · 2026-03-25 17:41:52

123

Views

Sum of members from multiplicative group of prime order $k$ modulo prime $P$? $c$ in: $\sum_{n=1}^{k} (g^n \bmod P) = c \cdot P$ ($g$ prime order $k$)

Published on 25 Mar 2026 - 17:41

score 79 · Answer 10 · 2026-04-10 19:31:05

79

Views

Modular arithmetic, Discrete math.

Published on 10 Apr 2026 - 19:31

score 86 · Answer 11 · 2026-04-13 07:22:34

86

Views

$k-$th root modulo $n$.

Published on 13 Apr 2026 - 7:22

score 69 · Answer 12 · 2026-03-29 22:12:34

69

Views

Solution verification: $2851^{604^{20}}\overset{\text{?}} \equiv\pmod{14}$

Published on 29 Mar 2026 - 22:12

score 205 · Answer 13 · 2026-03-31 13:16:05

205

Views

Prove that for any integers $x, y$ and $z$ and any integer $k$that if $x \equiv_k y$ and $y \equiv_k z$ then $x \equiv_k z$

Published on 31 Mar 2026 - 13:16

score 301 · Answer 14 · 2026-04-01 11:18:02

301

Views

Find the least positive integer $M$ such that $M^{77} \equiv 14 \pmod{31}$

Published on 01 Apr 2026 - 11:18

score 43 · Answer 15 · 2026-03-28 01:13:31

43

Views

Efficient way to calculate A^B mod C, where B is high number

Published on 28 Mar 2026 - 1:13

List Question

Having trouble understanding the concept of multiplicative inverse of modulo

How to know when it's possible to solve a modular equation?

I can't understand the equation "$p-q=15-9\times$(the number of borrowing(s) of $p-q$)"

Finding $589x \equiv 209 \pmod {817}$

Easy question about closure in the multiplicative group of integers modulo m

Finding $9^{123456789} \pmod{100}$

Hensel's Lemma - Unique in what sense?

I can't determine the maximum natural number which is unable to be represented as $17\times x+23\times y$

Sum of members from multiplicative group of prime order $k$ modulo prime $P$? $c$ in: $\sum_{n=1}^{k} (g^n \bmod P) = c \cdot P$ ($g$ prime order $k$)

Modular arithmetic, Discrete math.

$k-$th root modulo $n$.

Solution verification: $2851^{604^{20}}\overset{\text{?}} \equiv\pmod{14}$

Prove that for any integers $x, y$ and $z$ and any integer $k$that if $x \equiv_k y$ and $y \equiv_k z$ then $x \equiv_k z$

Find the least positive integer $M$ such that $M^{77} \equiv 14 \pmod{31}$

Efficient way to calculate A^B mod C, where B is high number

Trending Questions

Popular # Hahtags

Popular Questions