Abstract
In this chapter we shall use the results obtained in the preceding chapter to count solutions of certain linear and other congruences in s unknowns. By a solution of a congruence, with modulus r, we mean a solution (mod r), i.e., an ordered s-tuple of integers (x1,…, xs) that satisfies the congruence, with two s-tuples (x1,…, xs) and \( \langle x_1^{'},...,x_s^{'}\rangle \) that satisfy the congruence counted as the same solution if and only if xi ≡ x1′. (mod r) for i = 1,…, s.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
McCarthy, P.J. (1986). Counting Solutions of Congruences. In: Introduction to Arithmetical Functions. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8620-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8620-9_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96262-7
Online ISBN: 978-1-4613-8620-9
eBook Packages: Springer Book Archive