Advertisements
Advertisements
प्रश्न
What do you mean by Euclid’s division algorithm.
उत्तर
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
संबंधित प्रश्न
Using Euclid's division algorithm, find the H.C.F. of 196 and 38220
Prove that the product of three consecutive positive integer is divisible by 6.
Define HOE of two positive integers and find the HCF of the following pair of numbers:
32 and 54
The HCF of two numbers is 18 and their product is 12960. Find their LCM.
Three pieces of timber 42m, 49m and 63m long have to be divided into planks of the same length. What is the greatest possible length of each plank? How many planks are formed?
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `171/800`
If a and b are relatively prime, what is their LCM?
Find the greatest number of 6 digits exactly divisible by 24, 15 and 36.
Find the largest number which on dividing 1251, 9377 and 15628 leave remainders 1, 2 and 3 respectively.
Prove that the product of two consecutive positive integers is divisible by 2
