Question

Elliptic curve in finite field, which solution to choose?

score 64 · Answer 1 · 2026-03-26 04:32:16

64

Views

Elliptic curve in finite field, which solution to choose?

Published on 26 Mar 2026 - 4:32

score 116 · Answer 2 · 2026-04-15 08:57:00

116

Views

How many non-negative integer solutions are there for $a+b+c+d=25$ if $a\geq 1, b\geq 2,c\leq 6,d\leq 14$

Published on 15 Apr 2026 - 8:57

score 1.8k · Answer 3 · 2026-04-16 22:26:49

1.8k

Views

a mod b, when b is greater than a

Published on 16 Apr 2026 - 22:26

score 45 · Answer 4 · 2026-04-15 08:59:47

45

Views

What does this notation mean? $\mathbb{Z}_{2}^{3}$

Published on 15 Apr 2026 - 8:59

score 50 · Answer 5 · 2026-04-14 23:42:07

50

Views

Proving $r^t \not\equiv 1\pmod p$

Published on 14 Apr 2026 - 23:42

score 153 · Answer 6 · 2026-03-25 09:16:59

153

Views

Why Are Congruence Relations Written as $”a\equiv b \pmod m”$

Published on 25 Mar 2026 - 9:16

score 70 · Answer 7 · 2026-04-16 07:09:29

70

Views

How I can prove that the last digit of $1+6^n+2\times 3^n+7^n+4^n+3\times9^{n}+4\times8^n$ is $3$ or $9$?

Published on 16 Apr 2026 - 7:09

score 50 · Answer 8 · 2026-04-17 15:29:03

50

Views

When is $ 2^n-1=0\bmod (n^2-1) $?

Published on 17 Apr 2026 - 15:29

score 58 · Answer 9 · 2026-03-25 09:14:17

58

Views

Why does this equality hold when solving linear congruence?

Published on 25 Mar 2026 - 9:14

score 118 · Answer 10 · 2026-04-15 13:00:33

118

Views

Non-solution to the congruence $ax\equiv 1(mod\ p^k)$

Published on 15 Apr 2026 - 13:00

score 276 · Answer 11 · 2026-04-11 00:07:19

276

Views

How to solve the following system using Chinese Remainder Theorem?

Published on 11 Apr 2026 - 0:07

score 66 · Answer 12 · 2026-04-16 08:31:21

66

Views

If $(x_n)_{n\in\mathbb N}$ is subadditive, show that $x_n\le\left\lfloor\frac nk\right\rfloor x_k+x_{n-k\left\lfloor\frac nk\right\rfloor}$

Published on 16 Apr 2026 - 8:31

score 110 · Answer 13 · 2026-04-10 11:04:06

110

Views

How do I solve this system of modular equations?

Published on 10 Apr 2026 - 11:04

score 169 · Answer 14 · 2026-04-15 18:17:39

169

Views

Counting in 2's, 3's, 4's, ... 9's - is there a general rule how to produce (repeating) sequence of last digits?

Published on 15 Apr 2026 - 18:17

score 501 · Answer 15 · 2026-04-15 13:35:44

501

Views

Proof check for $a \equiv b $(mod $n$) if and only if $ma \equiv mb$(mod $mn$).

Published on 15 Apr 2026 - 13:35

List Question

Elliptic curve in finite field, which solution to choose?

How many non-negative integer solutions are there for $a+b+c+d=25$ if $a\geq 1, b\geq 2,c\leq 6,d\leq 14$

a mod b, when b is greater than a

What does this notation mean? $\mathbb{Z}_{2}^{3}$

Proving $r^t \not\equiv 1\pmod p$

Why Are Congruence Relations Written as $”a\equiv b \pmod m”$

How I can prove that the last digit of $1+6^n+2\times 3^n+7^n+4^n+3\times9^{n}+4\times8^n$ is $3$ or $9$?

When is $ 2^n-1=0\bmod (n^2-1) $?

Why does this equality hold when solving linear congruence?

Non-solution to the congruence $ax\equiv 1(mod\ p^k)$

How to solve the following system using Chinese Remainder Theorem?

If $(x_n)_{n\in\mathbb N}$ is subadditive, show that $x_n\le\left\lfloor\frac nk\right\rfloor x_k+x_{n-k\left\lfloor\frac nk\right\rfloor}$

How do I solve this system of modular equations?

Counting in 2's, 3's, 4's, ... 9's - is there a general rule how to produce (repeating) sequence of last digits?

Proof check for $a \equiv b $(mod $n$) if and only if $ma \equiv mb$(mod $mn$).

Trending Questions

Popular # Hahtags

Popular Questions