Question

Permutations to un-shuffle indistinguishable cards from multiple decks?

score 35 · Answer 1 · 2019-06-27 21:57:56

35

Views

Permutations to un-shuffle indistinguishable cards from multiple decks?

Published on 27 Jun 2019 - 21:57

score 54 · Answer 2 · 2019-06-28 06:01:13

54

Views

$(3^n -1)/2 \% c$ where $c$ is a multiple of $2$

Published on 28 Jun 2019 - 6:01

score 46 · Answer 3 · 2019-06-28 17:18:41

46

Views

Is $Z_n^$ (multiplicative group mod $n$) mod a divisor $m$ ($m|n$) equal to $Z_m^$?

Published on 28 Jun 2019 - 17:18

score 82 · Answer 4 · 2019-06-29 15:57:40

82

Views

Proof that $3^n$ is never congruent to $7 \bmod 1000$

Published on 29 Jun 2019 - 15:57

score 93 · Answer 5 · 2026-03-27 05:34:48

93

Views

Does this specific property exist for Modular Exponentiation?

Published on 27 Mar 2026 - 5:34

score 54 · Answer 6 · 2019-06-30 06:56:36

54

Views

$\lfloor{\frac{a}{b}}\rfloor\bmod c$

Published on 30 Jun 2019 - 6:56

score 380 · Answer 7 · 2026-03-28 12:02:44

380

Views

Defining the Equivalence of Categories

Published on 28 Mar 2026 - 12:02

score 658 · Answer 8 · 2026-03-26 09:40:19

658

Views

Group $U(n)$ closed under modular multiplication with every element is its own inverse

Published on 26 Mar 2026 - 9:40

score 90 · Answer 9 · 2026-03-29 14:08:12

90

Views

Compute $\sqrt{x} \pmod p$ working on finite fields.

Published on 29 Mar 2026 - 14:08

score 180 · Answer 10 · 2019-07-02 01:39:20

180

Views

$(2x + 1)(3x + 1) \equiv 0\pmod{\!n}$ has a root for all $n ≥ 2$

Published on 02 Jul 2019 - 1:39

score 331 · Answer 11 · 2026-03-27 22:53:07

331

Views

Show that $3^{7^n}+5^{7^n}\equiv 1 \pmod{7^{n+1}}$

Published on 27 Mar 2026 - 22:53

score 64 · Answer 12 · 2019-07-02 18:14:18

64

Views

How to prove this using Fermat's Little Theorem?

Published on 02 Jul 2019 - 18:14

score 64 · Answer 13 · 2019-07-02 21:49:58

64

Views

Remainder is less than divisor

Published on 02 Jul 2019 - 21:49

score 86 · Answer 14 · 2019-07-03 06:53:21

86

Views

Reducing the mod value itself (modular calculus)

Published on 03 Jul 2019 - 6:53

score 400 · Answer 15 · 2019-07-03 19:33:13

400

Views

If $\gcd(a,N)=1$, why is it that the base $a$ will produce at least one instance of a power equal to $1\pmod N$?

Published on 03 Jul 2019 - 19:33

List Question

Permutations to un-shuffle indistinguishable cards from multiple decks?

$(3^n -1)/2 \% c$ where $c$ is a multiple of $2$

Is $Z_n^$ (multiplicative group mod $n$) mod a divisor $m$ ($m|n$) equal to $Z_m^$?

Proof that $3^n$ is never congruent to $7 \bmod 1000$

Does this specific property exist for Modular Exponentiation?

$\lfloor{\frac{a}{b}}\rfloor\bmod c$

Defining the Equivalence of Categories

Group $U(n)$ closed under modular multiplication with every element is its own inverse

Compute $\sqrt{x} \pmod p$ working on finite fields.

$(2x + 1)(3x + 1) \equiv 0\pmod{\!n}$ has a root for all $n ≥ 2$

Show that $3^{7^n}+5^{7^n}\equiv 1 \pmod{7^{n+1}}$

How to prove this using Fermat's Little Theorem?

Remainder is less than divisor

Reducing the mod value itself (modular calculus)

If $\gcd(a,N)=1$, why is it that the base $a$ will produce at least one instance of a power equal to $1\pmod N$?

Trending Questions

Popular # Hahtags

Popular Questions