Edstroyer Posted October 28, 2004 Share Posted October 28, 2004 this method is called " method of successive division" example : find the Greatest Common Divisor (GCD) of the two numbers: 31 and 27 ... ofcourse, you can pick any other two numbers, its that easy! notice the pattern because its the only way i can explain it: START : 31 = (27)*1 + [4] (27) = [4]*6 + {3} [4] = {3}*1 + (1) {3} = (1)*3 + 0 ----> STOP when you see the Zero , your GCD is the previous step ofcourse the GCD is a 1 because 31 is a prime , but try two other numbers and see how quick and easy this method is. might just save you on the actual exam :whistle: Quote Link to comment Share on other sites More sharing options...
sabna Posted October 30, 2004 Share Posted October 30, 2004 hi.... its nice of u!!!! thanks!!!!!! sabna Quote Link to comment Share on other sites More sharing options...
calm_J Posted November 2, 2004 Share Posted November 2, 2004 thanks, it's very helpful and fast Quote Link to comment Share on other sites More sharing options...
manwiththemission2005 Posted October 22, 2005 Share Posted October 22, 2005 A really good method for finding GCD. Quote Link to comment Share on other sites More sharing options...
qiwenfarmer Posted October 23, 2005 Share Posted October 23, 2005 good work, never thought of it Quote Link to comment Share on other sites More sharing options...
SNYP40A1 Posted September 10, 2006 Share Posted September 10, 2006 This deserves a bump! Quote Link to comment Share on other sites More sharing options...
bscout Posted September 11, 2006 Share Posted September 11, 2006 This kind of question is common on the GRE? 44 and 28 44 = (28)*1+[16] 28 = [16]*1+{12} 16 = {12}*1+(4) 12 = 4*3+0 ==> Answer 4. Is this right? Quote Link to comment Share on other sites More sharing options...
Annie9 Posted September 11, 2006 Share Posted September 11, 2006 clear on this? Can someone explain? Quote Link to comment Share on other sites More sharing options...
jinics Posted October 13, 2006 Share Posted October 13, 2006 let me do it another way a bit graphical ---> 1 -->---- 28 |44 ---> 28 1 --->---------- --->16 | 28 -------->16 1 -------->---------- -------->12 | 16 ------------->12 3 ------------->------------- ------------->4 | 12 ----------------->12 ----------------->-------- ------------------>X ----------------->--------- So 4 is the GCF. regards jinics Quote Link to comment Share on other sites More sharing options...
sarapigasso Posted October 15, 2006 Share Posted October 15, 2006 is this better? 44,28 1 l 44 2 l 22 2 l 11 prime =ending 1 l 28 2 l 14 2 l 7 prime = ending answer is 1*2*2 = 4 just an alternative Quote Link to comment Share on other sites More sharing options...
Skl Posted October 16, 2006 Share Posted October 16, 2006 just wanna clarify, by solving this, is this correct? 25,16 25=16*1+[9] 16=[9]*1+{7} [9]={7}*1+(2) {7}=(2)*3+ 1 (2)= 1 * {2}+0 Is the GCD 1 for these two numbers. Quote Link to comment Share on other sites More sharing options...
jinics Posted October 16, 2006 Share Posted October 16, 2006 Is the GCD 1 for these two numbers. yup :) Quote Link to comment Share on other sites More sharing options...
een Posted October 16, 2006 Share Posted October 16, 2006 Hi,Skl! You are absolutely right! It is the Euclidean algorithm. All the best! Katya Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.