Question

Extended Euclidean Algorithm: a remainder becomes zero

score 330 · Answer 1 · 2026-03-31 13:04:36

330

Views

Extended Euclidean Algorithm: a remainder becomes zero

Published on 31 Mar 2026 - 13:04

score 585 · Answer 2 · 2017-09-22 23:44:58

585

Views

Find the solution of the congruence modulo 4199

Published on 22 Sep 2017 - 23:44

score 380 · Answer 3 · 2017-09-23 23:06:48

380

Views

Find number in a certain range satisfying three modulus requirements

Published on 23 Sep 2017 - 23:06

score 290 · Answer 4 · 2017-09-24 04:46:35

290

Views

Show that there are infinitely many $x\in \mathbb{N}$ such that $f(x)$ is not prime.

Published on 24 Sep 2017 - 4:46

score 254 · Answer 5 · 2017-09-24 05:17:15

254

Views

Is there a non-brute-force way to find $x$ such that $45\leq x < 200$, $x\equiv 0 \pmod{5}$ , $x\equiv1 \pmod{8}$, $x\equiv1 \pmod{12}$?

Published on 24 Sep 2017 - 5:17

score 791 · Answer 6 · 2017-09-24 07:00:35

791

Views

Prove that $7n^3-1$ can never be a perfect square.

Published on 24 Sep 2017 - 7:00

score 283 · Answer 7 · 2017-09-24 20:06:32

283

Views

Finding a solution to congruences modulo $801*1729$

Published on 24 Sep 2017 - 20:06

score 197 · Answer 8 · 2017-09-26 07:21:49

197

Views

congruence system with $2$ variables $x, y$

Published on 26 Sep 2017 - 7:21

score 13.2k · Answer 9 · 2017-09-28 20:29:49

13.2k

Views

Prove that $a^2 \equiv b^2 $ mod $p$ implies that $a \equiv \pm b$ mod $p$

Published on 28 Sep 2017 - 20:29

score 285 · Answer 10 · 2017-09-28 20:50:09

285

Views

Show if $n \equiv 3$ (mod 7) then $x^3 +y^3 =n$ has no solution.

Published on 28 Sep 2017 - 20:50

score 190 · Answer 11 · 2017-09-29 06:29:55

190

Views

$12^{80}$ mod 143, given that $12^6 $≡ 1 mod 143

Published on 29 Sep 2017 - 6:29

score 56 · Answer 12 · 2017-09-29 12:20:29

56

Views

Difference between equivalences classes and congruence classes

Published on 29 Sep 2017 - 12:20

score 526 · Answer 13 · 2026-03-25 18:54:47

526

Views

Solving a congruence relation of the first degree (step-by-step solution?)

Published on 25 Mar 2026 - 18:54

score 41 · Answer 14 · 2017-10-01 04:38:48

41

Views

Find all solutions (if there are any) to the following congruences

Published on 01 Oct 2017 - 4:38

score 96 · Answer 15 · 2017-10-01 11:18:23

96

Views

Given that $a,b$ are integers and $a\equiv 4 \mod 13$ and $b\equiv 9 \mod 13$, find $c$ where $c\equiv 2a+3b\mod 13$

Published on 01 Oct 2017 - 11:18

List Question

Extended Euclidean Algorithm: a remainder becomes zero

Find the solution of the congruence modulo 4199

Find number in a certain range satisfying three modulus requirements

Show that there are infinitely many $x\in \mathbb{N}$ such that $f(x)$ is not prime.

Is there a non-brute-force way to find $x$ such that $45\leq x < 200$, $x\equiv 0 \pmod{5}$ , $x\equiv1 \pmod{8}$, $x\equiv1 \pmod{12}$?

Prove that $7n^3-1$ can never be a perfect square.

Finding a solution to congruences modulo $801*1729$

congruence system with $2$ variables $x, y$

Prove that $a^2 \equiv b^2 $ mod $p$ implies that $a \equiv \pm b$ mod $p$

Show if $n \equiv 3$ (mod 7) then $x^3 +y^3 =n$ has no solution.

$12^{80}$ mod 143, given that $12^6 $≡ 1 mod 143

Difference between equivalences classes and congruence classes

Solving a congruence relation of the first degree (step-by-step solution?)

Find all solutions (if there are any) to the following congruences

Given that $a,b$ are integers and $a\equiv 4 \mod 13$ and $b\equiv 9 \mod 13$, find $c$ where $c\equiv 2a+3b\mod 13$

Trending Questions

Popular # Hahtags

Popular Questions