Problem 42966. find "greatest common divisor" of two integer value

• Created by Mehdi
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Satellite and Space Engineering Problems

• 10 Problems
• 22 Finishers

Real-World Problems

• 10 Problems
• 37 Finishers

Like (0)

Difficulty:

(119)

Rate

• Solve Later   
• Add To GroupÂ

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

Solve

Solution Stats

72.94% Correct | 27.06% Incorrect

• 255 Solutions
• 181 Solvers

Last Solution submitted on Apr 11, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers181

Suggested Problems

• The Hitchhiker's Guide to MATLAB

  3330 Solvers

• So many choices

  457 Solvers

• Find the logic

  292 Solvers

• Find the max element of the array

  1733 Solvers

• Laws of motion 4

  1800 Solvers

More from this Author2

• iteration of N blank spot

  52 Solvers

• Prime number removal

  95 Solvers