Abstract
In order to rediscover some properties of probability that were inspired by counting, we need to pursue properties of the counting function itself. Let S be a finite set (sample space) with points sls2• • •,smwhen S has size m; the counting function
begins with #((si)) = 1;
#(A) is the number of elementssiin subset A.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nguyen, H.T., Rogers, G.S. (1989). The Counting Function for Finite Sets. In: Fundamentals of Mathematical Statistics. Springer Texts in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1013-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1013-9_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6984-7
Online ISBN: 978-1-4612-1013-9
eBook Packages: Springer Book Archive