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)

Easy Sequences Volume II

• 10 Problems
• 5 Finishers

Easy Sequences Volume III

• 10 Problems
• 1 Finishers

Like (0)

Difficulty:

(8)

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.83% Correct | 27.17% Incorrect

• 254 Solutions
• 180 Solvers

Last Solution submitted on Mar 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 Solvers180

Suggested Problems

• Determine if a Given Number is a Triangle Number

  383 Solvers

• Energy of a photon

  1420 Solvers

• Min of a Matrix

  726 Solvers

• Factorial Numbers

  426 Solvers

• Evaluating a polynomial

  365 Solvers

More from this Author2

• Prime number removal

  95 Solvers

• iteration of N blank spot

  52 Solvers