Advertisements
Advertisements
Question
Find HCF and LCM of 404 and 96 and verify that HCF × LCM = Product of the two given numbers.
Advertisements
Solution
404 = 2 × 2 × 101
96 = 2 × 2 × 2 × 2 × 2 × 3
LCM = 2 × 2 × 2 × 2 × 2 × 3 × 101 = 9696
LCM = 9696
HCF = 2 × 2 = 4
Product of numbers = 96 × 404 = 38784
LCM × HCF = 4 × 9696 = 38784
Hence, LCM × HCF = Product of numbers.
APPEARS IN
RELATED QUESTIONS
What is the HCF of the smallest prime number and the smallest composite number?
Determine the prime factorisation of each of the following positive integer:
58500
Can two numbers have 16 as their HCF and 380 as their LCM? Give reason.
The HCF of two numbers is 145 and their LCM is 2175. If one number is 725, find the other.
Write down the decimal expansions of the following rational numbers by writing their denominators in the form 2m × 5n, where, m, n are non-negative integers.\[\frac{13}{125}\]
Find the LCM and HCF of the following pair of integers and verify that LCM × HCF = product of the two numbers.
510 and 92
If 13824 = 2a × 3b then find a and b
What is the smallest number that when divided by three numbers such as 35, 56 and 91 leaves remainder 7 in each case?
For some integer p, every even integer is of the form ______.
For some integer p, every odd integer is of the form ______.
If two positive integers A and B can be expressed as A = xy3 and B = xiy2z; x, y being prime numbers, the LCM (A, B) is ______.
The product of two consecutive natural numbers is always ______.
When a number is divided by 7, its remainder is always ______.
If LCM(x, 18) = 36 and HCF(x, 18) = 2, then x is ______.
Explain why 3 × 5 × 7 + 7 is a composite number.
The least number that is divisible by all the numbers from 1 to 10 (both inclusive) is ______.
Statement A (Assertion): If product of two numbers is 5780 and their HCF is 17, then their LCM is 340.
Statement R (Reason): HCF is always a factor of LCM.
Show the 6n cannot end with digit 0 for any natural number 'n'.
Find the HCF and LCM of 26, 65 and 117, using prime factorisation.
