An edition of Generalizing Euclid's algorithm, via the regular and Moebius knot trees, order-n arithmetics (1990)

Generalizing Euclid's algorithm, via the regular and Moebius knot trees, order-n arithmetics

by

Generalizing Euclid's algorithm, via the regu ...
A. G. Schaake, A. G. Schaake
Locate

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
Notes

Buy this book

Last edited by WorkBot
February 12, 2010 | History
Edit
An edition of Generalizing Euclid's algorithm, via the regular and Moebius knot trees, order-n arithmetics (1990)

Generalizing Euclid's algorithm, via the regular and Moebius knot trees, order-n arithmetics

by

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Waikato Polytechnic
Language
English
Pages
61

Buy this book

Subjects

Braid theory, Knot theory, Euclidean algorithm
Edition Availability
Cover of: Generalizing Euclid's algorithm, via the regular and Moebius knot trees, order-n arithmetics
Generalizing Euclid's algorithm, via the regular and Moebius knot trees, order-n arithmetics
1990, Waikato Polytechnic
in English

Add another edition?

Book Details

Edition Notes

Includes bibliographical references (p. 61).

Published in
[Waikato, N.Z
Series
Research report ;, no. 196, Research report (University of Waikato. Dept. of Mathematics and Statistics) ;, no. 196.

Classifications

Library of Congress
QA242 .S33 1990

The Physical Object

Pagination
61 p. :
Number of pages
61

ID Numbers

Open Library
OL830651M
LCCN
95104591

Source records

Scriblio MARC record
Library of Congress MARC record
Library of Congress MARC record

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
February 12, 2010 Edited by WorkBot add more information to works
December 10, 2009 Created by WorkBot add works page