Question

Can someone explain to me why the greatest common factor of (a,b) is equal to gcf(a mod b, a)

score 968 · Answer 1 · 2020-02-18 12:42:04

968

Views

Can someone explain to me why the greatest common factor of (a,b) is equal to gcf(a mod b, a)

Published on 18 Feb 2020 - 12:42

score 285 · Answer 2 · 2020-03-09 13:00:30

285

Views

Can GCD (Euclidean algorithm) be defined/extended for finite fields (interested in $\mathbb{Z}_p$) and if so how

Published on 09 Mar 2020 - 13:00

score 1.5k · Answer 3 · 2020-03-18 01:06:41

1.5k

Views

Extended Euclidean Algorithm: why does it work?

Published on 18 Mar 2020 - 1:06

score 49 · Answer 4 · 2020-03-28 15:54:29

49

Views

Prove that $n \text{ mod } r < \frac{n}{2}$

Published on 28 Mar 2020 - 15:54

score 309 · Answer 5 · 2020-03-28 21:44:28

309

Views

Euclid's algorithm to find multiplicative inverses over a polynomial field

Published on 28 Mar 2020 - 21:44

score 33 · Answer 6 · 2020-04-01 03:50:44

33

Views

Hopefully a better solution than mod-bashing with Euler

Published on 01 Apr 2020 - 3:50

score 118 · Answer 7 · 2020-04-06 10:22:55

118

Views

Calculating remainder when a polynomial I'd divided by another polynomial

Published on 06 Apr 2020 - 10:22

score 490 · Answer 8 · 2020-04-06 16:11:19

490

Views

Proving a quadratic equation has no integral roots

Published on 06 Apr 2020 - 16:11

score 47 · Answer 9 · 2026-03-21 17:06:52

47

Views

$\Bbb Z / 3 \Bbb Z[x]/I$ and $(\Bbb Z / 3 \Bbb Z[x]/I)/J$ quotients rings. Prime elements.

Published on 21 Mar 2026 - 17:06

score 1.4k · Answer 10 · 2020-04-19 20:54:54

1.4k

Views

Finding GCD of powers and factorial numbers

Published on 19 Apr 2020 - 20:54

score 410 · Answer 11 · 2020-04-29 18:01:47

410

Views

Find the maximum value $LCM$ pair in the sequence where $LCM(a, b)$ means the smallest positive integer that is divisible by both.

Published on 29 Apr 2020 - 18:01

score 31 · Answer 12 · 2020-05-01 16:02:49

31

Views

Euclids algorithm for all integer polynomials

Published on 01 May 2020 - 16:02

score 61 · Answer 13 · 2020-05-02 02:16:24

61

Views

GCD / proof by induction / well founded order

Published on 02 May 2020 - 2:16

score 563 · Answer 14 · 2020-05-02 18:12:19

563

Views

If $f(x)$ is a common factor of $g(x)$ and $h(x)$ find $f(x)$

Published on 02 May 2020 - 18:12

score 55 · Answer 15 · 2020-05-11 17:10:57

55

Views

Prove that : $\text{gcd}\bigg(a+b, \frac{a^p+b^p}{a+b}\bigg)=1 \ \text{or} \ p$

Published on 11 May 2020 - 17:10

List Question

Can someone explain to me why the greatest common factor of (a,b) is equal to gcf(a mod b, a)

Can GCD (Euclidean algorithm) be defined/extended for finite fields (interested in $\mathbb{Z}_p$) and if so how

Extended Euclidean Algorithm: why does it work?

Prove that $n \text{ mod } r < \frac{n}{2}$

Euclid's algorithm to find multiplicative inverses over a polynomial field

Hopefully a better solution than mod-bashing with Euler

Calculating remainder when a polynomial I'd divided by another polynomial

Proving a quadratic equation has no integral roots

$\Bbb Z / 3 \Bbb Z[x]/I$ and $(\Bbb Z / 3 \Bbb Z[x]/I)/J$ quotients rings. Prime elements.

Finding GCD of powers and factorial numbers

Find the maximum value $LCM$ pair in the sequence where $LCM(a, b)$ means the smallest positive integer that is divisible by both.

Euclids algorithm for all integer polynomials

GCD / proof by induction / well founded order

If $f(x)$ is a common factor of $g(x)$ and $h(x)$ find $f(x)$

Prove that : $\text{gcd}\bigg(a+b, \frac{a^p+b^p}{a+b}\bigg)=1 \ \text{or} \ p$

Trending Questions

Popular # Hahtags

Popular Questions