# Recursive method to find GCD of two values

Page 1 of 1

## 0 Replies - 6097 Views - Last Post: 13 November 2006 - 04:01 PMRate Topic: //<![CDATA[ rating = new ipb.rating( 'topic_rate_', { url: 'http://www.dreamincode.net/forums/index.php?app=forums&module=ajax&section=topics&do=rateTopic&t=20808&amp;s=122deb30ac768c22ab793b78f9bd0d00&md5check=' + ipb.vars['secure_hash'], cur_rating: 0, rated: 0, allow_rate: 0, multi_rate: 1, show_rate_text: true } ); //]]>

### #1 btensay

Reputation: 0
• Posts: 2
• Joined: 13-November 06

# Recursive method to find GCD of two values

Posted 13 November 2006 - 04:01 PM

how do you do a recursive method to find the gcd of some two values x and y?

edit: modified title to be more descriptive ~ jayman9
Is This A Good Question/Topic? 0

Page 1 of 1

 .related ul { list-style-type: circle; font-size: 12px; font-weight: bold; } .related li { margin-bottom: 5px; background-position: left 7px !important; margin-left: -35px; } .related h2 { font-size: 18px; font-weight: bold; } .related a { color: blue; }