Go Job Hunting at the LQ Job Marketplace
 Home Forums HCL Reviews Tutorials Articles Register Search Today's Posts Mark Forums Read
 LinuxQuestions.org linux programe for finding GCD of two numbers
 Programming This forum is for all programming questions. The question does not have to be directly related to Linux and any language is fair game.

Notices

 09-02-2009, 06:21 AM #1 yoga LQ Newbie   Registered: Sep 2009 Posts: 1 Rep: linux programe for finding GCD of two numbers i am M.Sc. electronics student.please help me in constructing linux program for G.C.D. of two numbers.And also i want logic of this program Last edited by XavierP; 09-02-2009 at 06:53 AM. Reason: Moved to Programming
 09-02-2009, 08:20 AM #2 hyperactive22 LQ Newbie   Registered: May 2007 Posts: 8 Rep: A trivial solution to find LCM is as follows: do { if (a < b) { temp = a ; a = b; b = temp; } a = a - b ; }while(b) ; Here a and b are the input values to program and the final value of a is the LCM Then use this equation: GCD * LCM = a * b to find GCD. Last edited by hyperactive22; 09-02-2009 at 08:21 AM.
 09-30-2009, 04:55 AM #3 idgl LQ Newbie   Registered: Aug 2004 Location: Johannesburg Distribution: RH 9.0 & Fedora Core 2 Posts: 2 Rep: Euclid's algorithm to find the greatest common divisor of two positive integers, m and n. See D. Knuth 'The Art of Computer Programming', Volume 1, page 2. (1) Divide m by n and let r be the remainder. (2) If r equals 0 the algorithm terminate; n is the answer. (3) Set m to n, n to r and go back to step (1). #!/bin/bash m=\$1 n=\$2 while true do r=\$(( \$m % \$n )) # (1) Divide m by n and let r be the remainder. if [ \$r -eq 0 ] # (2) If r equals 0 the algorithm terminate; n is the answer. then echo \$n break fi m=\$n # (3) Set m to n, n to r and go back to step (1). n=\$r done