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
-
Find the peak 3n+1 sequence value
2571 Solvers
-
Project Euler: Problem 7, Nth prime
1773 Solvers
-
6213 Solvers
-
1224 Solvers
-
Height of a right-angled triangle
2071 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!