Euclidean division
In arithmetic, Euclidean division – or division with remainder – is the process of dividing one integer (the dividend) by another (the divisor), in a way that produces a quotient and a remainder smaller than the divisor. A fundamental property is that the quotient and the remainder exist and are unique, under some conditions. Because of this uniqueness, Euclidean division is often considered without referring to any method of computation, and without explicitly computing the quotient and the remainder. The methods of computation are called integer division algorithms, the best known of which being long division.
Wikipage disambiguates
ArithmeticBCH codeBurst error-correcting codeBézout's identityC mathematical functionsCayley–Hamilton theoremChinese mathematicsChinese remainder theoremCommon LispContinued fractionDivision (mathematics)Division algorithmDivision theoremDivision with remainderEquivalence classEuclid's Division LemmaEuclid's Division lemmaEuclid's division lemmaEuclideanEuclidean algorithmEuclidean domainExtended Euclidean algorithmFactorizationFactorization of polynomials over finite fieldsFinite fieldFractionFunction (mathematics)Gaussian integerGreatest common divisorHSL and HSVHurwitz quaternionIdeal (ring theory)IntegerInteger square rootKaratsuba algorithmMathematics of cyclic redundancy checksModular arithmeticModulo operationMontgomery modular multiplicationNatural number
Link from a Wikipage to another Wikipage
differentFrom
primaryTopic
Euclidean division
In arithmetic, Euclidean division – or division with remainder – is the process of dividing one integer (the dividend) by another (the divisor), in a way that produces a quotient and a remainder smaller than the divisor. A fundamental property is that the quotient and the remainder exist and are unique, under some conditions. Because of this uniqueness, Euclidean division is often considered without referring to any method of computation, and without explicitly computing the quotient and the remainder. The methods of computation are called integer division algorithms, the best known of which being long division.
has abstract
Aritmetikan, Zatiketa Euklidea ...... en duen eragiketaren izena da.
@eu
En matemáticas, y más precisam ...... onado con el dominio euclídeo.
@es
En mathématiques, et plus préc ...... comme l'anneau des polynômes.
@fr
Geheeltallige deling of deling ...... rden als: Daarmee volgt voor :
@nl
In arithmetic, Euclidean divis ...... hematics and computer science.
@en
La divisione euclidea o divisi ...... ero) strettamente minore di b.
@it
La divisió euclidiana o divisi ...... congruències sobre els enters.
@ca
Na aritmética, a divisão eucli ...... ática e ciência da computação.
@pt
Деление c остатком — арифметич ...... ример, для многочленов), см. .
@ru
Ділення з остачею (ділення за ...... м якої є два числа: та остача.
@uk
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,004,936,650
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
Aritmetikan, Zatiketa Euklidea ...... odularra baita erabiliak dira.
@eu
En matemáticas, y más precisam ...... cociente y un residuo únicos.
@es
En mathématiques, et plus préc ...... s congruences sur les entiers.
@fr
Geheeltallige deling of deling ...... rden als: Daarmee volgt voor :
@nl
In arithmetic, Euclidean divis ...... of which being long division.
@en
La divisione euclidea o divisi ...... valore assoluto del divisore.
@it
La divisió euclidiana o divisi ...... congruències sobre els enters.
@ca
Na aritmética, a divisão eucli ...... ndo o mais conhecido deles a .
@pt
Деление c остатком — арифметич ...... ример, для многочленов), см. .
@ru
Ділення з остачею (ділення за ...... м якої є два числа: та остача.
@uk
label
Division euclidienne
@fr
Division mit Rest
@de
Divisione euclidea
@it
Divisió euclidiana
@ca
División euclídea
@es
Divisão euclidiana
@pt
Euclidean division
@en
Geheeltallige deling
@nl
Heltalsdivision med rest
@sv
Twierdzenie o dzieleniu z resztą
@pl