Question

Suppose that a, m, and n are positive integers and that m is a factor of n. Explain why a % m = (a % n) % m.

score 848 · Answer 1 · 2019-03-10 01:45:48

848

Views

Suppose that a, m, and n are positive integers and that m is a factor of n. Explain why a % m = (a % n) % m.

Published on 10 Mar 2019 - 1:45

score 327 · Answer 2 · 2019-03-10 15:53:04

327

Views

Modular arithmetic: Solving equation modulo prime number

Published on 10 Mar 2019 - 15:53

score 126 · Answer 3 · 2019-03-10 23:21:11

126

Views

Least positive integer $\equiv 3^{18} \pmod{37}?$

Published on 10 Mar 2019 - 23:21

score 214 · Answer 4 · 2019-03-10 23:22:32

214

Views

Multiple Exponentiation in Modular Arithmetic

Published on 10 Mar 2019 - 23:22

score 432 · Answer 5 · 2026-03-25 22:10:36

432

Views

Modular arithmetic rules, of iteration of a polynomial function are?

Published on 25 Mar 2026 - 22:10

score 65 · Answer 6 · 2026-03-27 13:19:51

65

Views

Question about primes in $\mathbb{Z}_{n} $

Published on 27 Mar 2026 - 13:19

score 338 · Answer 7 · 2026-03-27 21:23:36

338

Views

Modular Arithmetic with Negative Exponents

Published on 27 Mar 2026 - 21:23

score 76 · Answer 8 · 2019-03-12 19:08:35

76

Views

Possible n-uplets that are the difference term by term of two permutations

Published on 12 Mar 2019 - 19:08

score 54 · Answer 9 · 2026-03-25 17:20:49

54

Views

Find all solutions, if any, to the equation $[28][x]-[22] = [33]$ in $\mathbb{Z}_{51}$.

Published on 25 Mar 2026 - 17:20

score 125 · Answer 10 · 2019-03-13 02:56:19

125

Views

What is the largest three-digit integer that when cubed, the result ends in itself

Published on 13 Mar 2019 - 2:56

score 39 · Answer 11 · 2019-03-13 03:35:19

For all $[a]$,$[b]\in{\mathbb{Z}m}$, if $[a][b]=[0]$, then $[a]=[0]$ or $[b]=[0]$. Prove that if $S$ is true, then $m$ is prime.

score 168 · Answer 12 · 2026-03-31 10:02:33

168

Views

Find the remainder when $(34! + {75}^{37})^{39}$ is divided by $37$

Published on 31 Mar 2026 - 10:02

score 49 · Answer 13 · 2026-03-25 09:26:13

49

Views

When $p<q$ there is a solution to $qx+py = c$, but not when $p>q$. Why?

Published on 25 Mar 2026 - 9:26

score 472 · Answer 14 · 2026-03-25 17:26:30

472

Views

Using Chinese Remainder Theorem for large modulo

Published on 25 Mar 2026 - 17:26

score 137 · Answer 15 · 2026-03-27 21:19:26

137

Views

How to elegantly find the remainder of $en$ divided by $n+1+\frac{n-1}{d}$

Published on 27 Mar 2026 - 21:19

List Question

Suppose that a, m, and n are positive integers and that m is a factor of n. Explain why a % m = (a % n) % m.

Modular arithmetic: Solving equation modulo prime number

Least positive integer $\equiv 3^{18} \pmod{37}?$

Multiple Exponentiation in Modular Arithmetic

Modular arithmetic rules, of iteration of a polynomial function are?

Question about primes in $\mathbb{Z}_{n} $

Modular Arithmetic with Negative Exponents

Possible n-uplets that are the difference term by term of two permutations

Find all solutions, if any, to the equation $[28][x]-[22] = [33]$ in $\mathbb{Z}_{51}$.

What is the largest three-digit integer that when cubed, the result ends in itself

For all $[a]$,$[b]\in{\mathbb{Z}m}$, if $[a][b]=[0]$, then $[a]=[0]$ or $[b]=[0]$. Prove that if $S$ is true, then $m$ is prime.

Find the remainder when $(34! + {75}^{37})^{39}$ is divided by $37$

When $p<q$ there is a solution to $qx+py = c$, but not when $p>q$. Why?

Using Chinese Remainder Theorem for large modulo

How to elegantly find the remainder of $en$ divided by $n+1+\frac{n-1}{d}$

Trending Questions

Popular # Hahtags

Popular Questions