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 Solvers53
Suggested Problems
-
Maximum running product for a string of numbers
2254 Solvers
-
Matrix with different incremental runs
582 Solvers
-
1066 Solvers
-
229 Solvers
-
617 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!