hcf and lcm how to solve with short division method
Answers
Answered by
8
there is no short division method it is called long division method and it is long than the LCM method
hope it helps please mark as brainliest
hope it helps please mark as brainliest
Answered by
3
To find Least Common Multiple by using Division Method we need to follow the following steps.
Step 1: Write the given numbers in a horizontal line, separating them by commas.
Step 2: Divide them by a suitable prime number, which exactly divides at least two of the given numbers.
Step 3: We put the quotient directly under the numbers in the next row. If the number is not divided exactly, we bring it down in the next row.
Step 4: We continue the process of step 2 and step 3 until all co-prime numbers are left in the last row.
Step 5: We multiply all the prime numbers by which we have divided and the co-prime numbers left in the last row. This product is the least common multiple of the given number
We divide the bigger number by smaller one.
hcf for division method...
Divide smaller number in step 1 with remainder obtained in step 1.
Divide divisor of second step with remainder obtained in step 2.
We will continue this process till we get remainder zero and divisor obtained in end is the required H.C.F.
otherwise , you make own mwthid used then the short method.
Step 1: Write the given numbers in a horizontal line, separating them by commas.
Step 2: Divide them by a suitable prime number, which exactly divides at least two of the given numbers.
Step 3: We put the quotient directly under the numbers in the next row. If the number is not divided exactly, we bring it down in the next row.
Step 4: We continue the process of step 2 and step 3 until all co-prime numbers are left in the last row.
Step 5: We multiply all the prime numbers by which we have divided and the co-prime numbers left in the last row. This product is the least common multiple of the given number
We divide the bigger number by smaller one.
hcf for division method...
Divide smaller number in step 1 with remainder obtained in step 1.
Divide divisor of second step with remainder obtained in step 2.
We will continue this process till we get remainder zero and divisor obtained in end is the required H.C.F.
otherwise , you make own mwthid used then the short method.
Similar questions