Advertisements
Advertisements
Question
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.
Solution
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
RELATED QUESTIONS
Two brands of chocolates are available in packs of 24 and 15 respectively. If I need to buy an equal number of chocolates of both kinds, what is the least number of boxes of each kind I would need to buy?
What do you mean by Euclid’s division algorithm?
Using Euclid’s algorithm, find the HCF of 960 and 1575 .
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.
(i) `9/35`
Is it possible to have two numbers whose HCF if 25 and LCM is 520?
Prove that following numbers are irrationals:
If HCF (26, 169) = 13, then LCM (26, 169) =
If d is the Highest Common Factor of 32 and 60, find x and y satisfying d = 32x + 60y
Show that cube of any positive integer is of the form 4m, 4m + 1 or 4m + 3, for some integer m.
If n is an odd integer, then show that n2 – 1 is divisible by 8.