A common strategy among Discrete Mathematics textbooks is to attempt to classify counting problems neatly according to various types in the hopes of giving students some clear guidelines and procedures (Brualdi, 2004; Johnsonbaugh, 2009; Rosen, 2007). This way of classification is also reflected in the research literature (Fischbein & Gazit 1988; Batanero et al. 1992). In counting arrangements of objects, for example, one can distinguish problems according to whether repetition of objects is allowed and whether the order that those objects are placed in makes a difference to the arrangement. This results in four general types of counting problems. Provided that students are studying problems that rightly belong in one and only one of these four categories, there does not appear to be anything extraordinarily unusual about what the student must do to successfully learn the material. Figure 1 shows the number of arrangements of n objects in each of the four traditional cases