Advertisements
Advertisements
Question
What do you mean by Euclid’s division algorithm?
Solution
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
RELATED QUESTIONS
Show that any positive integer which is of the form 6q + 1 or 6q + 3 or 6q + 5 is odd, where q is some integer.
Show that the square of an odd positive integer is of the form 8q + 1, for some integer q.
Prove that the square of any positive integer is of the form 3m or, 3m + 1 but not of the form 3m +2.
Find the maximum number of students among whom 1001 pens and 910 pencils can be distributed in such a way that each student gets the same number of pens and the same number of pencils.
Is it possible to have two numbers whose HCF if 25 and LCM is 520?
If a and b are relatively prime, what is their LCM?
Find the least number that is divisible by all the numbers between 1 and 10 (both inclusive).
What is a composite number?
If n is a natural number, then 92n − 42n is always divisible by ______.
The numbers 525 and 3000 are both divisible only by 3, 5, 15, 25 and 75. What is HCF (525, 3000)? Justify your answer.
