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

241 Solutions
103 Solvers

Last Solution submitted on Mar 10, 2023

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].

Solution Comments

Show comments

Problem Recent Solvers103

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1018. Array GCD

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers103

Suggested Problems

More from this Author100

Problem Tags

Community Treasure Hunt

Problem 1018. Array GCD

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers103

Suggested Problems

More from this Author100

Problem Tags

Community Treasure Hunt

Players

WeChat