Advertisements
Advertisements
प्रश्न
What do you mean by Euclid’s division algorithm?
उत्तर
Euclid’s division algorithm states that for any two positive integers a and b, there exit unique integers q and r, such that a = bq + r. where 0 ≤ r ≤ b.
APPEARS IN
संबंधित प्रश्न
Using prime factorization, find the HCF and LCM of 30, 72, 432 .
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.
(i) `29/343`
Express each of the following as a rational number in its simplest form:
(i) `2. bar (24)`
If a and b are two prime numbers then find the HCF(a, b)
What is a composite number?
Find the smallest number which when increased by 17 is exactly divisible by both 520 and 468.
What is the smallest number that, when divided by 35, 56 and 91 leaves remainders of 7 in each case?
Prove that following numbers are irrationals:
Write whether every positive integer can be of the form 4q + 2, where q is an integer. Justify your answer.
What is the greatest possible speed at which a man can walk 52 km and 91 km in an exact number of hours?
