According to Euclid's division lemma,for $a$ and $5$,if $a = 5q + r$ is unique,then $r = \ldots$ is not possible.

  • A
    $0$
  • B
    $2$
  • C
    $4$
  • D
    $6$

Explore More

Similar Questions

Find the $g.c.d.$ (Greatest Common Divisor) of $75$ and $243$ using Euclid's division algorithm.

For any positive integer $n,$ prove that $n^{3}-n$ is divisible by $6.$

Difficult
View Solution

The $\text{g.c.d.}$ (greatest common divisor) of any two consecutive natural numbers is:

State whether the following rational number has a terminating decimal expansion or not. If it has a terminating decimal expansion,find it: $\frac{17}{8}$

Using Euclid's division algorithm,find the largest number that divides $1251, 9377$ and $15628$ leaving remainders $1, 2$ and $3$,respectively.

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