EFTA01140626Set 9
60p3,068w
integers, not both zero. The
greatest common divisor of a and b (or
gcd(a,b) ) is the biggest number dwhich
divides both a and b.
Equivalently: gcd ... both a and
b.
DEF: a and bare said to be relatively prime if
gcd(a,b) = 1, so no prime common divisors.
::002.02.25 26
26
EFTA01140651
Greatest Common Divisor ... Relatively Prime
Q: Find the following gcd's:
1. gcd(11,77)
2. gcd(33,77)
3. gcd(24,36)
4. gcd(24,25)
2002.02.25 27
27
EFTA01140652
Greatest Common
https://www.justice.gov/epstein/files/DataSet%209/EFTA01140626.pdf
EFTA01363027Set 10
2018-05-161p337w
this be sent downstream now for the GED, GCD, and CB parts?
Thanks,
Zack
From: Martin Zeman
Sent: Thursday, M
To: James Gladwin
Daniel-A Klyashtorny Nina Tona
>; Xavier Avila
https://www.justice.gov/epstein/files/DataSet%2010/EFTA01363027.pdf