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 Solvers104
Suggested Problems
-
4254 Solvers
-
Construct a string from letters and counts
140 Solvers
-
Matrix with different incremental runs
479 Solvers
-
466 Solvers
-
Flip the vector from right to left
8482 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!