Question

What is the remainder of $18!$ divided by $437$?

score 1.2k · Answer 1 · 2019-10-29 03:54:24

1.2k

Views

What is the remainder of $18!$ divided by $437$?

Published on 29 Oct 2019 - 3:54

score 169 · Answer 2 · 2026-03-25 03:01:48

169

Views

Finding integral basis of $K=\Bbb Q(\theta)$

Published on 25 Mar 2026 - 3:01

score 118 · Answer 3 · 2019-10-29 14:13:10

118

Views

Solving $39x\equiv75\pmod{102}$

Published on 29 Oct 2019 - 14:13

score 39 · Answer 4 · 2026-04-02 21:50:44

39

Views

Why for 7 | 5m+2n you can just make 7 | 5n+2n - 7n

Published on 02 Apr 2026 - 21:50

score 29 · Answer 5 · 2019-10-30 06:29:35

29

Views

Is this argument valid? If $p$ is a prime and $p \neq 2,3,$ show that $\bar{p} = \bar{1}$ or $\bar{p} = \bar{5}$ in $\mathbb{Z}_6.$

Published on 30 Oct 2019 - 6:29

score 101 · Answer 6 · 2019-10-30 09:12:54

101

Views

Find all integers $a$ s.t. $2x\equiv a$ (mod $24$) and $4x\equiv a^2$ (mod $15$) has a solution.

Published on 30 Oct 2019 - 9:12

score 150 · Answer 7 · 2026-04-09 15:22:26

150

Views

How to solve a non-linear system of modulus equations?

Published on 09 Apr 2026 - 15:22

score 2k · Answer 8 · 2026-04-11 13:17:49

2k

Views

A question about modulus for polynomials

Published on 11 Apr 2026 - 13:17

score 42 · Answer 9 · 2019-10-30 16:25:41

42

Views

How to make a game theoretic version of these chess statements?

Published on 30 Oct 2019 - 16:25

score 99 · Answer 10 · 2026-04-12 10:08:40

99

Views

Modular Arithmetic proof .

Published on 12 Apr 2026 - 10:08

score 500 · Answer 11 · 2019-10-30 20:44:49

500

Views

Calculation of $2^{XXXX} + 3^{XXXX}\pmod{11}$

Published on 30 Oct 2019 - 20:44

score 46 · Answer 12 · 2026-03-29 13:22:42

46

Views

calculation of an immensely large modulus

Published on 29 Mar 2026 - 13:22

score 230 · Answer 13 · 2019-10-31 21:45:58

230

Views

Let a, b, c be positive integers, suppose 5 divides $a^2+b^2+c^2$ prove that 5 divides at least one of a,b or c

Published on 31 Oct 2019 - 21:45

score 49 · Answer 14 · 2019-11-01 02:12:40

49

Views

Using Wilson's theorem show if p is prime and $p\equiv 1(mod4)$ then $x^2\equiv -1(modp)$ has 2 incongruent solutions

Published on 01 Nov 2019 - 2:12

score 127 · Answer 15 · 2026-04-02 12:25:28

127

Views

Solve the congruence : $3n^{3}+2\equiv 0 \pmod{1163}$ where $n\in \mathbb N$

Published on 02 Apr 2026 - 12:25

List Question

What is the remainder of $18!$ divided by $437$?

Finding integral basis of $K=\Bbb Q(\theta)$

Solving $39x\equiv75\pmod{102}$

Why for 7 | 5m+2n you can just make 7 | 5n+2n - 7n

Is this argument valid? If $p$ is a prime and $p \neq 2,3,$ show that $\bar{p} = \bar{1}$ or $\bar{p} = \bar{5}$ in $\mathbb{Z}_6.$

Find all integers $a$ s.t. $2x\equiv a$ (mod $24$) and $4x\equiv a^2$ (mod $15$) has a solution.

How to solve a non-linear system of modulus equations?

A question about modulus for polynomials

How to make a game theoretic version of these chess statements?

Modular Arithmetic proof .

Calculation of $2^{XXXX} + 3^{XXXX}\pmod{11}$

calculation of an immensely large modulus

Let a, b, c be positive integers, suppose 5 divides $a^2+b^2+c^2$ prove that 5 divides at least one of a,b or c

Using Wilson's theorem show if p is prime and $p\equiv 1(mod4)$ then $x^2\equiv -1(modp)$ has 2 incongruent solutions

Solve the congruence : $3n^{3}+2\equiv 0 \pmod{1163}$ where $n\in \mathbb N$

Trending Questions

Popular # Hahtags

Popular Questions