Advertisements
Advertisements
Question
What do you mean by Euclid’s division algorithm.
Solution
Euclid’s division lemma, states that for any two positive integers a and b, there exist unique whole numbers q and r, such that
a = b × q + r where 0 ≤ r ˂ b
APPEARS IN
RELATED QUESTIONS
Define HOE of two positive integers and find the HCF of the following pair of numbers:
475 and 495
Using prime factorization, find the HCF and LCM of 36, 84 In case verify that HCF × LCM = product of given numbers.
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `151/600`
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.
(i) `129/(2^2× 5^7 × 7^5)`
Express each of the following integers as a product of its prime factors:
420
The HCF to two numbers is 16 and their product is 3072. Find their LCM.
What is a composite number?
What is the HCF of the smallest composite number and the smallest prime number?
Two numbers have 12 as their HCF and 350 as their LCM (True/False).
The smallest number by which \[\sqrt{27}\] should be multiplied so as to get a rational number is
