Abstract
For n given elements an arbitrary arrangement of all elements is called a permutation. If among the n elements there are p groups of the same elements, then one speaks about permutations with repetition. Let the number of elements in the i-th group be n i , where it is assumed that n 1+n 2+…+n p = n.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Luderer, B., Nollau, V., Vetters, K. (2009). Combinatorial Analysis. In: Mathematical Formulas for Economists. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04079-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-04079-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04095-5
Online ISBN: 978-3-642-04079-5
eBook Packages: Business and EconomicsEconomics and Finance (R0)