Question

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

score 120 · Answer 1 · 2018-02-24 20:55:46

120

Views

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

Published on 24 Feb 2018 - 20:55

score 65 · Answer 2 · 2018-02-26 17:25:52

65

Views

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

Published on 26 Feb 2018 - 17:25

score 2.1k · Answer 3 · 2026-03-22 04:46:15

2.1k

Views

Unable to use Chinese Remainder Theorem on a question.

Published on 22 Mar 2026 - 4:46

score 50 · Answer 4 · 2018-03-02 17:28:54

50

Views

Number Theory system of congruences

Published on 02 Mar 2018 - 17:28

score 151 · Answer 5 · 2018-03-05 15:06:00

151

Views

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

Published on 05 Mar 2018 - 15:06

score 63 · Answer 6 · 2018-03-06 14:01:12

63

Views

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

Published on 06 Mar 2018 - 14:01

score 1.7k · Answer 7 · 2018-03-06 15:48:49

1.7k

Views

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

Published on 06 Mar 2018 - 15:48

score 259 · Answer 8 · 2026-03-22 21:17:35

259

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 22 Mar 2026 - 21:17

score 59 · Answer 9 · 2018-03-07 08:51:08

59

Views

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

Published on 07 Mar 2018 - 8:51

score 92 · Answer 10 · 2018-03-07 19:25:53

92

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 07 Mar 2018 - 19:25

score 1k · Answer 11 · 2026-03-17 08:31:44

1k

Views

To find a remainder, when divided by $101$

Published on 17 Mar 2026 - 8:31

score 50 · Answer 12 · 2026-03-23 04:55:16

50

Views

Why do these 2 congruences imply the following?

Published on 23 Mar 2026 - 4:55

score 105 · Answer 13 · 2026-03-22 13:20:39

105

Views

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

Published on 22 Mar 2026 - 13:20

score 72 · Answer 14 · 2026-03-23 01:06:45

72

Views

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

Published on 23 Mar 2026 - 1:06

score 113 · Answer 15 · 2018-03-10 18:29:40

113

Views

Elementary Number Theory: Solving Quadratic Conguences

Published on 10 Mar 2018 - 18:29

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