Linear Diophantine Equations

J. J. P. Veerman ()
Additional contact information
J. J. P. Veerman: Portland State University

Chapter Chapter 3 in Numbers from all Angles, 2026, pp 39-55 from Springer

Abstract: Abstract A Diophantine equationDiophantine equation is a polynomial equation in two or more unknowns and for which we seek to know what its integer solutions are. The simplest linear Diophantine equation is $$r_1x+r_2y=c$$r1x+r2y=c where all letters signify integers. We use the Euclidean algorithm to give the general solution to this problem. Subsequently, we employ the same algorithm to prove the Chinese remainder theorem.

Date: 2026
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-3-032-10000-9_3

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

DOI: 10.1007/978-3-032-10000-9_3

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 ().