Problem 1018. Array GCD
- Find Greatest Common Divisor in a given array
- Function Template:
function ans = arraygcd(a) % a=[45 15 200 300]; 5; end
Solution Stats
Problem Comments
-
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 commentsProblem Recent Solvers106
Suggested Problems
-
Find state names that start with the letter N
1349 Solvers
-
114 Solvers
-
Detect a number and replace with two NaN's
193 Solvers
-
1520 Solvers
-
Basics: Divide integers to get integer outputs in all cases
133 Solvers
More from this Author100
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!