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

• Created by Mehdi
• Appears in 3 groups

×

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

Board Games I

• 16 Problems
• 21 Finishers

Probability & Stats

• 30 Problems
• 3 Finishers

M3 Challenge Problem Group

• 20 Problems
• 20 Finishers

Like (0)

Difficulty:

(434)

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

• Getting logical indexes

  1126 Solvers

• Pi Estimate 1

  1239 Solvers

• Who has power to do everything in this world?

  453 Solvers

• Determine the length of a string of characters

  258 Solvers

• Your favourite city!

  303 Solvers

More from this Author2

• iteration of N blank spot

  52 Solvers

• Prime number removal

  95 Solvers