Search results
Jump to navigation
Jump to search
Page title matches
- In [[mathematics]], the '''Euclidean algorithm''', or '''Euclid's algorithm''', named after the ancient Greek geometer and7 KB (962 words) - 12:05, 3 May 2016
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 14:37, 8 August 2007
- 12 bytes (1 word) - 11:47, 26 September 2007
- 101 bytes (13 words) - 15:31, 20 May 2008
- Auto-populated based on [[Special:WhatLinksHere/Euclidean algorithm]]. Needs checking by a human.618 bytes (80 words) - 16:24, 11 January 2010
Page text matches
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 15:00, 8 August 2007
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 18:44, 6 May 2007
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 14:37, 8 August 2007
- {{r|Euclidean algorithm}}927 bytes (119 words) - 16:24, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Euclidean algorithm]]. Needs checking by a human.618 bytes (80 words) - 16:24, 11 January 2010
- {{r|Euclidean algorithm}}209 bytes (27 words) - 05:38, 3 July 2009
- {{r|Euclidean algorithm}}147 bytes (16 words) - 07:52, 29 June 2009
- *The [[Euclidean algorithm]], known from number theory.2 KB (286 words) - 07:49, 10 February 2021
- ...x_2+\cdots+a_nx_n=b</math>, which may be solved by means of the extended [[Euclidean algorithm]].542 bytes (82 words) - 19:39, 7 April 2009
- {{r|Euclidean algorithm}}350 bytes (42 words) - 12:01, 12 June 2009
- {{r|Euclidean algorithm}}888 bytes (123 words) - 17:03, 13 July 2008
- ...sts but does not help us to find it. We can do this by appealing to the [[Euclidean algorithm]]. If <math>n_1</math> and <math>n_2</math> are coprime, then there exist and these can be computed by the [[extended Euclidean algorithm]].3 KB (535 words) - 15:02, 22 November 2008
- Fortunately, the [[Euclidean algorithm]] provides an efficient means to calculate the greatest common divisor. i.e., in rings for which there is an analogue to the Euclidean algorithm,5 KB (797 words) - 04:57, 21 April 2010
- {{r|Euclidean algorithm}}2 KB (247 words) - 17:28, 11 January 2010
- In [[mathematics]], the '''Euclidean algorithm''', or '''Euclid's algorithm''', named after the ancient Greek geometer and7 KB (962 words) - 12:05, 3 May 2016
- {{r|Euclidean algorithm}}2 KB (262 words) - 19:07, 11 January 2010
- ...time. One can find the smallest common multiple of two numbers by using [[Euclidean algorithm|Euclid's algorithm]] for finding their [[greatest common divisor]] (gcd), a6 KB (743 words) - 18:42, 2 July 2009
- '''Proof:''' Because ''p'' and ''q'' are relatively prime, the [[Euclidean Algorithm]] tells us that2 KB (322 words) - 12:51, 18 December 2007
- ...knows e and can calculate its inverse mod T using the efficient [[Extended Euclidean algorithm]]. That gives him d and he already has N, so now he knows the private key (7 KB (1,171 words) - 05:48, 8 April 2024
- first determine the [[greatest common divisor]] (using the [[Euclidean algorithm]]) and then use4 KB (614 words) - 05:43, 23 April 2010