Question

Is the modular multiplicative inverse $2^{-1}$ a special case in $\mathbb{Z}_p$ for prime $p > 2$?

score 114 · Answer 1 · 2026-04-13 01:17:32

114

Views

Is the modular multiplicative inverse $2^{-1}$ a special case in $\mathbb{Z}_p$ for prime $p > 2$?

Published on 13 Apr 2026 - 1:17

score 90 · Answer 2 · 2026-04-13 11:04:07

90

Views

Minimum number of rotation of tuples such that all first terms of the tuples are non zero

Published on 13 Apr 2026 - 11:04

score 81 · Answer 3 · 2020-01-14 08:36:35

81

Views

Given $a^b \pmod {c}$, $a^b \pmod {d}$, $a^b \pmod {e}$, how can $a^b mod (cde)$ be deduced?

Published on 14 Jan 2020 - 8:36

score 87 · Answer 4 · 2026-04-13 18:33:51

87

Views

When $\psi_{(\lambda,\xi)} = \frac{(\lambda^2+\xi^2)^2}{(\lambda^2-\xi^2-2\lambda\xi)^2}$ is an integer

Published on 13 Apr 2026 - 18:33

score 77 · Answer 5 · 2026-04-10 12:54:18

77

Views

Are 8 letter blocks for ciphertext needed?

Published on 10 Apr 2026 - 12:54

score 32 · Answer 6 · 2026-04-14 01:34:23

32

Views

What do we know about invertible matrices in modulo space

Published on 14 Apr 2026 - 1:34

score 57 · Answer 7 · 2026-04-12 01:18:07

57

Views

Son of Proving systems of nonlinear modular equations have no solution

Published on 12 Apr 2026 - 1:18

score 614 · Answer 8 · 2026-03-25 14:33:17

614

Views

Show that $x^4 \equiv -4$ (mod $p$) is solvable iff $p \equiv 1$ (mod $4$)

Published on 25 Mar 2026 - 14:33

score 272 · Answer 9 · 2026-04-14 00:18:34

272

Views

System of equations modulo $n$

Published on 14 Apr 2026 - 0:18

score 57 · Answer 10 · 2026-04-14 00:15:26

57

Views

polynomial making with some features

Published on 14 Apr 2026 - 0:15

score 133 · Answer 11 · 2020-01-19 02:50:42

133

Views

Finding the next $x \in \mathbb{Z}^+$ such that $x^2 \equiv 17 \pmod{2^{n+1}}$

Published on 19 Jan 2020 - 2:50

score 64 · Answer 12 · 2020-01-19 22:09:35

64

Views

Inverse with Fermat, Modulo

Published on 19 Jan 2020 - 22:09

score 47 · Answer 13 · 2026-04-01 11:59:24

47

Views

Show that for any integer $x, ax\not\equiv1\pmod{a\cdot b}$ where $a,b$ are integers that $1<a$ and $1<b$

Published on 01 Apr 2026 - 11:59

score 223 · Answer 14 · 2026-04-10 11:14:02

223

Views

show $2^{1194}+1$ is divisible by 65

Published on 10 Apr 2026 - 11:14

score 445 · Answer 15 · 2026-04-12 07:35:05

445

Views

How to calculate inverse modulo with the Euclidean algorithm for RSA

Published on 12 Apr 2026 - 7:35

List Question

Is the modular multiplicative inverse $2^{-1}$ a special case in $\mathbb{Z}_p$ for prime $p > 2$?

Minimum number of rotation of tuples such that all first terms of the tuples are non zero

Given $a^b \pmod {c}$, $a^b \pmod {d}$, $a^b \pmod {e}$, how can $a^b mod (cde)$ be deduced?

When $\psi_{(\lambda,\xi)} = \frac{(\lambda^2+\xi^2)^2}{(\lambda^2-\xi^2-2\lambda\xi)^2}$ is an integer

Are 8 letter blocks for ciphertext needed?

What do we know about invertible matrices in modulo space

Son of Proving systems of nonlinear modular equations have no solution

Show that $x^4 \equiv -4$ (mod $p$) is solvable iff $p \equiv 1$ (mod $4$)

System of equations modulo $n$

polynomial making with some features

Finding the next $x \in \mathbb{Z}^+$ such that $x^2 \equiv 17 \pmod{2^{n+1}}$

Inverse with Fermat, Modulo

Show that for any integer $x, ax\not\equiv1\pmod{a\cdot b}$ where $a,b$ are integers that $1<a$ and $1<b$

show $2^{1194}+1$ is divisible by 65

How to calculate inverse modulo with the Euclidean algorithm for RSA

Trending Questions

Popular # Hahtags

Popular Questions