List questions from modular-arithmetic

Published on 16 Apr 2014 - 15:00

3.1k

Views

Prove that every prime larger than $3$ gives a remainder of $1$ or $5$ if divided by $6$

Published on 16 Apr 2014 - 16:18

67

Views

Is $(-1)^{1/8} + (-1)^{7/8}$ ever a value whose real component is $0$?

Published on 25 Mar 2026 - 20:35

783

Views

Calculate the last digit of $3^{347}$

Published on 25 Mar 2026 - 19:05

101

Views

Question regarding solving a modulo equality

Published on 18 Apr 2014 - 20:36

946

Views

Last Two Digits Problem

Published on 18 Apr 2014 - 22:43

60

Views

Modular Arithmetic

Published on 19 Apr 2014 - 12:28

61

Views

Modular Arithmetic

Published on 19 Apr 2014 - 13:17

948

Views

Does Fermat's Little Theorem apply to matrices?

Published on 27 Mar 2026 - 21:54

285

Views

Why can't we have an $y$ such that $xy\equiv 1\; (mod\; n)$ when $n$ is not prime?

Published on 19 Apr 2014 - 23:41

62

Views

If $k\le n$ and $k$ is relatively prime to $n$, there exists a prime $p$ such that $p \equiv k \mod n$.

Published on 20 Apr 2014 - 4:19

254

Views

Modular arithemtic and CRT

Published on 20 Apr 2014 - 12:38

222

Views

Congruences and prime powers

Published on 20 Apr 2014 - 16:02

3.7k

Views

Proving $\, a\equiv \bar a\Rightarrow a^b\equiv \bar a^b\, \pmod{\!n},\, $ e.g. $\,\bar a = a\bmod n$ [Congruence Power Rule]

Published on 20 Apr 2014 - 18:17

1.4k

Views

Euclidean Algorithm for Modular Inverse, with negative numbers

Published on 25 Mar 2026 - 23:09

List Question

Solving a system of modular equatios

Prove that every prime larger than $3$ gives a remainder of $1$ or $5$ if divided by $6$

Is $(-1)^{1/8} + (-1)^{7/8}$ ever a value whose real component is $0$?

Calculate the last digit of $3^{347}$

Question regarding solving a modulo equality

Last Two Digits Problem

Modular Arithmetic

Modular Arithmetic

Does Fermat's Little Theorem apply to matrices?

Why can't we have an $y$ such that $xy\equiv 1\; (mod\; n)$ when $n$ is not prime?

If $k\le n$ and $k$ is relatively prime to $n$, there exists a prime $p$ such that $p \equiv k \mod n$.

Modular arithemtic and CRT

Congruences and prime powers

Proving $\, a\equiv \bar a\Rightarrow a^b\equiv \bar a^b\, \pmod{\!n},\, $ e.g. $\,\bar a = a\bmod n$ [Congruence Power Rule]

Euclidean Algorithm for Modular Inverse, with negative numbers

Trending Questions

Popular # Hahtags

Popular Questions