Binary GCD algorithm
Algorithm that computes the greatest common divisor of two integers using only arithmetic shifts, comparisons, and subtraction
The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor (GCD) of two nonnegative integers. Stein's algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic shifts, comparisons, and subtraction.
Nº Q622328 ★
Comum · Saberes
Binary GCD algorithm
Algorithm that computes the greatest common divisor of two integers using only arithmetic shifts, comparisons, and subtraction
The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor (GCD) of two nonnegative integers. Stein's algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic shifts, comparisons, and subtraction.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor (GCD) of two nonnegative integers. Stein's algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic shifts, comparisons, and subtraction. Although the algorithm in its contemporary form was first published by the physicist and programmer Josef Stein in 1967, it was known by the 2nd century BCE, in ancient China.
Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Cmglee (CC BY-SA 3.0) ·
Cartas próximas
-
B
Baby-step giant-step
Algorithm for solving the discrete logarithm problem
Nº Q797983 ★
Sem ofertas
-
Ghost leg
Method of random selection
Nº Q1184644 ★★★
Sem ofertas
-
Geoffrey Hinton
Cientista de computação de Reino Unido
Nº Q92894 ★★★★
Sem ofertas
-
Método da bisseção
O método de encontrar uma raiz em matemática, baseado na divisão repetida de um segmento ao meio e na subsequente seleção de um subintervalo no qual a raiz deve ser encontrada.
Nº Q866300 ★★★
Sem ofertas
-
C
Cox–Zucker machine
Algorithm in algebraic geometry
Nº Q228693 ★★
Sem ofertas
-
Distância euclidiana
Distância convencional na matemática e na física
Nº Q847073 ★★★
Sem ofertas
-
Z
Zsigmondy's theorem
On primes dividing the difference of nth powers of coprime integers, but not powers < n
Nº Q8074796 ★
Sem ofertas
-
Cortes de Dedekind
Nº Q851333 ★★
Sem ofertas
-
D
Double counting (proof technique)
Technique for proving that two expressions are equal by showing that they both count the size of the same set
Nº Q1191750 ★
Sem ofertas
-
Angle bisector theorem
Two segments that divide a triangle
Nº Q925854 ★★
Sem ofertas
-
Ham sandwich theorem
Theorem that any three objects in space can be simultaneously bisected by a plane
Nº Q730222 ★★
Sem ofertas
-
W
Witten conjecture
Conjecture in algebraic geometry
Nº Q8028565 ★
Sem ofertas
-
V
Validated numerics
Numerics including mathematically strict error evaluation
Nº Q63307393 ★
Sem ofertas
-
d
divisor
Eneralization of codimension-1 subvarieties of algebraic varieties
Nº Q909669 ★
Sem ofertas
-
JPEG
Nº Q2195 ★★★
Sem ofertas
-
J
James–Stein estimator
Biased estimator for Gaussian random vectors, better than ordinary least-squared-error minimization
Nº Q6146297 ★
Sem ofertas
-
A
Algoritmo probabilístico
Nº Q583461 ★
Sem ofertas
-
A
Algoritmo do elevador
Nº Q988829 ★
Sem ofertas