Advertisements
Advertisements
प्रश्न
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.
उत्तर
If a and b are two positive integers such that a is greater than b; then according to Euclid's division algorithm; we have
a = bq + r; where q and r are positive integers and 0 ≤ r < b.
Let b = 6, then
a = bq + r ⇒ a = 6q + r; where 0 ≤ r < 6.
When r = 0 ⇒ a = 6q + 0 = 6q; which is even integer
When r = 1 ⇒ a = 6q + 1 which is odd integer
When r = 2 ⇒ a = 6q + 2 which is even.
When r = 3 ⇒ a = 6q + 3 which is odd.
When r = 4 ⇒ a = 6q + 4 which is even.
When r = 5 ⇒ a = 6q + 5 which is odd.
This verifies that when r = 1 or 3 or 5; the integer obtained is 6q + 1 or 6q + 3 or 6q + 5 and each of these integers is a positive odd number.
Hence the required result.
APPEARS IN
संबंधित प्रश्न
15 pastries and 12 biscuit packets have been donated for a school fete. These are to be packed in several smaller identical boxes with the same number of pastries and biscuit packets in each. How many biscuit packets and how many pastries will each box contain?
A mason has to fit a bathroom with square marble tiles of the largest possible size. The size of the bathroom is 10 ft. by 8 ft. What would be the size in inches of the tile required that has to be cut and how many such tiles are required?
Using prime factorization, find the HCF and LCM of 23, 31 In case verify that HCF × LCM = product of given numbers.
Express each of the following as a rational number in its simplest form:
(i) `2. bar (24)`
Prove that \[2\sqrt{3} - 1\] is an irrational number.
Express 429 as a product of its prime factors.
Prove that the product of two consecutive positive integers is divisible by 2
Prove that square of any integer leaves the remainder either 0 or 1 when divided by 4
Write whether every positive integer can be of the form 4q + 2, where q is an integer. Justify your answer.
Use Euclid’s division algorithm to find the HCF of 441, 567, 693.