Question

Solving the system $kl=mn \mod 3, kn=-lm \mod 3$

score 46 · Answer 1 · 2018-03-12 20:04:28

46

Views

Solving the system $kl=mn \mod 3, kn=-lm \mod 3$

Published on 12 Mar 2018 - 20:04

score 180 · Answer 2 · 2018-03-13 03:54:20

180

Views

Solve for Square Roots

Published on 13 Mar 2018 - 3:54

score 45 · Answer 3 · 2026-03-22 02:39:13

45

Views

Inverse of modular exponential

Published on 22 Mar 2026 - 2:39

score 18 · Answer 4 · 2026-03-23 11:27:45

18

Views

Mathematically calculate number of modular operations to reach a number

Published on 23 Mar 2026 - 11:27

score 46 · Answer 5 · 2026-03-25 06:19:22

46

Views

How do I generate a public and private key pair with these parameters in ECC?

Published on 25 Mar 2026 - 6:19

score 2k · Answer 6 · 2018-03-13 21:58:20

2k

Views

Solving cubic congruence

Published on 13 Mar 2018 - 21:58

score 1.4k · Answer 7 · 2026-03-25 07:45:09

1.4k

Views

Find the least positive residue of $40^{128} \mod 49$

Published on 25 Mar 2026 - 7:45

score 40 · Answer 8 · 2026-03-25 04:41:04

40

Views

Reference request: "If $a$ and $m$ are coprime then there must exist $k \in \mathbb{N}$ such that $a^k \equiv 1 \pmod m$"

Published on 25 Mar 2026 - 4:41

score 160 · Answer 9 · 2026-03-25 07:42:28

160

Views

Modular inverse of a $2\times2$ matrix with unknown variable

Published on 25 Mar 2026 - 7:42

score 107 · Answer 10 · 2018-03-14 20:53:46

107

Views

Show there is no $n>0$ where $n\in \mathbb{Z}$ such that $n$, $n+10$, $n+20$, $n+30$ are all prime

Published on 14 Mar 2018 - 20:53

score 520 · Answer 11 · 2026-03-20 09:01:06

520

Views

How to show that $x^2 - 37y^2 =2$ does not have integer solutions

Published on 20 Mar 2026 - 9:01

score 501 · Answer 12 · 2018-03-15 01:06:14

501

Views

Show that if $n > 0$ is an integer, then $n^2$ is congruent to only $0,1,2$ or $4$ modulo $7$

Published on 15 Mar 2018 - 1:06

score 159 · Answer 13 · 2018-03-18 18:35:38

159

Views

Application of Fermat's Little Theorem and Lagrange

Published on 18 Mar 2018 - 18:35

score 88 · Answer 14 · 2026-03-22 11:55:47

88

Views

Finding an order-2 permutation that sorts colored balls

Published on 22 Mar 2026 - 11:55

score 189 · Answer 15 · 2026-03-25 07:46:26

189

Views

We have $a^{n-1} \equiv 1\ (mod\ n)$ but $a^{m} \not\equiv 1\ (mod\ n)$ for every divisor $m$ of $n - 1$, other than itself. Prove that $n$ is prime.

Published on 25 Mar 2026 - 7:46

List Question

Solving the system $kl=mn \mod 3, kn=-lm \mod 3$

Solve for Square Roots

Inverse of modular exponential

Mathematically calculate number of modular operations to reach a number

How do I generate a public and private key pair with these parameters in ECC?

Solving cubic congruence

Find the least positive residue of $40^{128} \mod 49$

Reference request: "If $a$ and $m$ are coprime then there must exist $k \in \mathbb{N}$ such that $a^k \equiv 1 \pmod m$"

Modular inverse of a $2\times2$ matrix with unknown variable

Show there is no $n>0$ where $n\in \mathbb{Z}$ such that $n$, $n+10$, $n+20$, $n+30$ are all prime

How to show that $x^2 - 37y^2 =2$ does not have integer solutions

Show that if $n > 0$ is an integer, then $n^2$ is congruent to only $0,1,2$ or $4$ modulo $7$

Application of Fermat's Little Theorem and Lagrange

Finding an order-2 permutation that sorts colored balls

We have $a^{n-1} \equiv 1\ (mod\ n)$ but $a^{m} \not\equiv 1\ (mod\ n)$ for every divisor $m$ of $n - 1$, other than itself. Prove that $n$ is prime.

Trending Questions

Popular # Hahtags

Popular Questions