Peer reviewed
Direct linkERIC Number: EJ938155
Record Type: Journal
Publication Date: 2005-Nov
Pages: 7
Abstractor: As Provided
ISBN: N/A
ISSN: ISSN-0746-8342
EISSN: N/A
A Paper-and-Pencil gcd Algorithm for Gaussian Integers
Szabo, Sandor
College Mathematics Journal, v36 n5 p374-380 Nov 2005
As with natural numbers, a greatest common divisor of two Gaussian (complex) integers "a" and "b" is a Gaussian integer "d" that is a common divisor of both "a" and "b". This article explores an algorithm for such gcds that is easy to do by hand.
Descriptors: Number Concepts, Mathematics Instruction, College Mathematics, Mathematical Concepts, Teaching Methods, Problem Solving
Mathematical Association of America. 1529 Eighteenth Street NW, Washington, DC 20036. Tel: 800-741-9415; Tel: 202-387-5200; Fax: 202-387-1208; e-mail: maahq@maa.org; Web site: http://www.maa.org/pubs/cmj.html
Publication Type: Journal Articles; Reports - Evaluative
Education Level: Higher Education
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A
Grant or Contract Numbers: N/A
