Question

Show that $x^2+x+23\equiv 0\mod 173$ has a solution $\iff \left(\frac{28}{173}\right) = 1$

score 158 · Answer 1 · 2026-03-25 23:39:15

158

Views

Show that $x^2+x+23\equiv 0\mod 173$ has a solution $\iff \left(\frac{28}{173}\right) = 1$

Published on 25 Mar 2026 - 23:39

score 55 · Answer 2 · 2016-11-24 13:17:01

55

Views

Calculate the sequence of pseudo-random-numbers for the following linear congruential generator

Published on 24 Nov 2016 - 13:17

score 89 · Answer 3 · 2016-11-24 18:07:55

89

Views

Modular arithmetic r = c (mod a), s = c (mod b), find (mod a)

Published on 24 Nov 2016 - 18:07

score 111 · Answer 4 · 2016-11-25 16:05:01

111

Views

Is there a more efficient method to determine the last

Published on 25 Nov 2016 - 16:05

score 159 · Answer 5 · 2016-11-25 17:29:53

159

Views

Show that from a set of all 11 integers one can select six numbers such that $a^2+b^2+c^2=d^2+e^2+f^2\pmod {12} $)

Published on 25 Nov 2016 - 17:29

score 200 · Answer 6 · 2016-11-27 12:52:42

200

Views

Prove that if $g^{(p-1)/2} \equiv -1 (mod \mbox{ } p)$ then its smaller power can't be congruent to 1.

Published on 27 Nov 2016 - 12:52

score 2.8k · Answer 7 · 2016-11-28 15:25:32

2.8k

Views

Divisibility rules in the binary system

Published on 28 Nov 2016 - 15:25

score 283 · Answer 8 · 2016-11-28 16:21:33

283

Views

Does a solution to this congruent equation exist?

Published on 28 Nov 2016 - 16:21

score 32 · Answer 9 · 2016-11-28 21:30:51

32

Views

About primitive root and quadratic residue.

Published on 28 Nov 2016 - 21:30

score 453 · Answer 10 · 2016-11-29 12:22:07

453

Views

Is the finite sum of factorials constant modulo the summation limit?

Published on 29 Nov 2016 - 12:22

score 279 · Answer 11 · 2016-12-01 10:03:32

279

Views

Least residue of $7^5$ modulo $50$

Published on 01 Dec 2016 - 10:03

score 249 · Answer 12 · 2016-12-01 21:22:35

249

Views

Proof Using Wilson's Theorem

Published on 01 Dec 2016 - 21:22

score 33 · Answer 13 · 2016-12-01 22:52:52

33

Views

How do I show there is always an integer $k>1$ and $k<n$ for which :$\displaystyle n! \bmod {n}^{k}\neq 0$?

Published on 01 Dec 2016 - 22:52

score 882 · Answer 14 · 2016-12-02 09:38:17

882

Views

Determine whether $11^{10} - 1$ is divisible by $1100$

Published on 02 Dec 2016 - 9:38

score 1.8k · Answer 15 · 2016-12-03 02:19:21

1.8k

Views

Show that if $n$ is odd and isn't divisible by $3$ then $n^2 \equiv 1 (\bmod 24)$

Published on 03 Dec 2016 - 2:19

List Question

Show that $x^2+x+23\equiv 0\mod 173$ has a solution $\iff \left(\frac{28}{173}\right) = 1$

Calculate the sequence of pseudo-random-numbers for the following linear congruential generator

Modular arithmetic r = c (mod a), s = c (mod b), find (mod a)

Is there a more efficient method to determine the last

Show that from a set of all 11 integers one can select six numbers such that $a^2+b^2+c^2=d^2+e^2+f^2\pmod {12} $)

Prove that if $g^{(p-1)/2} \equiv -1 (mod \mbox{ } p)$ then its smaller power can't be congruent to 1.

Divisibility rules in the binary system

Does a solution to this congruent equation exist?

About primitive root and quadratic residue.

Is the finite sum of factorials constant modulo the summation limit?

Least residue of $7^5$ modulo $50$

Proof Using Wilson's Theorem

How do I show there is always an integer $k>1$ and $k<n$ for which :$\displaystyle n! \bmod {n}^{k}\neq 0$?

Determine whether $11^{10} - 1$ is divisible by $1100$

Show that if $n$ is odd and isn't divisible by $3$ then $n^2 \equiv 1 (\bmod 24)$

Trending Questions

Popular # Hahtags

Popular Questions