Alright, so I’m going easy on myself and doing a short blog post for this Wednesday, because I have an exam for another class to worry about, AND I SEE MUMFORD & SONS TONIGHT.

So I’m going to go through GYHD #2 right quickly!

**GYHD #2: **

### Find the following GCDs:

### GCD(10,-18)

### GCD(7,12)

### GCD(24,0)

### GCD(8,-16)

First of all, remember that GCDs are Greatest Common Divisor for each of the two number listed, which basically means that the number found to be the GCD is the greatest number found in common for (x,y) that divides both of them equally. So, the greatest divisor that divides both 10 and -18, for example, is 2. The divisors of 10 are 1, 2, 5, and 10. The divisors of -18 are 1, 2, 3, 6, 9, and 18 (with any combination of those numbers where one is positive and one is negative). The greatest number in common from these sets is 2! Simple enough!

SO:

- GCD (7,12):

Divisors of 7: 1,7

Divisors of 12: 1,2,3,4,6,12

GCD = 1

- GCD (24,0)

Divisors of 0: any number! (any number dividing 0 is zero!)

Divisors of 24: 1,2,3,4,6,8,12,24

GCD = 24

- GCD (8, -16)

Divisors of 8: 1,2,4,8

Divisors of -16: 1,2,4,8,16 (any combo where one of these numbers is positive and one is negative)

GCD = 8

## Happy Wednesday ya’ll!