Abstract
Introduction This chapter deals with the structure of how prime numbers are put together (Prime Factorization) and the tools of number theory which include greatest common divisors (GCD), least common multiples (LCM). These tools provide the beginning of important theorems such as the Fundamental Theorem of Arithmetic and the Euclidean Algorithm and its byproduct. Problems which have only solutions in integers (Diophantine equations) are discussed. Application to combinatorics is also mentioned.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Burton, D.: Elementary Number Theory, 7th edn. McGraw Hill, New York (2009)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Millman, R.S., Shiue, P.J., Kahn, E.B. (2015). Greatest Common Divisors, Diophantine Equations, and Combinatorics. In: Problems and Proofs in Numbers and Algebra. Springer, Cham. https://doi.org/10.1007/978-3-319-14427-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-14427-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14426-9
Online ISBN: 978-3-319-14427-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)