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

Created by Mehdi

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A function to find Greatest Common Divisor of two integer input E.G. x=-18 y=96</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>output should be +6</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>x=-18; y=96; &gt;&gt;your_GCD(x,y) ans =</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[     6]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

63 Solutions
50 Solvers

Last Solution submitted on Dec 12, 2021

Last 200 Solutions

Problem Recent Solvers50

Problem Tags

gcd integer number

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

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

Solution Stats

Last 200 Solutions

Problem Recent Solvers50

Suggested Problems

More from this Author2

Problem Tags

Community Treasure Hunt

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

Solution Stats

Last 200 Solutions

Problem Recent Solvers50

Suggested Problems

More from this Author2

Problem Tags

Community Treasure Hunt

Players