Question

This formula gives $8^{-1}$ (mod $n$). Is there a deeper pattern lurking here?

score 123 · Answer 1 · 2026-04-15 17:09:12

123

Views

This formula gives $8^{-1}$ (mod $n$). Is there a deeper pattern lurking here?

Published on 15 Apr 2026 - 17:09

score 68 · Answer 2 · 2026-04-17 09:58:27

68

Views

Find one prime $p = kn + r$ where $\gcd(r, n) = 1$

Published on 17 Apr 2026 - 9:58

score 2.1k · Answer 3 · 2026-05-10 11:20:39

2.1k

Views

Unable to use Chinese Remainder Theorem on a question.

Published on 10 May 2026 - 11:20

score 55 · Answer 4 · 2026-04-13 00:07:46

55

Views

Number Theory system of congruences

Published on 13 Apr 2026 - 0:07

score 153 · Answer 5 · 2026-04-16 17:13:14

153

Views

Prove that $1+20+20^2+20^3+....+20^{21} \equiv 0\bmod 23$

Published on 16 Apr 2026 - 17:13

score 66 · Answer 6 · 2026-04-15 22:52:06

66

Views

Given integers, $s= 2a+3b, t=9a+5b$, if $17\mid s$, prove $17 \mid t$.

Published on 15 Apr 2026 - 22:52

score 1.7k · Answer 7 · 2026-04-12 21:24:48

1.7k

Views

find the last digit - should i use $\mod 10$ to show this?

Published on 12 Apr 2026 - 21:24

score 260 · Answer 8 · 2026-03-25 04:43:34

260

Views

Assume $m$ divides $n$. Show for any integer $a$, $[a]_m$ is the union of $[a]_n, [a+m]_n, [a+2m]_n,..., [a+(n-m)]_n$

Published on 25 Mar 2026 - 4:43

score 62 · Answer 9 · 2026-04-12 12:42:25

62

Views

which way should i follow to solve the problem regearding Fermat's little theorem?

Published on 12 Apr 2026 - 12:42

score 99 · Answer 10 · 2026-05-10 13:51:07

99

Views

If both sides of $2^{31}\equiv (-1)^{31}\equiv 2\mod 3$ is multiplied by $2$ then will it be $2^{32}\equiv4\mod 3$ or $2^{32}\equiv4\mod 6$?

Published on 10 May 2026 - 13:51

score 1k · Answer 11 · 2026-05-10 13:48:35

1k

Views

To find a remainder, when divided by $101$

Published on 10 May 2026 - 13:48

score 60 · Answer 12 · 2026-04-29 12:26:32

60

Views

Why do these 2 congruences imply the following?

Published on 29 Apr 2026 - 12:26

score 114 · Answer 13 · 2026-05-10 11:24:24

114

Views

The most efficient way to solve $2^{2017} \mod 9$

Published on 10 May 2026 - 11:24

score 84 · Answer 14 · 2026-05-10 10:52:50

84

Views

Is there any way to prove that if $4y=4x+13k$ then $y=x+13l$?

Published on 10 May 2026 - 10:52

score 116 · Answer 15 · 2026-04-13 21:15:08

116

Views

Elementary Number Theory: Solving Quadratic Conguences

Published on 13 Apr 2026 - 21:15

List Question

This formula gives $8^{-1}$ (mod $n$). Is there a deeper pattern lurking here?

Find one prime $p = kn + r$ where $\gcd(r, n) = 1$

Unable to use Chinese Remainder Theorem on a question.

Number Theory system of congruences

Prove that $1+20+20^2+20^3+....+20^{21} \equiv 0\bmod 23$

Given integers, $s= 2a+3b, t=9a+5b$, if $17\mid s$, prove $17 \mid t$.

find the last digit - should i use $\mod 10$ to show this?

Assume $m$ divides $n$. Show for any integer $a$, $[a]_m$ is the union of $[a]_n, [a+m]_n, [a+2m]_n,..., [a+(n-m)]_n$

which way should i follow to solve the problem regearding Fermat's little theorem?

If both sides of $2^{31}\equiv (-1)^{31}\equiv 2\mod 3$ is multiplied by $2$ then will it be $2^{32}\equiv4\mod 3$ or $2^{32}\equiv4\mod 6$?

To find a remainder, when divided by $101$

Why do these 2 congruences imply the following?

The most efficient way to solve $2^{2017} \mod 9$

Is there any way to prove that if $4y=4x+13k$ then $y=x+13l$?

Elementary Number Theory: Solving Quadratic Conguences

Trending Questions

Popular # Hahtags

Popular Questions