Question

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

score 83 · Answer 1 · 2018-02-09 10:56:29

83

Views

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

Published on 09 Feb 2018 - 10:56

score 53 · Answer 2 · 2026-03-24 16:19:05

53

Views

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

Published on 24 Mar 2026 - 16:19

score 772 · Answer 3 · 2018-02-13 08:00:50

772

Views

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

Published on 13 Feb 2018 - 8:00

score 1.9k · Answer 4 · 2018-02-13 23:25:20

1.9k

Views

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

Published on 13 Feb 2018 - 23:25

score 217 · Answer 5 · 2018-02-14 04:30:21

217

Views

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

Published on 14 Feb 2018 - 4:30

score 50 · Answer 6 · 2026-03-16 22:23:42

50

Views

Inverse modular exponentation

Published on 16 Mar 2026 - 22:23

score 142 · Answer 7 · 2026-03-24 23:44:49

142

Views

The Chinese hypothesis revisited

Published on 24 Mar 2026 - 23:44

score 89 · Answer 8 · 2026-03-22 19:50:30

89

Views

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

Published on 22 Mar 2026 - 19:50

score 38 · Answer 9 · 2026-03-22 14:30:45

38

Views

What is a congruence equation for this problem

Published on 22 Mar 2026 - 14:30

score 519 · Answer 10 · 2018-02-17 21:11:13

519

Views

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

Published on 17 Feb 2018 - 21:11

score 69 · Answer 11 · 2018-02-18 16:02:06

69

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 18 Feb 2018 - 16:02

score 46 · Answer 12 · 2018-02-20 01:48:54

46

Views

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

Published on 20 Feb 2018 - 1:48

score 265 · Answer 13 · 2018-02-20 11:20:12

265

Views

Number of solution of exponential equation modulo p (prime)

Published on 20 Feb 2018 - 11:20

score 175 · Answer 14 · 2026-03-21 22:42:27

175

Views

Hard Modulo arithmetic

Published on 21 Mar 2026 - 22:42

score 18 · Answer 15 · 2026-03-23 11:28:14

18

Views

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

Published on 23 Mar 2026 - 11:28

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