- 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
Solution Comments
Show comments
Loading...
Problem Recent Solvers107
Suggested Problems
-
Return the largest number that is adjacent to a zero
5515 Solvers
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
993 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3670 Solvers
-
900 Solvers
More from this Author99
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
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].