Counting and Configurations pp 1-106 | Cite as

# Combinatorics

## Abstract

In this first chapter we will be concerned with problems that are part of *classical combinatorics* and are based on determining the number of configurations with given properties. The problems in this chapter mainly describe “practical” situations (such as the distribution of cards among different players), that is, the relevant variables are mathematically not sufficiently well formulated. As we begin with the solution of a problem it is therefore important to make sure we know which of the resulting configurations we consider distinct. (In the example of a card game it is normally irrelevant in which order a player is dealt his cards). Our main tool in formalizing these concrete situations will be the notion of an *ordered k-triple*, with which the reader will already be familiar. At this point we simply note that two *k*-tuples (*a* _{1}, *a* _{2},..., *a* _{ k }
) and (*b* _{1}, *b* _{2},..., *b* _{ k }
) are considered equal if and only if the equalities *a* _{l} = *b* _{1}, *a* _{2} = *b* _{2},..., *a* _{ k } = *b* _{ k } are satisfied.

## Keywords

Standard Concept Admissible Sequence Element Subset Identical Ball Identical Digit## Preview

Unable to display preview. Download preview PDF.