Euclid's division lemma states that for two positive integers $a$ and $b,$ there exist unique integers $q$ and $r$ such that $a = bq + r,$ where $r$ must satisfy
- A$1 < r < b$
- B$0 \leq r < b$
- C$0 < r \leq b$
- D$0 < r < b$
Explore More
Similar Questions
Prove that $n^{2}-n$ is divisible by $2$ for every positive integer $n$.
Medium
View SolutionWhich of the following is Bezout's identity?
Easy
View Solution$\sqrt{12}$ and ........ are like surds.
Easy
View SolutionFor any positive integer $n,$ prove that $n^{3}-n$ is divisible by $6.$
Difficult
View SolutionProve that,if $a$ and $b$ are odd positive integers,then $a^{2} + b^{2}$ is even but not divisible by $4$.
Difficult
View SolutionVedclass Products
For Students
Vedclass Test Series
Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.
Start Free TrialFor Teachers
Exam Paper Generator
Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.
Try FreeFor Institutes
Online Exam Module
Live online exams with unlimited students, 360° analytics & white-label branding.
See Demo