Question

Show that if $n$ and $k$ are positive integers, then $\lceil \frac{n}{k} \rceil = \lfloor \frac{n-1}{k} \rfloor + 1$

score 271 · Answer 1 · 2026-03-27 19:33:37

271

Views

Show that if $n$ and $k$ are positive integers, then $\lceil \frac{n}{k} \rceil = \lfloor \frac{n-1}{k} \rfloor + 1$

Published on 27 Mar 2026 - 19:33

score 86 · Answer 2 · 2019-03-04 08:21:56

86

Views

Why does $n \equiv n^{21}\bmod 33$?

Published on 04 Mar 2019 - 8:21

score 90 · Answer 3 · 2019-03-04 15:40:53

90

Views

Find integers a and b congruent to mod

Published on 04 Mar 2019 - 15:40

score 169 · Answer 4 · 2019-03-04 18:18:18

169

Views

What are the last two digits of $3^{100}11^{50}+7^{518}$?

Published on 04 Mar 2019 - 18:18

score 35 · Answer 5 · 2019-03-04 18:45:02

35

Views

Simple modular arithmetic expression proof

Published on 04 Mar 2019 - 18:45

score 51 · Answer 6 · 2019-03-07 08:54:33

51

Views

Related to Fermat's Little Theorem

Published on 07 Mar 2019 - 8:54

score 711 · Answer 7 · 2019-03-07 09:06:33

711

Views

Understanding fractions in modular arithmetic

Published on 07 Mar 2019 - 9:06

score 531 · Answer 8 · 2026-03-26 19:35:38

531

Views

$\gcd \cdot \mathrm{lcm}$ for cyclic rings

Published on 26 Mar 2026 - 19:35

score 75 · Answer 9 · 2026-03-26 09:51:26

75

Views

Let $P=\{1,2,\cdots,p-1\}$, $P=S\cup T$, prove that $S$ is quadratic residues and $T$ is quadratic nonresidues.

Published on 26 Mar 2026 - 9:51

score 128 · Answer 10 · 2019-03-07 23:37:02

128

Views

Proving an element is a unit when the function is surjective and injective

Published on 07 Mar 2019 - 23:37

score 224 · Answer 11 · 2026-03-25 04:43:02

224

Views

. Suppose gcd(a, m) = d and that m > 1. Consider the congruence ax ≡ b (mod m). Should there be a solution for every choice of b?

Published on 25 Mar 2026 - 4:43

score 88 · Answer 12 · 2019-03-08 10:26:33

88

Views

How to prove that $p! \ \ (mod \ p^2) \ = p(p-1) $

Published on 08 Mar 2019 - 10:26

score 303 · Answer 13 · 2026-03-23 14:17:49

303

Views

Use Fermat’s Theorem to prove Euler’s Theorem in the case m = pq. with p and q being two distinct prime numbers

Published on 23 Mar 2026 - 14:17

score 33 · Answer 14 · 2019-03-09 07:43:40

33

Views

Quadratic congruence with odd prime modulus

Published on 09 Mar 2019 - 7:43

score 485 · Answer 15 · 2026-03-31 02:03:25

485

Views

Use Euler's Theorem to reduce the power factor $P$ to a value $R$ less than $\phi(m).$

Published on 31 Mar 2026 - 2:03

List Question

Show that if $n$ and $k$ are positive integers, then $\lceil \frac{n}{k} \rceil = \lfloor \frac{n-1}{k} \rfloor + 1$

Why does $n \equiv n^{21}\bmod 33$?

Find integers a and b congruent to mod

What are the last two digits of $3^{100}11^{50}+7^{518}$?

Simple modular arithmetic expression proof

Related to Fermat's Little Theorem

Understanding fractions in modular arithmetic

$\gcd \cdot \mathrm{lcm}$ for cyclic rings

Let $P=\{1,2,\cdots,p-1\}$, $P=S\cup T$, prove that $S$ is quadratic residues and $T$ is quadratic nonresidues.

Proving an element is a unit when the function is surjective and injective

. Suppose gcd(a, m) = d and that m > 1. Consider the congruence ax ≡ b (mod m). Should there be a solution for every choice of b?

How to prove that $p! \ \ (mod \ p^2) \ = p(p-1) $

Use Fermat’s Theorem to prove Euler’s Theorem in the case m = pq. with p and q being two distinct prime numbers

Quadratic congruence with odd prime modulus

Use Euler's Theorem to reduce the power factor $P$ to a value $R$ less than $\phi(m).$

Trending Questions

Popular # Hahtags

Popular Questions