Question

Existence of only ONE solution to this modulo

score 53 · Answer 1 · 2019-10-17 02:06:38

53

Views

Existence of only ONE solution to this modulo

Published on 17 Oct 2019 - 2:06

score 50 · Answer 2 · 2026-04-10 19:08:56

50

Views

Is it possible to have the gcd of 2 polynomials be the same in all fields?

Published on 10 Apr 2026 - 19:08

score 49 · Answer 3 · 2019-10-17 19:31:58

49

Views

How did this word problem related to linear congruences get $11x=17(mod24)$

Published on 17 Oct 2019 - 19:31

score 30 · Answer 4 · 2026-03-25 07:45:42

30

Views

Find $a$ inverse modulo 30, $1\le a \le 30$. For each $a$ you find, find the inverse of each $a$ that have inverse modulo 30

Published on 25 Mar 2026 - 7:45

score 432 · Answer 5 · 2026-03-28 02:49:42

432

Views

Solve discrete logarithm, $a^x = b \bmod 2^N$ by p-adic logarithm

Published on 28 Mar 2026 - 2:49

score 83 · Answer 6 · 2026-03-28 03:53:37

83

Views

Find gcd($2^{19} + 1$; $2^{86} + 1$)

Published on 28 Mar 2026 - 3:53

score 50 · Answer 7 · 2026-04-09 17:30:06

50

Views

Help in Modular Arithmetic

Published on 09 Apr 2026 - 17:30

score 172 · Answer 8 · 2026-04-11 23:30:40

172

Views

simultaneous linear congruence- Chinese remainder theorem

Published on 11 Apr 2026 - 23:30

score 30 · Answer 9 · 2026-04-11 13:35:54

30

Views

Can a number consisting only of numbers $8$ and $6$ be a square of an integer?

Published on 11 Apr 2026 - 13:35

score 66 · Answer 10 · 2019-10-19 04:34:14

66

Views

Find the remainder when $10^{20^{30}}$ is divided by $23$

Published on 19 Oct 2019 - 4:34

score 68 · Answer 11 · 2026-04-12 00:33:05

68

Views

How to solve a system of $2$ linear equations modulo n for $3$ variable?

Published on 12 Apr 2026 - 0:33

score 1.9k · Answer 12 · 2026-04-11 13:52:45

1.9k

Views

Number of subgroups of $\mathbb Z _m \times \mathbb Z_n$

Published on 11 Apr 2026 - 13:52

score 74 · Answer 13 · 2019-10-19 15:49:04

74

Views

Solving the congruence system and checking the answer

Published on 19 Oct 2019 - 15:49

score 375 · Answer 14 · 2026-03-25 21:22:51

375

Views

Find the smallest prime divisor of $1^{60}+2^{60}+...+33^{60}$

Published on 25 Mar 2026 - 21:22

score 30 · Answer 15 · 2019-10-20 04:04:51

30

Views

Define $f : \mathbb{Z}_p \to \mathbb{Z}_p$ by $f([x])=[ax],a\in\mathbb{Z},p\nmid a$. Prove that $f$ is 1-to-1 & onto

Published on 20 Oct 2019 - 4:04

List Question

Existence of only ONE solution to this modulo

Is it possible to have the gcd of 2 polynomials be the same in all fields?

How did this word problem related to linear congruences get $11x=17(mod24)$

Find $a$ inverse modulo 30, $1\le a \le 30$. For each $a$ you find, find the inverse of each $a$ that have inverse modulo 30

Solve discrete logarithm, $a^x = b \bmod 2^N$ by p-adic logarithm

Find gcd($2^{19} + 1$; $2^{86} + 1$)

Help in Modular Arithmetic

simultaneous linear congruence- Chinese remainder theorem

Can a number consisting only of numbers $8$ and $6$ be a square of an integer?

Find the remainder when $10^{20^{30}}$ is divided by $23$

How to solve a system of $2$ linear equations modulo n for $3$ variable?

Number of subgroups of $\mathbb Z _m \times \mathbb Z_n$

Solving the congruence system and checking the answer

Find the smallest prime divisor of $1^{60}+2^{60}+...+33^{60}$

Define $f : \mathbb{Z}_p \to \mathbb{Z}_p$ by $f([x])=[ax],a\in\mathbb{Z},p\nmid a$. Prove that $f$ is 1-to-1 & onto

Trending Questions

Popular # Hahtags

Popular Questions