论文部分内容阅读
纵观2003年高考数学各套试卷,排列组合的“涂色问题”共出现了3题,考试后随着对高考试题研究的深入,这些试题出现了各种比较好的解法,但它们大都带有一定的技巧性,学生可能难以把握.笔者认为都可用捆绑法加以解决,解决如下:
Looking at the examination papers for the college entrance examination in 2003, three questions emerged in the “painting problem” of the permutations and combinations. After the exams, with the in-depth study of the high-test questions, various good solutions have appeared in these questions, but most of them have taken There are certain skills, students may be difficult to grasp. I believe that can be used to solve the bundle method to solve the following: