# 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.

Suppose, there is any positive integer ‘a’ and it is of the form 6q + r, where q is some integer.

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

So, by Euclid’s division lemma, possible values for ‘a’ can be 6q or 6q + 1 or 6q + 2 or 6q + 3, or 6q + 4 or 6q + 5.

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

Therefore, a = 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} + 1, where k_{1} is a positive integer

6q + 3 = 6q + 2 + 1 = 2(3q + 1) + 1 = 2k_{2} + 1, where k_{2} is a positive integer

6q + 5 = 6q + 4 + 1 = 2(3q + 2) + 1 = 2k_{3} + 1, where k_{3} 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.

**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 Chapter 1 Exercise 1.1 Question 2 - Chapter 1 Exercise 1.1 Question 2:

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

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 for a given integer q