by Michael Avidon, Richard Mabry and Paul Sisson
This article originally appeared in:
Mathematics Magazine
April, 2001
Subject classification(s):
Discrete Mathematics | CombinatoricsApplicable Course(s):
2.7 Finite Math | 3.7 Discrete Math | 4.4 CombinatoricsIn how many ways can a pet photographer pose \(C\) cats, \(D\) dogs, and \(E\) emus? The problem, often called Smirnov`s problem, has several practical applications and has been solved in a variety of ways. The authors present a solution which, unlike previous solutions, is entirely elementary and accessible to students in a first course in combinatorics.
A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.
To open this file please click here.