Modular Number Systems

Garret Sobczyk
Additional contact information
Garret Sobczyk: Universidad de Las Américas, Departamento de Física y Matemáticas

Chapter Chapter 1 in New Foundations in Mathematics, 2013, pp 1-21 from Springer

Abstract: Abstract We begin by exploring the algebraic properties of the modular numbers, sometimes known as clock arithmetic, and the modular polynomials. The modular numbers and modular polynomials are based upon the Euclidean algorithm, which is simply the idea of dividing one integer into another or one polynomial into another polynomial, which we first learned in secondary school.

Keywords: Rational Approximation; Standard Basis; Interpolation Polynomial; Multiplication Table; Great Common Divisor (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-8385-6_1

Ordering information: This item can be ordered from
http://www.springer.com/9780817683856

DOI: 10.1007/978-0-8176-8385-6_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().