MathLiveEuclidean division
For integers a and b with b not zero, there is a unique quotient q and remainder r such that a equals bq plus r and r lies between 0 and the absolute value of b. It underlies integer division and the Euclidean algorithm.
a = bq + r \quad \text{with } 0 \leq r < |b|What the symbols mean
| the integer being divided (dividend) | |
| the nonzero integer divisor | |
| the unique integer quotient | |
| the unique integer remainder, satisfying $0 \leq r < |b|$ |
About this formula
- FieldMathematics
- TopicNumber theory
- LevelHigh school
- Also calleddivision with remainder, euclidean division theorem, division algorithm, integer division with remainder, quotient and remainder, euclid division lemma
- SourceWikidata Q181054
Write it in Obsidian
MathLive is a free visual math editor for Obsidian. Run Find a formula, type “euclidean division”, and it goes into your note as editable LaTeX. You can also scan formulas from screenshots, PDFs and handwriting.