Prove that any positive odd integer is of the form $6m+1$ or $6m+3$ or $6m+5$,where $m \in N \cup \{0\}$.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) Let $a$ be any positive odd integer. By Euclid's division lemma,for any positive integer $a$ and $b=6$,there exist unique integers $q$ and $r$ such that $a = 6q + r$,where $0 \le r < 6$.
Since $r$ can be $0, 1, 2, 3, 4, 5$,the possible forms of $a$ are $6q, 6q+1, 6q+2, 6q+3, 6q+4,$ and $6q+5$.
If $a = 6q, 6q+2,$ or $6q+4$,then $a$ is even because these are divisible by $2$ (e.g.,$6q = 2(3q)$).
Since $a$ is an odd integer,it cannot be of the form $6q, 6q+2,$ or $6q+4$.
Therefore,any positive odd integer must be of the form $6q+1, 6q+3,$ or $6q+5$ for some integer $q \ge 0$. Replacing $q$ with $m$,we get the forms $6m+1, 6m+3,$ or $6m+5$.

Explore More

Similar Questions

Show that the square of an odd positive integer can be of the form $6q + 1$ or $6q + 3$ for some integer $q$.

Prove that $21^{n}$ cannot end in zero for any natural number $n \in N$.

On a morning walk,three persons step off together and their steps measure $40\, cm$,$42\, cm$ and $45\, cm$,respectively. What is the minimum distance each should walk so that each can cover the same distance in complete steps? (in $cm$)

Difficult
View Solution

The values of the remainder $r$,when a positive integer $a$ is divided by $3$ are $0$ and $1$ only. Justify your answer.

The smallest positive number divisible by every integer from $2$ to $10$ is:

Difficult
View Solution

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo