Create a function that given n integer values greater than zero, finds the two numbers with the greatest common divisor and returns the gcm
Example
Input x = [1 10 13 50 26]
Output y = 13
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers54
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1329 Solvers
-
631 Solvers
-
Back to basics 11 - Max Integer
812 Solvers
-
196 Solvers
-
567 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!