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
-
28049 Solvers
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15805 Solvers
-
2181 Solvers
-
Replace NaNs with the number that appears to its left in the row.
3069 Solvers
-
18561 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!