List questions from modular-arithmetic

76

Views

Show that if $m$ in $\mathbb{Z}$ has greatest common divisor $1$ with $21$, then $m^{6}-1$ is divisible by $63$.

Published on 23 Mar 2019 - 12:13

176

Views

Last 3 digits of $3^{3^{3^3}}$

Published on 23 Mar 2019 - 21:34

97

Views

Problem regarding this proof of Chinese Remainder Theorem

Published on 25 Mar 2026 - 17:24

211

Views

Lifting solutions modulo $2^{10}$ to a solution $2^{19}$

Published on 24 Mar 2026 - 23:42

69

Views

Existence of solutions for $pq^m \equiv k\bmod{n}$

Published on 24 Mar 2019 - 14:26

156

Views

Showing the solution of a linear congruence is the smallest positive solution possible

Published on 24 Mar 2019 - 16:55

203

Views

Extended Euclidean Algorithm yielding incorrect modular inverse

Published on 26 Mar 2026 - 6:19

38

Views

On the number of solutions of $pq^m \equiv k\bmod{n}$

Published on 25 Mar 2026 - 6:07

724

Views

Consecutive integers divisible by prime powers

Published on 25 Mar 2019 - 6:07

544

Views

Congruence about Fibonacci numbers

Published on 26 Mar 2026 - 9:49

420

Views

Solving linear equivalence mod $26$

Published on 27 Mar 2019 - 2:09

36

Views

the number of different least positive residues modu $p^2$ of $x^{p-1}$ is $= p+1$?

Published on 27 Mar 2019 - 3:45

53

Views

Last digit of large power involving sequences

Published on 27 Mar 2019 - 9:22

43

Views

Unknown value in the modular numerator

Published on 25 Mar 2026 - 21:44

247

Views

Discrete Log solve using Index-Calculus producing incorrect 'r' value.

Published on 30 Mar 2026 - 4:15

List Question

Show that if $m$ in $\mathbb{Z}$ has greatest common divisor $1$ with $21$, then $m^{6}-1$ is divisible by $63$.

Last 3 digits of $3^{3^{3^3}}$

Problem regarding this proof of Chinese Remainder Theorem

Lifting solutions modulo $2^{10}$ to a solution $2^{19}$

Existence of solutions for $pq^m \equiv k\bmod{n}$

Showing the solution of a linear congruence is the smallest positive solution possible

Extended Euclidean Algorithm yielding incorrect modular inverse

On the number of solutions of $pq^m \equiv k\bmod{n}$

Consecutive integers divisible by prime powers

Congruence about Fibonacci numbers

Solving linear equivalence mod $26$

the number of different least positive residues modu $p^2$ of $x^{p-1}$ is $= p+1$?

Last digit of large power involving sequences

Unknown value in the modular numerator

Discrete Log solve using Index-Calculus producing incorrect 'r' value.

Trending Questions

Popular # Hahtags

Popular Questions