Advertisements
Advertisements
Question
Euclid’s division lemma states that for positive integers a and b, there exist unique integers q and r such that a = bq + r, where r must satisfy
Options
1 < r < b
0 < r < b
0 ≤ r < b
0 < r ≤ b
Solution
0 ≤ r < b
APPEARS IN
RELATED QUESTIONS
Show that every positive integer is of the form 2q and that every positive odd integer is of the from 2q + 1, where q is some integer.
Use Euclid's Division Algorithm to show that the cube of any positive integer is either of the 9m, 9m + 1 or 9m + 8 for some integer m
What do you mean by Euclid’s division algorithm?
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)`
Find the greatest number of 6 digits exactly divisible by 24, 15 and 36.
Show that \[2 - \sqrt{3}\] is an irrational number.
Prove that \[\sqrt{5} + \sqrt{3}\] is irrational.
If a and b are relatively prime numbers, then what is their LCM?
Prove that one and only one out of n, n + 2 and n + 4 is divisible by 3, where n is any positive integer.
For any positive integer n, prove that n3 – n is divisible by 6.
