List questions from congruences

Published on 25 Apr 2016 - 3:57

97

Views

Question about the solutions to quadratic congruence $x^2\equiv -1(\mbox{mod}\;p)$

Published on 28 Mar 2026 - 21:34

39

Views

Why if $a = kb + c$ then $a \text{ mod } b = c \text{ mod } b$

Published on 26 Apr 2016 - 17:42

167

Views

Understanding a proof from Rotman's "Advanced Modern Algebra"(Chinese Remainder Theorem)

Published on 26 Apr 2016 - 22:00

1.3k

Views

Find out all solutions of the congruence $x^2 \equiv 9 \mod 256$.

Published on 27 Apr 2016 - 17:59

2.7k

Views

Determine $x$ if $x = 4 \mod 17$ and $x = 3 \mod 11$.

Published on 02 May 2016 - 0:09

2.6k

Views

Prove that if $ab \equiv cd \pmod{n}$ and $b \equiv d \pmod n$ and $\gcd(b, n) = 1$ then $a \equiv c \pmod n$.

Published on 02 May 2016 - 13:18

261

Views

Can I apply Chinese remainder theorem here?

Published on 02 May 2016 - 13:19

285

Views

Prove that $24^{31}$ is congruent to $23^{32}$ mod 19.

Published on 02 May 2016 - 19:29

57

Views

Confused about a neither statement and modular

Published on 03 May 2016 - 3:17

3k

Views

Number of solutions to $x^2\equiv b \mod p^n$

Published on 28 Mar 2026 - 21:34

66

Views

$n-1 = pq-1 \equiv q-1\pmod{p-1}$ where $n\in\mathbb{N}$ such that $n=pq$ for two distinct large primes $p$ and $q$.

Published on 04 May 2016 - 9:44

407

Views

Corollary to Fermat's Little Theorem

Published on 04 May 2016 - 15:34

70

Views

Help with congruence and divisibility exercise

Published on 04 May 2016 - 16:02

55

Views

Integer division and congruence exercise

Published on 05 May 2016 - 2:53

List Question

Finding the digit in the units place

Question about the solutions to quadratic congruence $x^2\equiv -1(\mbox{mod}\;p)$

Why if $a = kb + c$ then $a \text{ mod } b = c \text{ mod } b$

Understanding a proof from Rotman's "Advanced Modern Algebra"(Chinese Remainder Theorem)

Find out all solutions of the congruence $x^2 \equiv 9 \mod 256$.

Determine $x$ if $x = 4 \mod 17$ and $x = 3 \mod 11$.

Prove that if $ab \equiv cd \pmod{n}$ and $b \equiv d \pmod n$ and $\gcd(b, n) = 1$ then $a \equiv c \pmod n$.

Can I apply Chinese remainder theorem here?

Prove that $24^{31}$ is congruent to $23^{32}$ mod 19.

Confused about a neither statement and modular

Number of solutions to $x^2\equiv b \mod p^n$

$n-1 = pq-1 \equiv q-1\pmod{p-1}$ where $n\in\mathbb{N}$ such that $n=pq$ for two distinct large primes $p$ and $q$.

Corollary to Fermat's Little Theorem

Help with congruence and divisibility exercise

Integer division and congruence exercise

Trending Questions

Popular # Hahtags

Popular Questions