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 6, Natural numbers, squares and sums.
2586 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1331 Solvers
-
435 Solvers
-
11430 Solvers
-
Sum the numbers on the main diagonal
620 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!