Question

could someone help me with using the Euclidean algorithm to solve for the gcd of three nos?

Answer 1

if you have a function, gcd(x, y), that takes two arguments and returns the greatest common denominator - then if x, y, and z have a common denominator it will be
gcd(x, gcd(y, z))

http://ideone.com/0Ldt2

Answer 2

thanx a lot