Students' Verification Strategies for Combinatorial Problems

We focus on a major difficulty in solving combinatorial problems, namely, on the verification of a solution. Our study aimed at identifying undergraduate students' tendencies to verify their solutions, and the verification strategies that they employ when solving these problems. In addition, an attempt was made to evaluate the level of efficiency of the students' various verification strategies in terms of their contribution to reaching a correct solution. 14 undergraduate students, who had taken at least 1 course in combinatorics, participated in the study. None of the students had prior direct learning experience with combinatorial verification strategies. Data were collected through interviews with individual or pairs of participants as they solved, 1 by 1, 10 combinatorial problems. 5 types of verification strategies were identified, 2 of which were more frequent and more helpful than others. Students' verifications proved most efficient in terms of reaching a correct solution when they were informed that their solution was incorrect. Implications for teaching and learning combinatorics are discussed.