Counting

Melvin Hausner
Additional contact information
Melvin Hausner: New York University, Washington Square and University College

Chapter Chapter 2 in Elementary Probability Theory, 1995, pp 37-79 from Springer

Abstract: Abstract Many important problems in probability theory involve sets with a rather large number of elements. Therefore, to compute probabilities it is necessary to learn how to count efficiently. The reader already knows how to do this in many cases. If a room is 12 by 13 ft, and if a square tile is 1 by 1 ft, then it is not necessary to count, one by one, how many squares are needed to tile the room. The answer, of course, is 12 × 13 = 156 tiles. In this chapter we shall learn several short cuts of this type and apply them to probability problems.

Keywords: Sample Space; Binomial Coefficient; Grade Distribution; Binomial Theorem; Poker Player (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4615-1753-5_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461517535

DOI: 10.1007/978-1-4615-1753-5_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().