Elementary Arithmetics

Maurice Mignotte
Additional contact information
Maurice Mignotte: Université Louis Pasteur, Départment de Mathématique

Chapter Chapter 1 in Mathematics for Computer Algebra, 1992, pp 1-52 from Springer

Abstract: Abstract This chapter deals with the representation of rational integers and describes the basic algorithms of arithmetics (addition, multiplication, division,...). The study of theses examples introduces the fundamental notion of the cost of an algorithm

Keywords: Positive Integer; Prime Number; Hermite Form; Elementary Operation; Chinese Remainder Theorem (search for similar items in EconPapers)
Date: 1992
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-1-4613-9171-5_1

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

DOI: 10.1007/978-1-4613-9171-5_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 ().