Back to Search
Start Over
A paper-and-pencil gcd algorithm for Gaussian integers
- Source :
- The College Mathematics Journal. Nov, 2005, Vol. 36 Issue 5, 374-380
- Publication Year :
- 2005
-
Abstract
- A theory of divisibility, including greatest common divisors (gcd), which presents a new gcd algorithm for Gaussian integers suited to paper-and pencil computation is presented. This establishes that any two Gaussian integers have a greatest common divisor, and it is interesting to see that this result has an odd-even proof.
- Subjects :
- Gaussian processes -- Analysis
Division -- Analysis
Education
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 07468342
- Volume :
- 36
- Issue :
- 5
- Database :
- Gale General OneFile
- Journal :
- The College Mathematics Journal
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.143795353