int prime(int i);
void main()
{
int n1,n2,y;
static int i,s=1;
clrscr();
printf("enter the values of n1 and n2:\t");
scanf("%d%d",&n1,&n2);
for(i=2;i<15;i++)
{
y=prime(i);
while ((n1%y==0) || (n2%y==0))
	{
	if((n1%y==0) && (n2%y==0)){n1/=y;n2/=y; s*=y;}
	else if(n1%y==0) {n1/=y; s*=y;}
	else if(n2%y==0) {n2/=y; s*=y;}
	}
}
printf("\n%d is the lcm",s);
getch();
}
int prime(int i)
{
int j;
for(j=2;j<i;j++)
if ((i%j)==0) break;
if(j==i) return i;
}