can any one plz tl me the program for lcm and hcf of two numbers in c# programming

Question

hi can any one plz tl me the program for lcm and hcf of two numbers in c# programming.

Nirav Vaghela · Answer

Tyr this: static void Main(string[] args) { int num1 =10 num2=16 gcd lcm remainder numerator denominator; if (num1 > num2) { numerator = num1; denominator = num2; } else { numerator = num2; denominator = num1; } remainder = num1 % num2; while (remainder != 0) { numerator = denominator; denominator = remainder; remainder = numerator % denominator; } gcd = denominator; lcm = num1 * num2 / gcd; Console.WriteLine(GCD of {0} and {1} = {2} 
 num1 num2 gcd); Console.WriteLine(LCM of {0} and {1} = {2} 
 num1 num2 lcm); Console.ReadLine(); } I hope this will help you....

Rahul Bhatt · Answer

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable{mso-style-name:Table Normal;mso-tstyle-rowband-size:0;mso-tstyle-colband-size:0;mso-style-noshow:yes;mso-style-priority:99;mso-style-qformat:yes;mso-style-parent:;mso-padding-alt:0cm 5.4pt 0cm 5.4pt;mso-para-margin-top:0cm;mso-para-margin-right:0cm;mso-para-margin-bottom:10.0pt;mso-para-margin-left:0cm;line-height:115%;mso-pagination:widow-orphan;font-size:11.0pt;font-family:Calibrisans-serif;mso-ascii-font-family:Calibri;mso-ascii-theme-font:minor-latin;mso-hansi-font-family:Calibri;mso-hansi-theme-font:minor-latin;mso-bidi-font-family:Times New Roman;mso-bidi-theme-font:minor-bidi;mso-fareast-language:EN-US;} Using following method find lcm and hcf FIND LCM int lcf number1 number2; number1 = Convert .ToInt32(txtFirst.Text); number2 = Convert .ToInt32(txtSecode.Text); for (lcf = 1; ; lcf++) { if (lcf % number1 == 0 && lcf % number2 == 0) { txtThird.Text = lcf.ToString(); break ; } } FIND HCF int number1 number2; number1 = Convert .ToInt32(txtFirst.Text); number2 = Convert .ToInt32(txtSecode.Text); int hcf = 1 counter = 1; // loop until the counter equals the smallest // of the two numbers while (counter Math .Min(number1 number2)) { // if a and b divided by counter doesn't have a remainder // we will update the HCF (because counter increments on each // iteration) if ((number1 % counter == 0) && (number2 % counter == 0)) { hcf = counter; } // increment counter counter++; } // return the highest common factor txtFourth.Text = hcf.ToString();