What is the greatest common divisor between 432 and 360?

The same as the greatest common divisor between 360 and 72 (72 is the remainder of the division of 432 and 360).Apply this reasoning repeatedly (that's the Euclidian algorithm), until one of the two numbers is zero.