Question

Solve $x^3+3x^2-6x-88\equiv0\bmod{402}$

score 86 · Answer 1 · 2026-04-17 14:00:05

86

Views

Solve $x^3+3x^2-6x-88\equiv0\bmod{402}$

Published on 17 Apr 2026 - 14:00

score 55 · Answer 2 · 2026-03-26 10:14:04

55

Views

Find all solutions for $3x+y \equiv 2 \pmod{9}$

Published on 26 Mar 2026 - 10:14

score 775 · Answer 3 · 2026-04-16 22:13:28

775

Views

$(x+1)^n \equiv x^n +1 \mod n$ iff $n$ is prime

Published on 16 Apr 2026 - 22:13

score 1.9k · Answer 4 · 2026-04-15 23:41:40

1.9k

Views

Proving that if n is an odd positive integer, then $n^2$ ≡ 1 (mod 8) by contradiction?

Published on 15 Apr 2026 - 23:41

score 219 · Answer 5 · 2026-04-17 10:00:07

219

Views

Show that $m$ is prime if there exists $a\in\Bbb Z$ such that $a^{m-1}\equiv 1\pmod m$

Published on 17 Apr 2026 - 10:00

score 55 · Answer 6 · 2026-04-29 12:19:51

55

Views

Inverse modular exponentation

Published on 29 Apr 2026 - 12:19

score 146 · Answer 7 · 2026-04-29 12:44:31

146

Views

The Chinese hypothesis revisited

Published on 29 Apr 2026 - 12:44

score 92 · Answer 8 · 2026-04-15 13:11:54

92

Views

What is the the nature of $(p^p \pm 1)/(p\pm 1)$?

Published on 15 Apr 2026 - 13:11

score 41 · Answer 9 · 2026-04-11 02:23:39

41

Views

What is a congruence equation for this problem

Published on 11 Apr 2026 - 2:23

score 522 · Answer 10 · 2026-04-15 03:01:15

522

Views

How many solutions does the equation $x^p\equiv x \pmod{p^n}$ have in $\mathbb{Z}_{p^n}$?

Published on 15 Apr 2026 - 3:01

score 72 · Answer 11 · 2026-04-16 00:28:44

72

Views

Find divisibility for $n \in \mathbb {Z+}, 2\nmid n, 2^n-1, 2^n +1$ w.r.t. $5$ using congruence arithmetic.

Published on 16 Apr 2026 - 0:28

score 49 · Answer 12 · 2026-04-16 05:56:05

49

Views

Given odd positive integer, $n=2m-1$, $n \equiv 1 \pmod 4 \implies m \equiv 1 \pmod 2$

Published on 16 Apr 2026 - 5:56

score 268 · Answer 13 · 2026-04-13 10:11:49

268

Views

Number of solution of exponential equation modulo p (prime)

Published on 13 Apr 2026 - 10:11

score 179 · Answer 14 · 2026-04-12 15:26:18

179

Views

Hard Modulo arithmetic

Published on 12 Apr 2026 - 15:26

score 20 · Answer 15 · 2026-04-14 18:47:59

20

Views

Are there pairs $(x,n)$ for which :$x^n=0\bmod x+n$ with $x \neq n$ are positive integers?

Published on 14 Apr 2026 - 18:47

List Question

Solve $x^3+3x^2-6x-88\equiv0\bmod{402}$

Find all solutions for $3x+y \equiv 2 \pmod{9}$

$(x+1)^n \equiv x^n +1 \mod n$ iff $n$ is prime

Proving that if n is an odd positive integer, then $n^2$ ≡ 1 (mod 8) by contradiction?

Show that $m$ is prime if there exists $a\in\Bbb Z$ such that $a^{m-1}\equiv 1\pmod m$

Inverse modular exponentation

The Chinese hypothesis revisited

What is the the nature of $(p^p \pm 1)/(p\pm 1)$?

What is a congruence equation for this problem

How many solutions does the equation $x^p\equiv x \pmod{p^n}$ have in $\mathbb{Z}_{p^n}$?

Find divisibility for $n \in \mathbb {Z+}, 2\nmid n, 2^n-1, 2^n +1$ w.r.t. $5$ using congruence arithmetic.

Given odd positive integer, $n=2m-1$, $n \equiv 1 \pmod 4 \implies m \equiv 1 \pmod 2$

Number of solution of exponential equation modulo p (prime)

Hard Modulo arithmetic

Are there pairs $(x,n)$ for which :$x^n=0\bmod x+n$ with $x \neq n$ are positive integers?

Trending Questions

Popular # Hahtags

Popular Questions