The greatest common divisor of several (more than 2) numbers

Question

I am looking for the simplest solution to get the greatest common divisor of multiple values. Something like:

x=gcd_array(30,40,35) % Should return 5 x=gcd_array(30,40) % Should return 10 

How would you solve this?

Many thanks!

Answer 1

 gcd(a,b,c) = gcd(a,gcd(b,c)) 

This means that you can use recursion.

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.73.3&rep=rep1&type=pdf&ei=90jgT9KPAtLS4QSNlOGdDQ&usg=AFQjCNGH_GewFofxWPfX2BDN6T5NF9PxA

Answer 2

  `% GCD OF list of Nos using Eucledian Alogorithm function GCD= GCD(n); x=1; p=n; while(size(n,2))>=2 p= n(:,size(n,2)-1:size(n,2)); n=n(1,1:size(n,2)-2); x=1; while(x~=0) x= max(p)-min(p); p = [x,min(p)]; end n=[n,max(p)]; p= []; end '