What is the greatest common divisor of `A` and `B`?

Another way to say this is:

`\gcd(`

`A`, `B`) = {?}

`GCD`

The *greatest common divisor* is the largest number that divides evenly into both

and
`A`

.
`B`

Start by thinking about all of the numbers that divide evenly into

. In other words,
what are the `A`*divisors* of

?
`A`

The only divisor of `1`

is `1`

since that's the only number that divides evenly into `1`

:

The divisors of

are `A``toSentence( getFactors( A ) )`
since those are all the numbers that divide evenly into

:
`A`

`A` \div \color{`BLUE`}{`F`} = `A/F`

Start by thinking about all of the numbers that divide evenly into

. In other words,
what are the `B`*divisors* of

?
`B`

The only divisor of `1`

is `1`

since that's the only number that divides evenly into `1`

:

The divisors of

are `B``toSentence( getFactors( B ) )`
since those are all the numbers that divide evenly into

:
`B`

`B` \div \color{`GREEN`}{`F`} = `B/F`

To find the *common divisors*, find the all the divisors of

and
divisors of `A`

that are the same.
`B`

The only *common divisor* of

and `A`

is
`B`

since that's the only number that divides
evenly into both `GCD`

and `A`

.
`B`

The *common divisors* of

and `A`

are
`B``toSentence( COMMON_FACTORS )` since each of those numbers divides
evenly into both

and `A`

. We're interested in the `B`*greatest* common divisor.

jQuery( "span.hint_pink" ).show();

The greatest common divisor of

and `A`

is `B`

.
In other words, `GCD``\gcd(`

.
`A`, `B`) = `GCD`