Abstract
Solving combinatorial problems always requires knowledge of basic combinatorial configurations such as arrangements, permutations, and combinations. All of them are formed from the elements of the finite sets considered, for example, by taking sequences of the elements that belong to some sets or by taking subsets. In this chapter we shall define these combinatorial configurations and provide some examples and exercises.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Mladenović, P. (2019). Arrangements, Permutations, and Combinations. In: Combinatorics. Problem Books in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-00831-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-00831-4_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00830-7
Online ISBN: 978-3-030-00831-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)