0
What else can I help you with?
What is the LCM of x2 plus 8x-9 and x2-1?
I take it LCM is the lowest common multiple For the above the only common multiple is 1 you get x=1 1^2 + (8*1) -9 = 0 and 1^2 -1 = 0 Hope this helps
Is 2 a LCM?
It can be. 2 is the LCM of 1 and 2.
What is the LCM of 1 1and 2?
The LCM of 1, 1 and 2 is 2.
Why do we not use 0 as the LCM of two numbers?
Let's start with an example: 1/2 + 1/3 To add these two fractions, you first need to find the LCM which here is 6 Then you change both denominators to 6 and the problem becomes 3/6 + 2/6 = 5/6 Now if the LCM were 0, then you would get a denominator, 0. But you can not divide by 0. It becomes meaningless. So the LCM always excludes 0
What is the LCM for 1 and 2?
The LCM is 2.
LCM of 1 and 2?
Least Common Multiple (LCM) for 1 2 is 2
What is the LCM of 14 what is the LCM of 2 what is the LCM of 3 what is the LCM of 1?
You can't find the LCM of a single number. The LCM of 1, 2, 3 and 14 is 42.
What is the LCM of 1 over 2?
Ah, the LCM stands for the Least Common Multiple. When we talk about the LCM of 1 over 2, we are looking for the smallest number that both 1 and 2 can divide into evenly. Since 1 and 2 have no common factors other than 1, the LCM of 1 and 2 is simply their product, which is 2.
Which set of numbers has an LCM of 2?
1 and 2 has an LCM of 2.
LCM of x2 - 1 x - 1 and x plus 1?
The LCM is x^2 - 1.
What is the LCM of 7and 16?
The LCM (least common multiple) of numbers a,b is defind as (a*b)/(hcf(a,b)) the hcf(7,16) can be found with Euclid algorithm 16=(7)(2)+2 7=(3)(2)+1 2=(1)(2)+0 thus hcf(16,14)=1 7*16=94 94/1=94 thus the LCM of 7 and 16 is 94
A program in C that accepts 15 different numbers and find the LCM and HCM?
/* To Get The LCM Of 15 Nos in C++/ C(Just Change cin to scanf & cout to printf) */ /* Developed By Kishore Kr. Banerjee - papillon_kish@yahoo.com*/ #include <iostream.h> #include <conio.h> main() { int num[15],i,j,n1,n2,LCM,flag; clrscr(); for(i=0;i<15;i=i+1) { cout<<"Enter No - "<<i+1<<"="; cin>>num[i]; } clrscr(); n1=num[0]; for(i=1;i<15;i=i+1) { n2=num[i]; LCM=1; for(j=1;n1%j==0n2%j==0;j=j+1) { if(n1%j==0) { n1=n1/j; flag=1; } if(n2%j==0) { n2=n2/j; flag=1; } if(flag==1) { LCM=LCM*j; } } LCM=LCM*n1*n2; n1=LCM; } cout<<"the LCM ="<<LCM; getch(); }
