Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer

Solution:

To solve this question, let us use Euclid’s division algorithm.

Let's assume any positive integer ‘a’ of the form 6q + r, where q is some integer.

This means that 0 ≤ r < 6, i.e, r = 0 or 1 or 2 or 3 or 4 or 5 but it can’t be 6 because r is smaller than 6.

Thus, a = 6q + r for some integer q ≥ 0 and r = 0, 1, 2, 3, 4, 5 since 0 ≤ r < 6

Therefore, possible values of a are 6q + 0 or 6q + 1 or 6q + 2 or 6q + 3 or 6q + 4 or 6q + 5.

Now, 6q + 1 = 2 × 3 q + 1 = 2k₁ + 1, where k₁ is a positive integer

6q + 3 = 6q + 2 + 1 = 2(3q + 1) + 1 = 2k₂ + 1, where k₂ is a positive integer

6q + 5 = 6q + 4 + 1 = 2(3q + 2) + 1 = 2k₃ + 1, where k₃ is a positive integer

Clearly, 6q + 1, 6q + 3 and 6q + 5 are of the form 2k + 1, where k is an integer. Therefore, 6q + 1, 6q + 3 and 6q + 5 are not exactly divisible by 2.

Hence, these expressions of numbers are odd numbers and therefore any odd integers can be expressed in the form 6q + 1 or 6q + 3 or 6q + 5.

☛ Check: NCERT Solutions for Class 10 Maths Chapter 1

Video Solution:

Show that any positive odd integer is of the form 6q +1, or 6q + 3, or 6q + 5, where q is some integer

NCERT Solutions Class 10 Maths Question 2 - Chapter 1 Exercise 1.1 Question 2

Summary:

Using Euclid's division algorithm, it can be proved that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5 , where q is some integer.

☛ Related Questions:

• Use Euclid's division algorithm to find the HCF of:(i) 135 and 225(ii) 196 and 38220(iii) 867 and 255
• An army contingent of 616 members is to march behind an army band of 32 members in a parade. The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march?
• Use Euclid’s division lemma to show that the square of any positive integer is either of form 3m or 3m + 1 for some integer m.[Hint: Let x be any positive integer then it is of the form 3q, 3q + 1 or 3q + 2. Now square each of these and show that they can be rewritten in form of 3m or 3m + 1.]
• Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1, or 9m + 8.