Jump to content

Information for "Binary GCD algorithm"

Basic information

Display titleBinary GCD algorithm
Default sort keyBinary Gcd Algorithm
Page length (in bytes)17,344
Namespace ID0
Page ID985410
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of page watchers50
Number of page watchers who visited in the last 30 days4
Number of redirects to this page6
Counted as a content pageYes
Wikidata item IDQ622328
Local descriptionAlgorithm for computing the greatest common divisor
Central descriptionalgorithm that computes the greatest common divisor of two integers using only arithmetic shifts, comparisons, and subtraction
Page imageBinary GCD algorithm visualisation.svg
Page views in the past 30 days

Page protection

EditAllow all users (no expiry set)
MoveAllow all users (no expiry set)
View the protection log for this page.

Edit history

Page creatorDcoetzee (talk | contribs)
Date of page creation18:45, 14 September 2004
Latest editorFrap (talk | contribs)
Date of latest edit13:05, 28 January 2025
Total number of edits529
Recent number of edits (within past 30 days)0
Recent number of distinct authors0

Page properties

Hidden categories (4)

This page is a member of 4 hidden categories (help):

Transcluded templates (74)

Pages transcluded onto the current version of this page (help):

Wikidata entities used in this page

Lint errors

Duplicate IDs2
View detailed information on the lint errors.

External tools