A function to find Greatest Common Divisor of two integer input E.G. x=-18 y=96
output should be +6
x=-18; y=96; >>your_GCD(x,y) ans =
6
Solution Stats
Problem Recent Solvers32
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
2526 Solvers
-
How to find the position of an element in a vector without using the find function
2348 Solvers
-
153 Solvers
-
320 Solvers
-
243 Solvers
More from this Author2
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Problem Tags