Display title | Greatest common divisor |
Default sort key | Greatest common divisor |
Page length (in bytes) | 201,314 |
Namespace ID | 0 |
Page ID | 790 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 3 |
Counted as a content page | Yes |
Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
Page views in the past month | 104 |
Page image |  |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Page creator | rosettacode>NevilleDNZ |
Date of page creation | 12:07, 17 December 2007 |
Latest editor | INGY (talk | contribs) |
Date of latest edit | 22:20, 27 February 2025 |
Total number of edits | 678 |
Recent number of edits (within past 180 days) | 10 |
Recent number of distinct authors | 4 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | Task Find the greatest common divisor (GCD) of two integers. Greatest common divisor is also known as greatest common factor (gcf) and greatest common... |