List questions from congruences

Published on 29 Jan 2017 - 0:58

643

Views

Modular Arithmetic and non zero solutions

Published on 30 Jan 2017 - 1:20

3.3k

Views

Showing a number $n$ is prime if $(n-2)! \equiv 1 \pmod n$

Published on 01 Feb 2017 - 21:00

2.1k

Views

Prove that if $p$ and $8p-1$ are prime numbers then $8p+1$ is composite

Published on 02 Feb 2017 - 16:17

59

Views

Idea to solve $3^{\phi(n)}\equiv 4 \pmod{11}$.

Published on 09 Feb 2017 - 12:00

2.2k

Views

Solving the congruence $x^2 \equiv 4 \mod 105$. Is there an alternative to using Chinese Remainder Theorem multiple times?

Published on 09 Feb 2017 - 21:08

65

Views

Solve: $169x \equiv 2267 \pmod{113}$

Published on 10 Feb 2017 - 6:38

76

Views

Could be an odd integer number with repeat digits a prime?

Published on 26 Mar 2026 - 17:29

71

Views

How to use Hensels Lemma

Published on 13 Feb 2017 - 23:15

12

Views

Help with finding $x,y \in \mathbb{Z} $ such that work for statement with reminders

Published on 27 Feb 2026 - 16:17

763

Views

Show if $p > 3$ is prime, then $(p + 1) | p!$

Published on 16 Feb 2017 - 1:00

2.3k

Views

Find the invertible elements and zero divisors in the ring $(\mathbb{Z}_{21}, +, \cdot)$. For each invertible element find the inverse.

Published on 17 Feb 2017 - 1:10

5.1k

Views

Find all solutions using the Chinese Remainder Theorem

Published on 17 Feb 2017 - 21:28

93

Views

if $a\cong b\pmod m$ prove $(a,m)=(b,m)$

Published on 18 Feb 2017 - 2:36

104

Views

What is a simple solution to this system of 5 linear congruences?

Published on 18 Feb 2017 - 16:20

List Question

If P is prime, prove that $(p-1)!$ is congruent to $(p-1)$ $\pmod {1+2+3...+(p-1)}$

Modular Arithmetic and non zero solutions

Showing a number $n$ is prime if $(n-2)! \equiv 1 \pmod n$

Prove that if $p$ and $8p-1$ are prime numbers then $8p+1$ is composite

Idea to solve $3^{\phi(n)}\equiv 4 \pmod{11}$.

Solving the congruence $x^2 \equiv 4 \mod 105$. Is there an alternative to using Chinese Remainder Theorem multiple times?

Solve: $169x \equiv 2267 \pmod{113}$

Could be an odd integer number with repeat digits a prime?

How to use Hensels Lemma

Help with finding $x,y \in \mathbb{Z} $ such that work for statement with reminders

Show if $p > 3$ is prime, then $(p + 1) | p!$

Find the invertible elements and zero divisors in the ring $(\mathbb{Z}_{21}, +, \cdot)$. For each invertible element find the inverse.

Find all solutions using the Chinese Remainder Theorem

if $a\cong b\pmod m$ prove $(a,m)=(b,m)$

What is a simple solution to this system of 5 linear congruences?

Trending Questions

Popular # Hahtags

Popular Questions