NotesFAQContact Us
Search Tips
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ929289
Record Type: Journal
Publication Date: 2011
Pages: 6
Abstractor: As Provided
Reference Count: 4
ISSN: ISSN-0020-739X
Using Pinochle to Motivate the Restricted Combinations with Repetitions Problem
Gorman, Patrick S.; Kunkel, Jeffrey D.; Vasko, Francis J.
International Journal of Mathematical Education in Science and Technology, v42 n5 p679-684 2011
A standard example used in introductory combinatoric courses is to count the number of five-card poker hands possible from a straight deck of 52 distinct cards. A more interesting problem is to count the number of distinct hands possible from a Pinochle deck in which there are multiple, but obviously limited, copies of each type of card (two copies for single-deck, four for double deck). This problem is more interesting because our only concern is to count the number of distinguishable hands that can be dealt. In this note, under various scenarios, we will discuss two combinatoric techniques for counting these hands; namely, the inclusion-exclusion principle and generating functions. We will then show that these Pinochle examples motivate a general counting formula for what are called "regular" combinations by Riordan. Finally, we prove the correctness of this formula using generating functions.
Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site:
Publication Type: Journal Articles; Reports - Descriptive
Education Level: Higher Education
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A