We notice that 9 divides both numbers. We can use Euler’s algorithm to obtain the GCD

123456789)987654321(8

987654312

9

If x divides A and x divides B, x divides the Rem where (A > B)

\ The GCD is 9. Choice (C)