List questions from modular-arithmetic

Published on 09 Oct 2014 - 17:57

55

Views

Help me understand the proof of $a \equiv b \mod m \Rightarrow r_m(a)=r_m(b)$

Published on 10 Oct 2014 - 8:43

1.3k

Views

How to select the right modulus to prove that there do not exist integers $a$ and $b$ such that $a^2+b^2=1234567$?

Published on 10 Oct 2014 - 10:13

430

Views

Show that if a positive integer $ n $ is composite then $ R(n) = \frac{10^{n}-1}{9}= 111...11 (n times) $ is composite

Published on 10 Oct 2014 - 14:19

100

Views

Find the remainder of $(p-2)!$ module $p$, where $p$ is a prime $\geq 3$

Published on 26 Mar 2026 - 8:00

72

Views

Find all numbers $x$ satisfying $x^3 \equiv 1 \pmod A$.

Published on 11 Oct 2014 - 5:38

208

Views

Calculate$ (n+m-1)C_n \mod 10^9+7$ efficiently

Published on 11 Oct 2014 - 6:40

114

Views

How do I count all values that satisfy X mod N=1 in the range [A,B]

Published on 25 Mar 2026 - 10:54

106

Views

Can this be solve using modular arithmetic? $k$ is prime $\Rightarrow$ $8k+1$ is prime

Published on 11 Oct 2014 - 16:09

2k

Views

Find the least positive residue of $5^{16} \bmod 17$

Published on 26 Mar 2026 - 8:00

241

Views

Prove that $r(2^{55555})$ divisible by $5^5$

Published on 26 Mar 2026 - 8:04

1k

Views

$a^n = a$ mod ($n$)

Published on 11 Oct 2014 - 23:58

252

Views

Reversed direction modulo operator?

Published on 12 Oct 2014 - 3:23

76

Views

Calculating $3/10$ in $\mathbb{Z}_{13}$

Published on 31 Mar 2026 - 7:48

257

Views

Recurrences with modulo

Published on 04 Apr 2026 - 11:19

List Question

Number of roots of $x^3 \equiv 1 \pmod p$

Help me understand the proof of $a \equiv b \mod m \Rightarrow r_m(a)=r_m(b)$

How to select the right modulus to prove that there do not exist integers $a$ and $b$ such that $a^2+b^2=1234567$?

Show that if a positive integer $ n $ is composite then $ R(n) = \frac{10^{n}-1}{9}= 111...11 (n times) $ is composite

Find the remainder of $(p-2)!$ module $p$, where $p$ is a prime $\geq 3$

Find all numbers $x$ satisfying $x^3 \equiv 1 \pmod A$.

Calculate$ (n+m-1)C_n \mod 10^9+7$ efficiently

How do I count all values that satisfy X mod N=1 in the range [A,B]

Can this be solve using modular arithmetic? $k$ is prime $\Rightarrow$ $8k+1$ is prime

Find the least positive residue of $5^{16} \bmod 17$

Prove that $r(2^{55555})$ divisible by $5^5$

$a^n = a$ mod ($n$)

Reversed direction modulo operator?

Calculating $3/10$ in $\mathbb{Z}_{13}$

Recurrences with modulo

Trending Questions

Popular # Hahtags

Popular Questions