Search results
Jump to navigation
Jump to search
Page title matches
- The '''greatest common divisor''' (often abbreviated to '''gcd''', or '''g.c.d.''', ...rs, and since a divisor of a number cannot be larger than that number, the greatest common divisor of some numbers is a number between 1 and the smallest of the numbers inclu5 KB (797 words) - 04:57, 21 April 2010
- #REDIRECT[[greatest common divisor]]36 bytes (4 words) - 17:18, 14 May 2007
- 12 bytes (1 word) - 15:46, 26 September 2007
- 112 bytes (14 words) - 18:35, 26 June 2009
- The '''greatest common divisor''' of 60 and 72 is therefore 12. One writes "gcd(60, 72) = 12", or si The greatest common divisor is used in reducing fractions to lowest terms, thus:4 KB (570 words) - 18:05, 1 July 2009
- 147 bytes (16 words) - 07:52, 29 June 2009
Page text matches
- #REDIRECT[[greatest common divisor]]36 bytes (4 words) - 22:44, 13 June 2007
- #REDIRECT [[Greatest common divisor]]37 bytes (4 words) - 02:20, 30 October 2008
- #REDIRECT [[Greatest common divisor]]37 bytes (4 words) - 02:46, 24 December 2008
- #REDIRECT[[greatest common divisor]]36 bytes (4 words) - 17:18, 14 May 2007
- Algorithm for finding the greatest common divisor of two integers101 bytes (13 words) - 15:31, 20 May 2008
- The '''greatest common divisor''' (often abbreviated to '''gcd''', or '''g.c.d.''', ...rs, and since a divisor of a number cannot be larger than that number, the greatest common divisor of some numbers is a number between 1 and the smallest of the numbers inclu5 KB (797 words) - 04:57, 21 April 2010
- ...r of 1 are said to be [[relatively prime]]. Complementary to the notion of greatest common divisor is [[least common multiple]]. The least common multiple of <math>a</math> a4 KB (594 words) - 02:37, 16 May 2009
- {{r|greatest common divisor}}207 bytes (26 words) - 19:20, 23 June 2009
- : the [[greatest common divisor]] is the greatest lower bound (or infimum), and3 KB (515 words) - 21:49, 22 July 2009
- {{r|greatest common divisor}}209 bytes (27 words) - 05:38, 3 July 2009
- {{r|Greatest common divisor}}618 bytes (80 words) - 16:24, 11 January 2010
- The '''greatest common divisor''' of 60 and 72 is therefore 12. One writes "gcd(60, 72) = 12", or si The greatest common divisor is used in reducing fractions to lowest terms, thus:4 KB (570 words) - 18:05, 1 July 2009
- {{r|Greatest common divisor}}574 bytes (75 words) - 21:21, 11 January 2010
- if and only if their [[greatest common divisor]] is 1, i.e., if they are relatively prime. first determine the [[greatest common divisor]] (using the [[Euclidean algorithm]]) and then use4 KB (614 words) - 05:43, 23 April 2010
- ...allest common multiple of 63 and 77. Euclid's algorithm tells us that the greatest common divisor of 63 and 77 is 7. Then the least common multiple lcm(63, 77) is6 KB (743 words) - 18:42, 2 July 2009
- ...eter and number-theorist [[Euclid]], is an [[algorithm]] for finding the [[greatest common divisor]] (gcd) of two [[integer]]s. The algorithm does not require [[prime number7 KB (962 words) - 12:05, 3 May 2016
- ...For instance, it guarantees that any two positive whole numbers have a [[greatest common divisor]] (gcd) and a [[least common multiple]](lcm). In fact, knowing the prime f3 KB (479 words) - 12:12, 9 April 2008
- * <math>\gcd(a, b)\ </math> — the greatest common divisor of integers <math>\ a</math> and <math>\ b.</math>35 KB (5,836 words) - 08:40, 15 March 2021
- ...y ''b''. This is the basis for the [[Euclidean algorithm]] for computing [[greatest common divisor]]s.10 KB (1,566 words) - 08:34, 2 March 2024
- ...is not the case, then divide its numerator and its denominator by their [[greatest common divisor|gcd]]. For instance, <math> \scriptstyle \tfrac{4}{20} </math> is not in lo21 KB (3,089 words) - 10:08, 28 February 2024
- greatest common divisor of two numbers ([[Euclid's Elements]], Prop. VII.2) and a proof27 KB (4,383 words) - 08:05, 11 October 2011
- In particular, he gave an algorithm for computing the greatest common divisor of two numbers35 KB (5,526 words) - 11:29, 4 October 2013