What are some good books on permutations

Discrete Mathematics with Basics pp 205-229 | Cite as

  • Sebastian Iwanowski
  • Rainer Lang
Chapter
First Online:

Summary

Combinatorics deals in a broader sense with the theory of finite sets and, in a narrower sense, with the number of elements of finite sets with given properties. Typical questions in combinatorics are “In how many different ways can you get out of a \ (n \) - element set M.\ (\; k \) - select elementary subsets? "or" How many words with 5 letters can be formed from our alphabet? "

In school, questions like this are often examined under the heading of “calculating probability”. This is due to the fact that in the calculation of probability unions and intersections of “event sets” have to be formed, the power of which determines the probability. So if the quantities are finite, they have to be counted. For this reason one also finds the term "counting theory" for combinatorics.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Copyright information

© Springer Fachmedien Wiesbaden 2014

Authors and Affiliations

  1. 1. WedelWedel University of Applied Sciences, Germany
  2. 2. WedelWedel University of Applied Sciences, Germany