Question

Using Wilson's theorem, show that if $p$ is prime of the form $p=4n+1$ and if $y=(\frac {p-1}2)!$, then $y^2\equiv -1\mod p$.

score 978 · Answer 1 · 2014-05-02 09:57:26

978

Views

Using Wilson's theorem, show that if $p$ is prime of the form $p=4n+1$ and if $y=(\frac {p-1}2)!$, then $y^2\equiv -1\mod p$.

Published on 02 May 2014 - 9:57

score 416 · Answer 2 · 2014-05-05 06:58:51

416

Views

Does the equation $x^n\equiv 1\pmod p$ has at most $n$ solutions?

Published on 05 May 2014 - 6:58

score 6.3k · Answer 3 · 2014-05-05 15:32:46

6.3k

Views

Modular congruence, splitting a modulo

Published on 05 May 2014 - 15:32

score 278 · Answer 4 · 2014-05-05 17:06:49

278

Views

mod of minus power 1

Published on 05 May 2014 - 17:06

score 78 · Answer 5 · 2014-05-06 12:36:06

78

Views

Congruences - Evaluate $5^{17} \equiv b \pmod {70}$

Published on 06 May 2014 - 12:36

score 584 · Answer 6 · 2014-05-06 13:24:48

584

Views

Congruence $x^n\equiv2 \pmod{13}$ (Multiple Choice)

Published on 06 May 2014 - 13:24

score 152 · Answer 7 · 2014-05-08 16:46:27

152

Views

How to solve the equation $n^2 \equiv 0 \pmod{584}$?

Published on 08 May 2014 - 16:46

score 85 · Answer 8 · 2014-05-08 19:49:17

85

Views

Find the natural numbers $n$ in which $n^2$ divides $584$?

Published on 08 May 2014 - 19:49

score 1k · Answer 9 · 2014-05-09 01:19:29

1k

Views

How to use table of indices to solve a congruence?

Published on 09 May 2014 - 1:19

score 210 · Answer 10 · 2014-05-09 05:17:02

210

Views

Solution set to exponential in congruence

Published on 09 May 2014 - 5:17

score 280 · Answer 11 · 2014-05-09 07:51:14

280

Views

Count subsets whose cardinalities are congruent to 0, 1 and 2 modulo 3 respectively

Published on 09 May 2014 - 7:51

score 72 · Answer 12 · 2014-05-10 09:33:57

72

Views

Can we say that $a=b \implies a \equiv b \pmod{0}$?

Published on 10 May 2014 - 9:33

score 237 · Answer 13 · 2014-05-10 17:55:50

237

Views

Formula for the number of solutions of the congruence equation $xy-wz=0$ over $\mathbb{Z}_p$?

Published on 10 May 2014 - 17:55

score 751 · Answer 14 · 2014-05-10 18:39:31

751

Views

Combining results with Chinese remainder theorem - general case

Published on 10 May 2014 - 18:39

score 864 · Answer 15 · 2014-05-11 15:18:28

864

Views

A congruence involving prime numbers

Published on 11 May 2014 - 15:18

List Question

Using Wilson's theorem, show that if $p$ is prime of the form $p=4n+1$ and if $y=(\frac {p-1}2)!$, then $y^2\equiv -1\mod p$.

Does the equation $x^n\equiv 1\pmod p$ has at most $n$ solutions?

Modular congruence, splitting a modulo

mod of minus power 1

Congruences - Evaluate $5^{17} \equiv b \pmod {70}$

Congruence $x^n\equiv2 \pmod{13}$ (Multiple Choice)

How to solve the equation $n^2 \equiv 0 \pmod{584}$?

Find the natural numbers $n$ in which $n^2$ divides $584$?

How to use table of indices to solve a congruence?

Solution set to exponential in congruence

Count subsets whose cardinalities are congruent to 0, 1 and 2 modulo 3 respectively

Can we say that $a=b \implies a \equiv b \pmod{0}$?

Formula for the number of solutions of the congruence equation $xy-wz=0$ over $\mathbb{Z}_p$?

Combining results with Chinese remainder theorem - general case

A congruence involving prime numbers

Trending Questions

Popular # Hahtags

Popular Questions