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

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(B) No.
According to Euclid's division lemma,for any positive integer $a$ and a divisor $b=3$,there exist unique integers $q$ and $r$ such that:
$a = 3q + r$,where $0 \leq r < 3$.
Since $r$ must be an integer satisfying the condition $0 \leq r < 3$,the possible values for the remainder $r$ are $0, 1,$ and $2$.
Therefore,the statement that the remainders are only $0$ and $1$ is incorrect.

Explore More

Similar Questions

The following real number is expressed in decimal form: $0.05005000500005 \ldots$. Determine whether it is rational or irrational. If it is rational,express it in the form of $\frac{p}{q}$.

Use Euclid's division algorithm to find the $HCF$ of $441, 567, 693$.

Difficult
View Solution

Prove that the following number is irrational: $\sqrt{11}$

Find the $g.c.d.$ of the following numbers using Euclid's division algorithm: $117$ and $65$.

Find the square root of $8+\sqrt{63}$ in the form of a binomial surd.

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