Question

1) Given two positive numbers, write a program using while loop to determine their lowest common multiple. You cannot use any automatic LCM, GCD finder function or return command.

Program Inputs

• Enter the first number: – The user can enter any positive whole number, no error checking required

• Enter the second number: – The user can enter any positive whole number, no error checking required Program Outputs • The LCM of X and Y is Z! – Replace X with first number, Y with second number and Z with LCM.

Please include sample outputs of the program functioning.

Answer 1

// Finding LCM using Euclid's theorem (By finding GCD) //

#include<stdio.h>

void main()

{

int a,b,num,deno,gcd,lcm,rem;

// num=numerator, deno=denominator, rem=remainder //

printf("Enter 2 numbers \n");

scanf("%d %d \n",&a,&b);

if(a>b)

{

num=a;

deno=b;

}

else

{

num=b;

deno=a;

};

rem=num%deno;

// This part calculates GCD //

while(rem!=0)

{

num=deno;

deno=rem;

rem=num%deno;

}

gcd=deno;

lcm=a*b/gcd;

printf("LCM of %d and %d is %d ! \n",a,b,lcm);

}

---------------------------------------------------------------------------------------------------------------------------------------------------------------------

Sample Outputs:

1.

Enter 2 numbers

5 10

LCM of 5 and 10 is 10 !

2.

Enter 2 numbers

34 45

LCM of 34 and 45 is 1530 !