- 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 Solvers108
Suggested Problems
-
Project Euler: Problem 2, Sum of even Fibonacci
2918 Solvers
-
988 Solvers
-
Create a vector whose elements depend on the previous element
808 Solvers
-
Basics: Divide integers to get integer outputs in all cases
137 Solvers
-
277 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].