The multiplication principle (MP) is foundational for combinatorial problem-solving. From a units-coordination perspective, applying the MP with justification entails establishing unit relationships between the number of options at each independent stage of a counting process and the total number of combinatorial outcomes. Existing research…

The multiplication principle serves as a cornerstone in enumerative combinatorics. The principle underpins many basic counting formulas and provides students with a critical element of combinatorial justification. Given its importance, the way in which it is presented in textbooks is surprisingly varied. In this paper, we analyze a number of…

To further understand student thinking in the context of combinatorial enumeration, we examine student work on a problem involving set partitions. In this context, we note some key features of the multiplication principle that were often not attended to by students. We also share a productive way of thinking that emerged for several students who…

The multiplication principle is a fundamental principle in enumerative combinatorics. It underpins many of the counting formulas students learn, and it provides much-needed justification for why counting works as it does. However, given its importance, the way in which it is presented in textbooks is surprisingly varied. In this paper, we document…

This study aims to explain the thinking process of students in solving combination problems considered from assimilation and accommodation frameworks. This research used a case study approach by classifying students into three categories of capabilities namely high, medium and low capabilities. From each of the ability categories, one student was…

Counting problems have applications in probability and computer science, and they provide rich contexts for problem solving. Such problems are accessible to students, but subtleties can arise that make them surprisingly difficult to solve. In this paper, students' work on the Groups of Students problem is presented, and an important issue related…

This study examines how collective activity related to multiplication evolved over several class sessions in an elementary mathematics content course that was designed to foster prospective elementary teachers' number-sense development. We document how the class drew on as-if-shared ideas to make sense of multidigit multiplication in terms of…

A branch of mathematics commonly used in cryptography is Galois Fields GF(p[superscript n]). Two basic operations performed in GF(p[superscript n]) are the addition and the multiplication. While the addition is generally easy to compute, the multiplication requires a special treatment. A well-known method to compute the multiplication is based on…

Multiplication facts are difficult to teach. Therefore many researchers have put a great deal of effort into finding multiplication strategies. Sherin and Fuson (2005) provided a good survey paper on the multiplication strategies research area. Kolpas (2002), Rendtorff (1908), Dabell (2001), Musser (1966) and Markarian (2009) proposed the finger…

The objective of this introduction to Colombeau algebras of generalized functions (in which distributions can be freely multiplied) is to explain in elementary terms the essential concepts necessary for their application to basic nonlinear problems in classical physics. Examples are given in hydrodynamics and electrodynamics. The problem of the…

In this note, using the method of undetermined coefficients, we obtain the power series for exp ( f ( x )) and ln ( f ( x )) by means of a simple recursion. As applications, we show how those power series can be used to reproduce and improve some well-known results in analysis. These results may be used as enrichment material in an advanced…

Described is an approach to computational matrix algebra that takes advantage of a high quality, low cost microcomputer software package. The examples and applications discussed focus on matrix multiplication. (Author/CW)