List questions from modular-arithmetic

Published on 12 Apr 2026 - 3:07

143

Views

Chinese Remainder Theorem and the RSA Cryptosystem

Published on 12 Apr 2026 - 16:05

23

Views

Is there a rule for converting a modulus in the form 2^n + 2^m to bit-wise &, and addition?

Published on 12 Apr 2026 - 7:04

69

Views

Perfect Grasshopper Tour

Published on 12 Apr 2026 - 6:34

25

Views

Inferring $a$ in $\phi \equiv ax \;(\mathrm{mod}\,2\pi)$

Published on 12 Apr 2026 - 3:14

51

Views

How do I divide a congruence equation?

Published on 09 Apr 2026 - 14:43

723

Views

Solving a system of modular equations

Published on 09 Apr 2026 - 17:48

30

Views

on the diophantine equations modulo a prime number

Published on 09 Nov 2019 - 17:13

212

Views

Find the units digit of $572^{42}$

Published on 09 Nov 2019 - 18:11

83

Views

Is it a theorem that $\ n^{(n-1)^p} \equiv 1\pmod {n-1} $

Published on 09 Nov 2019 - 23:18

58

Views

How to approach this? If $2m^3 - 8m^2 + 8n^3 - 12n^2 -10 \equiv 0 \mod 10$, then $8m^3 - 12m^2 + 2n^3 - 8n^2 - 10 \equiv 0 \mod 10$

Published on 10 Nov 2019 - 5:11

56

Views

Show that 9453(6824)$\equiv$6782(5675341)$\equiv$2 (mod 5)

Published on 10 Nov 2019 - 8:59

525

Views

Suppose a = positive integer and gcd(a, 10) = 1. Prove that a divides infinitely many repunits.

Published on 09 Apr 2026 - 13:43

63

Views

How to solve modulo equation?

Published on 08 Apr 2026 - 16:56

129

Views

Solving for Congruence Class

Published on 10 Nov 2019 - 15:06

List Question

Proof by counter example: does it work?

Chinese Remainder Theorem and the RSA Cryptosystem

Is there a rule for converting a modulus in the form 2^n + 2^m to bit-wise &, and addition?

Perfect Grasshopper Tour

Inferring $a$ in $\phi \equiv ax \;(\mathrm{mod}\,2\pi)$

How do I divide a congruence equation?

Solving a system of modular equations

on the diophantine equations modulo a prime number

Find the units digit of $572^{42}$

Is it a theorem that $\ n^{(n-1)^p} \equiv 1\pmod {n-1} $

How to approach this? If $2m^3 - 8m^2 + 8n^3 - 12n^2 -10 \equiv 0 \mod 10$, then $8m^3 - 12m^2 + 2n^3 - 8n^2 - 10 \equiv 0 \mod 10$

Show that 9453(6824)$\equiv$6782(5675341)$\equiv$2 (mod 5)

Suppose a = positive integer and gcd(a, 10) = 1. Prove that a divides infinitely many repunits.

How to solve modulo equation?

Solving for Congruence Class

Trending Questions

Popular # Hahtags

Popular Questions