Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-09T07:27:26.177Z Has data issue: false hasContentIssue false
  • English
  • Français

The extended Euclidean Algorithm made easy

Published online by Cambridge University Press:  14 March 2016

Paul Levrie  and
Rudi Penne
Paul Levrie
Affiliation:
Department of Computer Science, KU Leuven, B-3001 Heverlee, Belgium e-mail: [email protected]
Rudi Penne
Affiliation:
Department of Computer Science, KU Leuven, B-3001 Heverlee, Belgium e-mail: [email protected] of Antwerp, B-2660 Hoboken, Belgium
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Teaching Notes
Information
The Mathematical Gazette , Volume 100 , Issue 547 , March 2016 , pp. 147 - 149
Copyright
Copyright © Mathematical Association 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Rosen, K. H., Elementary number theory and its applications (4th edn.), Addison-Wesley Longman, Reading MA (2000).Google Scholar
2.Knuth, D., The art of computer programming, Volume 2: seminumerical algorithms (3rd edn), Addison-Wesley Longman, Boston MA (1998).Google Scholar