Abstract
The theorems of Bachet–Bézout and Gauss are the cornerstones of elementary methods in number theory. Many applications of these results are studied, in particular Diophantine problems. The section Further Developments investigates the number of integer solutions of certain linear Diophantine equations, i.e. the number of certain restricted partitions of an integer.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We could also use Fermat’s little theorem. See Theorem 3.15.
- 2.
When k=1, this obviously means \(\mathcal{A}_{1}= \{ 1\}\).
- 3.
See Exercise 11 for another proof of this identity.
- 4.
One can make use of Pick’s formula which states that the number \(\mathcal{N}_{\mathrm{int}}\) inside a convex integer polygon \(\mathcal{P}\) is given by
$$\mathcal{N}_{\mathrm{int}} = \mathrm{area} ( \mathcal{P} ) - \frac {\mathcal{N}_{\partial\mathcal{P}}}{2} + 1 $$where \(\mathcal{N}_{\partial\mathcal{P}}\) is the number of integer points on the edges of the polygon.
References
Beck M, Robins S (2004) A formula related to the Frobenius problem in 2 dimensions. In: Chudnovsky D, Chudnovsky G, Nathanson M (eds) Number theory. New York seminar 2003. Springer, Berlin, pp 17–23
Beck M, Zacks S (2004) Refined upper bounds for the linear Diophantine problem of Frobenius. Adv Appl Math 32:454–467
Gould HW (1972) Combinatorial identities. A standardized set of tables listing 500 binomial coefficients summations. Morgantown, West Virginia
Odlyzko AM (1995) Asymptotic enumeration methods. Elsevier, Amsterdam
Popoviciu T (1953) Asupra unei probleme de patitie a numerelor. Stud Cercet Stiint—Acad RP Rom, Fil Cluj 4:7–58
Shiu P (2006) Moment sums associated with linear binary forms. Am Math Mon 113:545–550
Tripathi A (2000) The number of solutions to ax+by=n. Fibonacci Q 38:290–293
Wilf HS (1990) Generatingfunctionology. Academic Press, New York
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London
About this chapter
Cite this chapter
Bordellès, O. (2012). Bézout and Gauss. In: Arithmetic Tales. Universitext. Springer, London. https://doi.org/10.1007/978-1-4471-4096-2_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4096-2_2
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4095-5
Online ISBN: 978-1-4471-4096-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)