Greatest common divisor 2

The greatest common divisor of two numbers x and y is the largest number that both x and y are divisible by. The greatest common divisor for several numbers is the largest number that all of those numbers are divisible by.

Implement a function gcd(*numbers) that would return the greatest common divisor of all the numbers passed to it.