Advertisements
Advertisements
Question
Show that every positive even integer is of the form (6m+1) or (6m+3) or (6m+5)where m is some integer.
Solution
Let n be any arbitrary positive odd integer.
On dividing n by 6, let m be the quotient and r be the remainder. So, by Euclid’s division lemma, we have
n = 6m + r, where 0 ≤ r ˂ 6.
As 0 ≤ r ˂ 6 and r is an integer, r can take values 0, 1, 2, 3, 4, 5.
⇒ n = 6m or n = 6m + 1 or n = 6m + 2 or n = 6m + 3 or n = 6m + 4 or n = 6m + 5
But n ≠ 6m or n ≠ 6m + 2 or n ≠ 6m + 4 ( ∵ 6m, 6m + 2, 6m + 4 are multiples of 2, so an even integer whereas n is an odd integer)
⇒ n = 6m + 1 or n = 6m + 3 or n = 6m + 5
Thus, any positive odd integer is of the form (6m + 1) or (6m + 3) or (6m + 5), where m is some integer.
APPEARS IN
RELATED QUESTIONS
Prove that if a positive integer is of the form 6q + 5, then it is of the form 3q + 2 for some integer q, but not conversely.
Define HOE of two positive integers and find the HCF of the following pair of numbers:
18 and 24
If the HCF of 657 and 963 is expressible in the form 657x + 963y − 15, find x.
Using prime factorization, find the HCF and LCM of 8, 9, 25 .
Using prime factorization, find the HCF and LCM of 21, 28, 36, 45 .
Find the largest number which divides 438 and 606 leaving remainder 6 in each case.
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal
(i) `73/(2^3× 3^3 × 5)`
If a and b are relatively prime numbers, then what is their LCM?
If two positive integers m and n are expressible in the form m = pq3 and n = p3q2, where p, q are prime numbers, then HCF (m, n) =
Use Euclid’s division algorithm to find the HCF of 441, 567, 693.