Question

Polig-helman algorithm - if $g$ is a prim root mod $p$ does this mean that in the subproblems that all $A_i$ are prim roots mod $p$?

score 116 · Answer 1 · 2026-02-23 13:44:34

116

Views

Polig-helman algorithm - if $g$ is a prim root mod $p$ does this mean that in the subproblems that all $A_i$ are prim roots mod $p$?

Published on 23 Feb 2026 - 13:44

score 329 · Answer 2 · 2017-12-03 14:17:29

329

Views

Divisibility rule for 43

Published on 03 Dec 2017 - 14:17

score 66 · Answer 3 · 2017-12-03 15:54:19

66

Views

Solving linear congruent system

Published on 03 Dec 2017 - 15:54

score 4k · Answer 4 · 2017-12-03 18:11:29

4k

Views

Number of solutions to $x^n \equiv 1 \mod p$

Published on 03 Dec 2017 - 18:11

score 74 · Answer 5 · 2017-12-04 16:52:54

74

Views

Prove $F_n=2^{2^{k}}+1, F_n=5\mod{12}$for all $n\in\Bbb{N}$

Published on 04 Dec 2017 - 16:52

score 1.9k · Answer 6 · 2026-03-26 07:34:49

1.9k

Views

Smallest positive integer a such that $5n^{13}+13n^5+a(9n)\equiv 0\pmod{65}$

Published on 26 Mar 2026 - 7:34

score 57 · Answer 7 · 2017-12-04 19:24:06

57

Views

Is there a fixed positive integer $ a$ for which $ a(b+c) | a^b+a^c$ with $b, c$ are positive integers?

Published on 04 Dec 2017 - 19:24

score 446 · Answer 8 · 2017-12-05 14:52:44

446

Views

Simple question about linear congruence with Fermat's little theorem $4x≡11\bmod19$

Published on 05 Dec 2017 - 14:52

score 31 · Answer 9 · 2017-12-07 01:20:46

31

Views

Proving that a polynomial over $K[t]$ is congruent modulo $m$ to a unique polynomial in $K[t]$

Published on 07 Dec 2017 - 1:20

score 1.2k · Answer 10 · 2017-12-09 12:50:04

1.2k

Views

Why is congruence sign $A\equiv B\pmod{C}$?

Published on 09 Dec 2017 - 12:50

score 54 · Answer 11 · 2017-12-09 22:14:23

54

Views

Find the number of solutions to $x^2 ≡ 1\bmod(990)$.

Published on 09 Dec 2017 - 22:14

score 33 · Answer 12 · 2017-12-10 10:44:22

33

Views

Why is the congruence correct?

Published on 10 Dec 2017 - 10:44

score 41 · Answer 13 · 2017-12-10 14:07:35

41

Views

Grouping in blocks by exponential Ciphers

Published on 10 Dec 2017 - 14:07

score 117 · Answer 14 · 2017-12-11 17:19:20

117

Views

I don't understand dividing in congruence equations.

Published on 11 Dec 2017 - 17:19

score 62 · Answer 15 · 2017-12-11 20:12:00

62

Views

Prove if $x\equiv y \pmod{n}$ then $x^2y\equiv xy^2\pmod{n}$ where $x,y,n \in \mathbb{N}$

Published on 11 Dec 2017 - 20:12

List Question

Polig-helman algorithm - if $g$ is a prim root mod $p$ does this mean that in the subproblems that all $A_i$ are prim roots mod $p$?

Divisibility rule for 43

Solving linear congruent system

Number of solutions to $x^n \equiv 1 \mod p$

Prove $F_n=2^{2^{k}}+1, F_n=5\mod{12}$for all $n\in\Bbb{N}$

Smallest positive integer a such that $5n^{13}+13n^5+a(9n)\equiv 0\pmod{65}$

Is there a fixed positive integer $ a$ for which $ a(b+c) | a^b+a^c$ with $b, c$ are positive integers?

Simple question about linear congruence with Fermat's little theorem $4x≡11\bmod19$

Proving that a polynomial over $K[t]$ is congruent modulo $m$ to a unique polynomial in $K[t]$

Why is congruence sign $A\equiv B\pmod{C}$?

Find the number of solutions to $x^2 ≡ 1\bmod(990)$.

Why is the congruence correct?

Grouping in blocks by exponential Ciphers

I don't understand dividing in congruence equations.

Prove if $x\equiv y \pmod{n}$ then $x^2y\equiv xy^2\pmod{n}$ where $x,y,n \in \mathbb{N}$

Trending Questions

Popular # Hahtags

Popular Questions