List questions from congruences

Published on 23 May 2014 - 18:33

45

Views

How many solution this equation has?

Published on 25 May 2014 - 17:37

130

Views

How to solve this quadratic congruence equation?

Published on 26 May 2014 - 10:00

76

Views

Congruent Equation Prove

Published on 28 May 2014 - 13:49

36

Views

prove this Congruent equation

Published on 28 May 2014 - 14:43

99

Views

Congruency by completing the square

Published on 25 Mar 2026 - 9:33

2.3k

Views

$a \equiv b \pmod n$ and $c\equiv d \pmod n$ implies $ac \equiv bd \pmod n$

Published on 30 May 2014 - 20:13

546

Views

Proving $n^{97}\equiv n\text{ mod }4501770$

Published on 31 May 2014 - 11:21

460

Views

How to use Legendre symbol to find a prime which divides $ax^2+b$?

Published on 05 Jun 2014 - 2:18

118

Views

Given $2^7 \equiv 2 \mod n$ and $3^7 \equiv 3 \mod n$, prove for all $a$ in $\mathbb{Z}$: $a^7 \equiv a \mod n$

Published on 06 Jun 2014 - 11:38

128

Views

Diophantine Equation (Hint or Help)

Published on 08 Jun 2014 - 6:07

82

Views

Number of solutions of some congruence equations.

Published on 08 Jun 2014 - 21:29

4.7k

Views

How do you prove that $ n^5$ is congruent to $ n$ mod 10?

Published on 09 Jun 2014 - 2:57

555

Views

$p$ is an odd prime and $a\in\mathbb{Z}$ with $\gcd (a,p)=1$ implies $\exists x\in\mathbb{Z}:x^2\equiv a\bmod p$ iff $a^\frac{p-1}{2}\equiv 1\mod p$

Published on 09 Jun 2014 - 12:15

23

Views

contextual system of congruences

Published on 13 Jun 2014 - 16:19

List Question

Techniques in solving the congruence modulo

How many solution this equation has?

How to solve this quadratic congruence equation?

Congruent Equation Prove

prove this Congruent equation

Congruency by completing the square

$a \equiv b \pmod n$ and $c\equiv d \pmod n$ implies $ac \equiv bd \pmod n$

Proving $n^{97}\equiv n\text{ mod }4501770$

How to use Legendre symbol to find a prime which divides $ax^2+b$?

Given $2^7 \equiv 2 \mod n$ and $3^7 \equiv 3 \mod n$, prove for all $a$ in $\mathbb{Z}$: $a^7 \equiv a \mod n$

Diophantine Equation (Hint or Help)

Number of solutions of some congruence equations.

How do you prove that $ n^5$ is congruent to $ n$ mod 10?

$p$ is an odd prime and $a\in\mathbb{Z}$ with $\gcd (a,p)=1$ implies $\exists x\in\mathbb{Z}:x^2\equiv a\bmod p$ iff $a^\frac{p-1}{2}\equiv 1\mod p$

contextual system of congruences

Trending Questions

Popular # Hahtags

Popular Questions