Problem 1018. Array GCD

Created by AMITAVA BISWAS

Solve Later

Find Greatest Common Divisor in a given array
Function Template:

function ans = arraygcd(a)
   % a=[45 15 200 300];
   5;
end

Solve

Solution Stats

Last solution submitted on Oct 13, 2019

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Peng Liu on 1 Sep 2015

Note that all solutions (which passed the limited test suite with small size) involving only pair-wise gcd calculations are indeed incorrect. Those solutions include the following ones: 1) min(gcd(a,min(a))); 2) min(gcd(a(1), a)); 3) min(min(bsxfun(@gcd,a,a.'))); To eliminate these incorrect solutions, please simply add a test case with a = [21 15 35].

Problem Recent Solvers76

Problem Tags

gcd

Problem 1018. Array GCD

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers76

Suggested Problems

More from this Author100

Problem Tags

Problem 1018. Array GCD

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers76

Suggested Problems

More from this Author100

Problem Tags

Players