Abstract Algebra: Theory and Applications · Problem 2.4.15

Groups — Thomas Judson

Mathematics — Abstract Algebra · euclidean-algorithm-gcd

Problem

For each of the following pairs of numbers

a

and

b

, calculate

\gcd(a,b)

and find integers

r

and

s

such that

\gcd(a,b) = ra + sb

. ((a))

14

and

39

((b))

234

and

165

((c))

1739

and

9923

((d))

471

and

562

((e))

23771

and

19945

((f))

-4357

and

3754

Related theory

Divisibility Gcd And The Euclidean Algorithm

Browse the problem library