Question

a divide b mod m when mod inverse doesn't exist

score 249 · Answer 1 · 2026-04-16 04:21:58

249

Views

a divide b mod m when mod inverse doesn't exist

Published on 16 Apr 2026 - 4:21

score 200 · Answer 2 · 2026-04-17 07:29:01

200

Views

Let $p$ be a prime. Prove that $x^2\equiv 1\mbox{ mod }p$ if and only if $x\equiv 1\mbox{ mod }p$ or $x\equiv p-1\mbox{ mod }p$.

Published on 17 Apr 2026 - 7:29

score 155 · Answer 3 · 2026-03-25 09:17:09

155

Views

How To Solve The Congruence $n\equiv1\pmod{\tau(n)}$

Published on 25 Mar 2026 - 9:17

score 46 · Answer 4 · 2026-03-26 02:54:04

46

Views

The longest cycle and relation between the generating elements of a Cayley graph

Published on 26 Mar 2026 - 2:54

score 44 · Answer 5 · 2026-04-14 04:55:06

44

Views

Computing the remainder of two numbers in CRT form

Published on 14 Apr 2026 - 4:55

score 430 · Answer 6 · 2026-04-09 13:44:38

430

Views

Prove that the number $ \underbrace{11 \ldots 1}_{(p-1) \mathrm{l}^{\prime} \mathrm{s}} $ is divisible by $p$

Published on 09 Apr 2026 - 13:44

score 445 · Answer 7 · 2026-04-15 22:34:44

445

Views

Prove that for any even positive integer $n, n^{2}-1$ divides $2^{n !}-1$

Published on 15 Apr 2026 - 22:34

score 50 · Answer 8 · 2026-04-15 16:33:11

50

Views

Find the value of x such that $x \equiv -6 \pmod 5$

Published on 15 Apr 2026 - 16:33

score 368 · Answer 9 · 2026-04-17 00:49:35

368

Views

Suppose that $x \equiv 1 \pmod n$ and $x \equiv 1\pmod m$. Prove that $x \equiv 1 \pmod{ mn}$.

Published on 17 Apr 2026 - 0:49

score 85 · Answer 10 · 2026-04-16 17:07:26

85

Views

Computing $75^{75^{75}}$ modulo $32$

Published on 16 Apr 2026 - 17:07

score 284 · Answer 11 · 2026-04-16 07:35:21

Prove that for every number in ${1, 2, ..., p-1}$ there exists another within the same set such that their product is congruent to $1$ $mod$ $p$.

score 102 · Answer 12 · 2026-04-15 22:39:48

102

Views

Finding a solution $x \in \mathbb{N}$ of $x^{125} \equiv 7 \ (\mathrm{mod} \ 39)$

Published on 15 Apr 2026 - 22:39

score 215 · Answer 13 · 2026-04-13 20:24:18

215

Views

Let n be an odd positive number. Prove that n | $(2^{n!}-1)$.

Published on 13 Apr 2026 - 20:24

score 63 · Answer 14 · 2026-04-15 18:59:41

63

Views

Find the $n$th number that is not a multiple of $3,5$ or $15$

Published on 15 Apr 2026 - 18:59

score 1.5k · Answer 15 · 2026-04-15 10:45:13

1.5k

Views

What is the remainder when ${13}^7$ is divided by 9

Published on 15 Apr 2026 - 10:45

List Question

a divide b mod m when mod inverse doesn't exist

Let $p$ be a prime. Prove that $x^2\equiv 1\mbox{ mod }p$ if and only if $x\equiv 1\mbox{ mod }p$ or $x\equiv p-1\mbox{ mod }p$.

How To Solve The Congruence $n\equiv1\pmod{\tau(n)}$

The longest cycle and relation between the generating elements of a Cayley graph

Computing the remainder of two numbers in CRT form

Prove that the number $ \underbrace{11 \ldots 1}_{(p-1) \mathrm{l}^{\prime} \mathrm{s}} $ is divisible by $p$

Prove that for any even positive integer $n, n^{2}-1$ divides $2^{n !}-1$

Find the value of x such that $x \equiv -6 \pmod 5$

Suppose that $x \equiv 1 \pmod n$ and $x \equiv 1\pmod m$. Prove that $x \equiv 1 \pmod{ mn}$.

Computing $75^{75^{75}}$ modulo $32$

Prove that for every number in ${1, 2, ..., p-1}$ there exists another within the same set such that their product is congruent to $1$ $mod$ $p$.

Finding a solution $x \in \mathbb{N}$ of $x^{125} \equiv 7 \ (\mathrm{mod} \ 39)$

Let n be an odd positive number. Prove that n | $(2^{n!}-1)$.

Find the $n$th number that is not a multiple of $3,5$ or $15$

What is the remainder when ${13}^7$ is divided by 9

Trending Questions

Popular # Hahtags

Popular Questions