Abstract
This article presents a STEM-based instructional approach for teaching combinatorics to 95 s-year students (72 IT engineering and 23 engineering management students) at a Serbian university of applied sciences. Although students had prior exposure to combinatorics, many relied on memorized formulas without conceptual understanding. To address this issue, we implemented a collaborative, constructivist learning design in which students collaboratively constructed combinatorial formulas through role-play, multiple representations, and real-world problem scenarios rather than receiving them in finalized form. Activities were connected to applications in computer science, reinforcing interdisciplinary relevance. Classroom data were collected through structured field notes, analysis of students’ written solutions, and follow-up interviews when necessary. Qualitative analysis focused on students’ reasoning processes and conceptual development, complemented by statistical comparison of individual test results with a previous cohort taught through traditional lecture-based instruction. The experimental group achieved significantly higher performance. The findings indicate that interdisciplinary, constructivist learning environments can foster deeper conceptual understanding and improved application of combinatorial reasoning. The study contributes to mathematics education literature by illustrating how collaborative knowledge construction in STEM contexts supports the transition from experiential activity to formal symbolic generalization in tertiary combinatorics instruction.
1 Introduction
Combinatorics is a fundamental area of discrete mathematics with applications in science, engineering, and everyday problem-solving (). It is often introduced early in higher education due to its potential to develop reasoning, problem-solving skills, and flexible thinking. Counting problems are widely used as an entry point () because they are broadly accessible, foster rich reasoning, support productive mathematical habits, and provide a natural context for computational thinking. Even students with limited prior knowledge can engage meaningfully, and such problems promote deep mathematical thinking ().
However, research shows that students often struggle with combinatorial problems (; ; ), a pattern that persists at the university level (). Many rely on memorized formulas without understanding their application, as observed at Subotica Tech—College of Applied Sciences, where combinatorics is taught in the second-year Statistics course. Prior studies have largely focused on traditional instruction, with limited exploration of collaborative, STEM-based, and role-play interventions in higher mathematics education.
This study addresses these gaps by implementing a constructivist, collaborative approach in which students actively construct combinatorial formulas through role-play, real-world scenarios, and interdisciplinary tasks. The intervention aims to enhance conceptual understanding, problem-solving skills, and engagement, demonstrating effective pedagogical strategies for higher mathematics education.
2 Pedagogical framework
2.1 Constructivist foundations
Constructivism views learning as an active process in which learners build understanding rather than passively receive information. As (, p. 873) states, “Knowledge is constructed in the mind of the learner,” and von Glasersfeld (1995) similarly argues that the mind knows only what it has constructed. Learners connect new ideas with prior knowledge (), while knowledge remains both personal and socially mediated (). It develops through cycles of comparing experiences with expectations and adjusting mental models (Taber, 2011). Teachers, therefore, create conditions that stimulate inquiry and dialogue (), focusing on application rather than rote recall. Social interaction plays a central role: small-group collaboration and peer negotiation foster deeper understanding and prepare students for real-world problem solving ().
2.2 Collaborative learning principles
Collaborative learning extends constructivist principles by emphasizing shared responsibility. For this study, we adopt a composite definition from Takači et al. (2015), integrating perspectives from (, p. 486) and (, p. 22): “Collaborative learning is an instructional method in which students at various performance levels work together in small groups toward a common goal—that is, to solve a problem, complete a task, or create a product.”
Unlike individual constructivism, collaborative learning requires learners to support each other's progress, making group success interdependent (). Research confirms its benefits: higher academic achievement, positive attitudes, and greater persistence (Springer et al., 1999). Early exposure also fosters critical-thinking skills (). Socially, collaborative learning teaches students to respect differences and resolve conflicts constructively (). Thus, it represents a natural extension of constructivism, highlighting the social dimension of knowledge construction.
2.3 Multiple representations and role-play
Representations mediate between abstract concepts and learners’ cognitive processes. distinguished three modes—enactive, iconic, and symbolic—which often intertwine in mathematics learning. In combinatorics, students may begin with physical selections (enactive), progress to diagrams (iconic), and finally construct symbolic formulas. This progression scaffolds understanding and reflects the approach adopted in this study, where role-play and visual models supported the transition toward symbolic reasoning.
Research underscores the significance of representations. argued that mathematical knowledge cannot be mobilized without representational activity, while and Zazkis and Liljedahl (2004) emphasized their role in communication and conceptual understanding. Learners must develop fluency in translating between representational forms (; ), and teachers should integrate representations purposefully ().
Role-play complements this approach by embedding mathematical ideas in interactive scenarios. define role-play as a method where students assume roles and solve problems within given contexts, enhancing learning across cognitive, psychomotor, and affective domains (). Studies confirm its benefits for engagement and performance (; Svensson and Regnell, 2017). In mathematics, role-play fosters creativity and problem-solving () and has been applied successfully to combinatorics tasks involving permutations (). Combining role-play with multiple representations creates dynamic learning environments that promote deeper understanding and active participation.
2.4 STEM approach to learning
STEM education emphasizes integrating knowledge across disciplines to prepare students for real-world challenges. describe STEM as an interdisciplinary approach that connects academic concepts with authentic problems, enabling students to apply science, technology, engineering, and mathematics in meaningful contexts. This approach aims to develop critical thinking, creativity, communication, collaboration, and other 21st-century skills . highlights STEM's distinction from traditional models: it focuses on everyday life and real problems, ensuring integrated formation of scientific and practical knowledge through authentic experiences. This design supports lifelong learning and professional competencies. To achieve these goals, teachers must create activities that integrate content, provide authentic contexts, and encourage collaborative problem solving.
3 Learning environment
3.1 Setting and participants
The study was conducted at Subotica Tech—College of Applied Sciences, Subotica, Serbia, during the second semester of the 2024/25 academic year in the Statistics course. Ninety-five second-year engineering students participated voluntarily, including 72 future IT engineers and 23 future engineering managers. At the beginning of the semester, several students reported difficulty applying combinatorial formulas, often relying on memorization without conceptual understanding.
To address this, a constructivist, collaborative, STEM-based instructional design was implemented. Students were assigned to 23 heterogeneous groups of four and one group of three, based on prior performance in Mathematics 2 (maximum score: 100), following Takači et al. (2015). Each group included at least one IT engineer and one engineering management student to ensure interdisciplinary collaboration. Learning took place over three weeks, with four lessons per week, in two large classrooms.
3.2 Research question
The primary research question guiding this case study was:
How does a collaborative, constructivist, STEM-based instructional approach incorporating role-play and real-world applications influence second-year engineering students’ conceptual understanding of combinatorics, particularly in constructing and applying formulas for permutations and combinations, as well as their achievement and attitudes?
3.3 Learning objectives
The instructional intervention was designed to support the following learning objectives, which also guided the selection of data collection instruments and analysis procedures:
Conceptual understanding of permutations without repetition, permutations with repetition, and combinations without repetition, including the ability to derive rather than memorize formulas.
Representational fluency, defined as the ability to transition among enactive (manipulatives and role-play), iconic (tree diagrams and visual models), and symbolic (generalized formulas) representations.
Transfer to authentic STEM contexts, emphasizing the application of counting principles to programming and engineering-related problem situations.
Collaborative competencies, including explanation, negotiation of meaning, and shared responsibility in structured group problem solving.
3.4 Permutations without repetition: From decision trees to tree diagrams
The sequence of activities was designed to build on students’ prior knowledge from programming, algorithms, and business decision-making. The interdisciplinary integration explicitly connects students’ prior knowledge from computer science and management studies with combinatorial reasoning. Algorithmic thinking and decision-tree structures served as cognitive bridges, enabling students to transfer structured branching logic into mathematical counting processes.
In Task 1 and Task 2, we first revisited decision trees—which many students had encountered in algorithm design and management courses, and progressively transitioned to combinatorial tree diagrams.
Task 1
Write an algorithm that determines the type of a given integer n. If
nis negative, print “Negative number”, if
nis zero, print “Zero”, if
nis positive, print “Positive even number”, if
nis even, if
nis odd, print “Positive odd number”. Draw a decision tree that represents this decision process. Based on the decision tree, determine the type of the following numbers: −5, 0, 12, 7.
All student groups consisting of four members approached the task of creating the required algorithm with great seriousness, and every group produced a correct solution. Figure 1 presents the four principal solution patterns. For publication clarity, Figure 1 was digitally redrawn from the students’ original hand-drawn diagrams and translated from Hungarian into English, preserving the original solution logic.
Figure 1
Decision trees are commonly used in management to illustrate decision-making processes in complex scenarios. Since students in the engineering management program explore such processes in their Business Decision-Making course, we introduced the following task.
Task 2
A company is planning a team-building lunch for 80 employees and is considering three restaurant options that offer different rental prices and menu choices. Restaurant 1: highest rental price, but lowest food prices (both menu and buffet). Restaurant 2: medium rental price, with medium food prices. Restaurant 3: lowest rental price, but highest food prices (both menu and buffet). In each restaurant, there are two catering options: menu and buffet (more expensive than the menu in the same restaurant). The restaurant options are given in
Table 1.
Table 1
| Restaurant | Room rental (rsd) | Menu (rsd/person) | Buffet (rsd/person) |
|---|---|---|---|
| Restaurant 1 | 24,000 | 2,400 | 2,880 |
| Restaurant 2 | 48,000 | 2,160 | 2,640 |
| Restaurant 3 | 72,000 | 1,920 | 2,400 |
Room rental and catering costs.
It took a little more time for the groups to complete this task, as most participants had not previously taken this course. In this group work, management students took the leading role. In most solutions, the decision trees were drawn horizontally. The following day, we inquired about this and learned that horizontal representations were also used in the Business decision making classes. Figure 2 was digitally redrawn from the students’ original hand-drawn diagram and translated into English while preserving the original decision structure.
Figure 2
The aim of the next task was to provide a gradual transition from using a decision tree, familiar from other subjects, to a tree diagram, which is used in combinatorics to represent and count all possible arrangements.
Students of electrical engineering built a board where three diodes light up depending on the series connection of three different resistors. In connection with this, the following task was given:
Task 3
Three different resistors are to be connected in series (each resistor corresponds to one diode: red—1 kΩ, yellow—3 kΩ, green—4.7 kΩ).
- (a)
Draw a decision tree showing all possible choices of resistors when connecting three different resistors, each marked with a different color (red, yellow, and green).
- (b)
Determine how many different ways the three resistors can be connected in series, that is, how many different diode sequences there are (each resistor corresponds to one diode).
- (c)
List all possible orders of connecting the three resistors, i.e., all possible orders of lighting the diodes.
- (d)
Based on your decision tree, determine how many possible orders of connecting the three resistors there are (and, consequently, how many possible orders of lighting diodes).
- (e)
What does each path in the tree represent?
- (f)
In this task, did we actually make any decisions, as we did in the management task?
- (g)
What kind of information does the result of this task give us?
These additional questions were designed to guide students toward recognizing the conceptual shift from decision trees to combinatorial tree diagrams. Specifically, question d) leads them to use the structure of the tree to determine the number of possibilities, e) helps them verbalize the meaning of each path as one possible arrangement, f) draws attention to the difference in the purpose of the diagram—here no decision is being made—and g) encourages reflection on the informational and combinatorial nature of the representation.
All student groups successfully completed the task. For part d), all groups except two gave the answer 6. One of the remaining two groups wrote the solution as 6 = 2 + 2 + 2, while the other wrote 3 × 2 = 6. All answers for part e) were similar to the following: “One possible way to connect resistors.” and for part f), all groups answered that there was no decision made. Five groups submitted the following response for part g): “We obtained information about the possible orders of connecting the three resistors.” In the remaining solutions, students also explicitly indicated the total number of possible orders.
To reinforce the newly understood concept, students were next given a task with four different elements. Students were encouraged to simplify their representations. Since the questions at each node were the same as in the previous exercise (“Which element can be chosen next?”), they were told to remove them and focus only on the choices themselves. This modification helped students recognize that, in combinatorics, the tree diagram does not serve to make decisions but to represent all possible sequences of selections.
Task 4
Four humanoid robots, labeled A, B, C, and D, are waiting in line to perform a demonstration.
- (a)
Draw a tree diagram showing all possible orders in which the robots can appear, as you did in the previous task, but omit the questions.
- (b)
Explain why the questions are no longer necessary.
- (c)
What do the nodes and branches represent in this diagram?
- (d)
At each new node in the tree, how many choices remain compared to the previous one?
- (e)
How many possible orders (arrangements) of robots are there?
- (f)
How can this number be determined using the structure of the tree?
- (g)
What does each path in the tree represent?
- (h)
If we had n robots instead of four, how could we generalize the result?
Within a role-play, students acted out the robots by standing in a line and swapping positions, which helped them visualize the sequences. All groups submitted their tree diagrams and answered all the questions. An interesting point is the responses to sub-question d): “For the first position we can choose one of the 4 robots, so we multiply by 4; for each chosen robot (4 in total) we can then choose one of the remaining 3, and finally one of the remaining 2.” This demonstrates that students correctly understood the decreasing number of choices at each stage and how it leads to the total number of arrangements.
Building on their hands-on experience with the four robots, students were able to generalize the concept. They observed that at each successive position in the line, the number of available choices decreases by one: 4 choices for the first position, 3 for the second, 2 for the third, and 1 for the last. This pattern corresponds exactly to the structure of the tree diagram, where each path in the diagram represents a unique sequence of arrangements.
From their observations, the students were able to derive a general formula for arranging n different elements in a sequence and answer sub-question (f) in the following way:The tree diagram provides a visual justification for this multiplication: the number of branches at each level corresponds to the number of remaining choices, and multiplying them together gives the total number of possible sequences. This illustrates how the combinatorial purpose of the tree diagram differs from the decision-making function of a decision tree while using the same underlying tree structure.
3.5 Permutations with repetition
After students mastered permutations without repetition, we introduced permutations with repetition through the following way.
Two days before classes, the future IT engineers had to write a Python program that generates all permutations of the set {A
1,A
2,A
3,B,C} and arrange the permutations into groups of six, such that in each group the elements of A are fixed at specific positions, regardless of their original indices. During subsequent lessons, students could use the Python program they had developed to solve Task 5.
Task 5
- (a)
How many different five-element sequences can be written using the elements {A1, A2, A3, B, C}?
- (b)
How many different five-element sequences can be written using the elements {A, A, A, B, C}? Consider part a) if A1 = A2 = A3 = A.
- (a)
Based on the Python program's output, the students realized that the output was grouped in sets of six because A
1, A
2, and A
3can be rearranged among the given positions in 3! ways. After completing two similar tasks, students were able to generalize and derived the following formula for permutations with repetition of
nelements:
where
are numbers of identical elements in
lgroups.
3.6 Combinations without repetition
After exploring how repeated elements affect the number of arrangements in permutations, we turn to combinations without repetition, where the focus shifts from ordering to selecting subsets.
Students were asked to merge into groups of eight members, to perform the role-play described below several times, and to solve the combinatorial problem that followed the description.
Task 6
Five employees {A, B, C, D, E} work with clients in the reception room of a company that develops mechatronic solutions for smart homes. The five employees were seated in a row to receive clients. The clients can be divided into two main groups: new clients, who have not yet had the system installed and are seeking information about technical possibilities, installation deadlines, pricing, and potential customization of the system, and existing clients, who already had the system installed and required technical support. Each day, their manager (M) decides which two of the five employees will meet with new clients and which three will work with existing clients. Once the decision is made, the manager's secretary (S) places in front of each of the five employees either a yellow card labeled NEW CLIENTS or a green card labeled SUPPORT FOR INSTALLED SYSTEMS. The secretary keeps a written note about the division of work among the five employees, after which a client enters the reception room.
- (a)
Write the secretary's notes below. (Here was a space left for writing)
- (b)
In how many different ways can the manager determine which two of the five employees will work with new clients, and which three will work on support for installed systems today? (Here was a space left for writing) Explain your solution. (Here was a space left for writing)
The design of this task encourages students to see a bijection between the set of all valid daily assignments of two employees to new-client work and three to support work, and the set of all sequences of five cards in which exactly two are yellow (NEW CLIENTS), and three are green (SUPPORT). Knowing that these two sets are in bijection, the students can invoke their earlier knowledge about the number of sequences with repeated elements to compute the answer.
Although the primary purpose of this task was to pave the way toward the formula for combinations without repetition by means of permutations with repeated elements, it also offered students the opportunity to encounter an example of a bijective argument. In many counting problems in combinatorics, the goal is to determine the cardinality of a certain set. Instead of counting this set directly, it is often more convenient to formulate another problem, whose solution amounts to determining the cardinality of a different set. By establishing a bijection between the two sets, one shows that they have the same cardinality. This approach—referred to as a bijective proof—has been widely discussed in the combinatorics literature (for example, Stanley, 2009).”
Students divided roles among themselves. During the activity, they enacted the role-play: the employees took their seats in the reception room, the manager determined the assignments, the secretary placed the corresponding cards, and documented which employees worked with new clients and which with clients requiring support for their installed systems. In this way, one representative solution out of the ten structurally equivalent possibilities was recorded.
Upon analyzing the students’ notes and their solutions to Task 6, it became evident that nine groups (out of twelve) obtained a result corresponding to the number of permutations with repetition of five elements, indicating that they had successfully reached the intended conclusion. After performing several concrete divisions of work and making written notes, they wrote the solution to the problem, as shown in Table 2. Table 2 is a typeset reconstruction of the students’ original table. In the classroom, students marked the two job types with the initials of the Serbian color names—Z (zeleno, green) and Ž (žuto, yellow)—whereas Table 2 uses the English initials G (green) and Y (yellow) for clarity and consistency in the manuscript. They also calculated how many different ways the manager can select two of the five employees to work with new clients, and wrote the following formula:
Table 2
| A | B | C | D | E |
|---|---|---|---|---|
| Y | G | G | Y | G |
| G | G | G | Y | Y |
| G | Y | Y | G | G |
| G | G | Y | G | G |
| Y | Y | G | G | G |
Students’ solution: weekly job-type schedule.
Below is a typical explanation quoted in support of the given solution.
“Each division of work can be seen on cards that are on the desks of five employees, and there are 10 arrangements of the cards.”
The remaining three groups of students wrote out all ten possible assignments of work but did not notice the connection between this task and permutations with repetition.
The solutions of the first group are shown in Table 3 redrawn from the students’ table and translated into English. Group 1 originally marked the job types with the Serbian words “nov” (new) and “podrška” (support).
Table 3
| Employees | Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|---|
| A | New | Support | Support | Support | New |
| B | Support | New | Support | Support | Support |
| C | New | New | Support | New | Support |
| D | Support | Support | New | New | Support |
| E | Support | Support | New | Support | New |
Group 1 weekly assignment table.
The students in each of these groups were interviewed the following day.
For the group whose solution is presented in Table 3, the teacher encouraged them to observe, for each possible work assignment, the corresponding sequence of words (listed top to bottom):
Teacher: “For each division of work, if we look only at the words next to the names of employees, what can we say about them?”
Student V: “There are two different words because there are two types of jobs.”
Student A: “In every case, there are three words: ‘new’ and two ’support’.”
Teacher: “If, for each division of work, we consider the corresponding sequence of words (from top to bottom), can we calculate how many such sequences can be written?”
Student B: “There are 5! divided by 2! times 3!.”
Student N: “That is the number of possible divisions of work. We didn’t think of that.”
With the other two groups, the discussion unfolded in a similar way, and through it, they realized how the task could be solved using permutations with repetition.
In the next classes, the students were also asked to solve the following two combinatorial problems:
Task 7: In how many ways can four programmers and three testers be selected from a group of seven IT specialists?
Task 8: In a consulting firm, except for the director, seven managers are employed. Today, the director needs to form a dedicated team of four managers from the seven employees to work on the development of a financial strategy for a new project. In how many different ways can the director select these four managers from the seven available?
All groups, after a brief discussion, correctly solved Task 7 by reducing it to determining the number of distinct sequences of seven elements, four of which are identical and three of which are identical among themselves. During the discussion, students from two groups made four green and three yellow cards and arranged them in a sequences.
Students in one group drew a table similar to that in Table 3 and wrote radi (works) below the four letters (representing employees’ names) and ne radi (does not work) below the remaining three. They solved Task 8 quickly in the same way as Task 7.
The discussions in these groups lasted a bit longer than in the first task, and at one point, a student addressed the teacher, saying:
“The task says what four employees are doing, but it doesn’t say what the other three are doing.”
A response came from a student:
“They are not working on the financial project; they are doing something else.”
This comment was sufficient for the remaining groups to complete the task.
The next question required students to express the number three in the solution using the numbers seven and four. All groups quickly wrote the answer by representing 3 as 7–4.
Finally, the teacher summarized the discussion and formulated the general question:
In how many ways can k elements be chosen from a set of n elements? Students of all groups correctly wrote the formula, after which the teacher explained that it is denoted by and read as “n choose k.”
3.7 Data collection and analysis
Data were collected using multiple complementary methods to examine students’ conceptual understanding, achievement, and attitudes.
Observation notes were taken during each lesson, documenting group interactions, problem-solving strategies, and levels of engagement.
Students’ written solutions to in-class exercises and homework assignments were analysed to trace the construction and application of combinatorial formulas.
Classroom artefacts, including group-produced tree diagrams and role-play notes, were collected and coded using self-chosen group identifiers to preserve anonymity.
An anonymous post-intervention questionnaire included fixed-choice items on perceived understanding and engagement, as well as open-ended reflections.
Students completed an individual written test in week four (four problems on permutations and combinations). The same assessment tasks had been administered to the previous year's cohort taught via traditional lecture-based instruction. The test consisted of standard textbook-style combinatorics problems aligned with the instructional content.
Descriptive statistics (means and standard deviations) were computed for the written test. The two cohorts had comparable prior achievement levels based on overall course performance indicators. For comparison, the intervention cohort's results were contrasted with those of the previous cohort using a one-sided Welch's
t-test (95% confidence intervals), and the standardized mean difference (Hedges’ g) was reported to estimate the magnitude of differences.
Qualitative data (open-ended responses, written solutions, artefacts, and field notes) were analysed using directed content analysis guided by the study's pedagogical lenses:
Transitions between representational levels (from role-play to tree diagrams to symbolic generalization),
Collaborative reasoning processes, and
Evidence of transfer to STEM-related contexts.
This mixed-methods design enabled the examination of measurable learning outcomes alongside the pedagogical processes underlying students’ conceptual development.
4 Results
In this study, we distinguish between learning outcomes (conceptual understanding and procedural accuracy) and the development of structured problem-solving strategies. While test performance reflects mastery of combinatorial formulas, classroom artefacts document the evolution of students’ reasoning processes.
In the fourth week, students completed an individual written test consisting of four traditional combinatorics problems aligned with the instructional sequence. The average score for the current-year cohort was 82.4 points (SD = 9.2), compared to 74.1 points (SD = 10.0) for the previous-year cohort. An independent one-sided Welch's t-test confirmed a significant difference of 8.30 points, t(174.84) = 5.83, p = 1.29 × 10−8. The one-sided 95% confidence interval had a lower bound of 5.94 points. The standardized mean difference was Hedges’ g = 0.87, indicating a large effect.
Following the test, students completed an anonymous questionnaire. Most reported limited prior exposure to role-play or tree-based reasoning in mathematics classes. Nevertheless, 87% indicated that collaborative work and role-play supported their understanding of permutations and combinations, and 91% expressed interest in applying similar approaches in other topics. Open-ended responses emphasized the value of linking mathematical reasoning to programming and STEM-related contexts.
Directed content analysis of classroom dialogue, student artefacts, and questionnaire responses revealed a consistent representational progression. Tree diagrams made the decreasing number of available choices structurally visible in permutations without repetition. In programming-based tasks, students reconstructed permutations with repetition by reasoning about identical roles and overcounting.
This reasoning became pivotal in the transition to combinations. In the role-play task of selecting four managers from seven, students initially applied permutation logic but, through discussion, recognized that specifying four implicitly determined the remaining three (7−4). Across groups, students generalized the problem of choosing k elements from n and constructed the combination formula before formal notation was introduced.
Formulas were not provided in advance. Through coordinated role-play, diagrammatic representation, and structured task sequencing, students progressed from concrete enumeration to symbolic generalization.
The convergence of significant quantitative gains and consistent qualitative patterns indicates that the representationally rich, collaboratively structured design supported transfer from constructed understanding to formal individual problem solving.
5 Discussion
The findings provide converging quantitative and qualitative evidence that the instructional design supported students’ transition from concrete activity to formal combinatorial reasoning. The large effect size in cohort comparisons, together with consistent patterns in classroom discourse, artifacts, and post-task reflections, indicates that learning gains extended beyond procedural fluency to structural understanding.
The representational progression—enactive role-play, iconic tree diagrams, and symbolic generalization—aligns with constructivist principles emphasizing knowledge construction through activity and reflection. Students reconstructed permutation and combination formulas through coordinated representations and dialogue, rather than receiving them deductively, demonstrating structural abstraction from experiential engagement.
Collaborative processes played a central role. Students negotiated overcounting in permutations with repetition and shifted from arrangement-based to selection-based reasoning in combinations, illustrating how peer explanation, negotiation, and shared responsibility facilitated conceptual reorganization. These processes mirror principles of cooperative learning ().
Tree diagrams functioned not merely as visual aids but as structural tools, making combinatorial constraints explicit and scaffolding the coordination of counting processes with symbolic expressions. The visual representations (decision trees and combinatorial diagrams) functioned as transitional modeling tools. Although initially focused on concrete problem-solving, these representations supported the gradual abstraction of structural relationships, facilitating the construction of general combinatorial formulas. Embedding problems in programming, electrotechnics, and management contexts strengthened relevance and transfer, as students connected mathematical reasoning to authentic STEM applications.
Overall, the study offers a replicable instructional model integrating role-play, structured representations, and collaborative reasoning to support abstraction in discrete mathematics. The design supported students in achieving the following objectives: conceptual understanding of permutations and combinations, representational fluency, applied STEM relevance, and collaborative competencies.
Several limitations should be acknowledged: the study was conducted in a single institutional context, over a short instructional period, and without longitudinal follow-up, which constrains generalizability. Future research could explore different contexts, other mathematical topics, and extended mixed-method or longitudinal designs.
6 Conclusion
This study investigated how role-play, collaborative learning, and structured task sequencing can support students’ transition from concrete activity to formal combinatorial reasoning. Students successfully constructed permutation and combination formulas through coordinated use of role-play, tree representations, and guided generalization, rather than receiving formulas in advance. Quantitative gains and qualitative evidence converged to show effective transfer to formal individual problem-solving.
The study contributes to constructivist mathematics education by demonstrating how multiple representations and collaborative dialogue can be deliberately sequenced to scaffold structural abstraction. Embedding combinatorial reasoning in STEM-relevant contexts and bridging permutations toward combinations illustrates a replicable pedagogical model for conceptual learning in discrete mathematics.
Several limitations should be noted. The study was conducted in a single institutional context, over a short instructional period, and without longitudinal follow-up. While cohort comparison and mixed data sources strengthen the findings, broader generalization requires caution.
Future research may test this instructional design in diverse educational settings, extend it to other mathematical topics, and employ longitudinal or expanded mixed-method approaches to examine long-term conceptual retention and transfer. Overall, the results suggest that carefully designed representational and collaborative environments can make combinatorics both conceptually accessible and pedagogically meaningful.
Statements
Data availability statement
The raw data supporting the conclusions of this article will be made available by the authors, without undue reservation.
Ethics statement
Ethical approval was not required for the study involving humans in accordance with the local legislation and institutional requirements. Written informed consent to participate in this study was not required from the participants or the participants' legal guardians/next of kin in accordance with the national legislation and the institutional requirements.
Author contributions
GS: Conceptualization, Formal analysis, Investigation, Methodology, Supervision, Validation, Writing – original draft, Writing – review & editing. ZP: Conceptualization, Formal analysis, Investigation, Software, Supervision, Validation, Visualization, Writing – original draft, Writing – review & editing. IS: Conceptualization, Investigation, Supervision, Writing – original draft, Writing – review & editing.
Funding
The author(s) declared that financial support was not received for this work and/or its publication.
Conflict of interest
The author(s) declared that this work was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
Generative AI statement
The author(s) declared that generative AI was not used in the creation of this manuscript.
Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.
Publisher’s note
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.
References
1
AmeyawY.ManteA. G. (2025). Effect of role-play teaching method on science students’ interest in teaching and learning of photosynthesis. Open Access Libr. J.12 (3), e12370. 10.4236/oalib.1112370
2
BodnerG. M. (1986). Constructivism: a theory of knowledge. J. Chem. Educ.65, 873–878. 10.1021/ed063p873
3
BrooksJ. G.BrooksM. G. (1993). Search of Understanding: The Case for Constructivist Classrooms. Alexandria, VA: ASCD.
4
BrunerJ. S. (1966). Toward a Theory of Instruction. Cambridge, MA: Harvard University Press.
5
DesfitriR. (2024). ‘Analysis of students’ combinatorial thinking model in solving combinatorics problems’. KnE. Soc. Sci.9 (13), 1084–1095. 10.18502/kss.v9i13.16034
6
DutchakI. (2021). STEM-oriented approach to learning as educational innovation XXI century. Problems Educ.1 (94), 127–145. 10.52256/2710-3986.1-94.2021.08
7
DuvalR. (1995). Sémiosis et Pensée Humaine: Registres et Apprentissages Intellectuels. Berne: Peter Lang.
8
EizenbergM. M.ZaslavskyO. (2003). Cooperative problem solving in combinatorics: the inter-relations between control processes and successful solutions. J. Math. Behav.22 (4), 389–403. 10.1016/j.jmathb.2003.09.001
9
EnglishL. (2005). “Combinatorics and the development of children’s combinatorial reasoning,” in Exploring Probability in School: Challenges for Teaching and Learning, ed. JonesG. (New York: Springer), 121–144.
10
FajrinaS.LufriL.AhdaY. (2020). STEM As a learning approach to improve 21st century skills: a review. Int. J. Online Biomed. Eng.16 (7), 91–106. 10.3991/ijoe.v16i07.14101
11
FuX.LiQ. (2025). Effectiveness of role-play method: a meta-analysis. Int. J. Instr.18 (1), 309–324. 10.29333/iji.2025.18117a
12
GodinoJ. D.BataneroC.RoaR. (2005). An onto-semiotic analysis of combinatorial problems and the solving processes by university students. Educ. Stud. Math.60 (1), 3–36. 10.1007/s10649-005-5893-3
13
GoldinG. A.ShteingoldN. (2001). “Systems of representations and the development of mathematical concepts,” in The Roles of Representation in School Mathematics, ed. CuocoA.A. (Reston, VA: NCTM), 1–23.
14
GokhaleA. A. (1995). Collaborative learning enhances critical thinking. Journal of Technology Education7 (1), 22–30. 10.21061/jte.v7i1.a.2
15
GoodT. L.BrophyJ. E. (1994). Looking in Classrooms. New York, NY: Harper Collins College Publishers.
16
GreenoJ. G.HallR. P. (1997). Practicing representation: learning with and about representational forms. Phi. Delta. Kappan.78 (5), 361–368. http://www.jstor.org/stable/20405797
17
Hye-YunJ.Kyeong-HwaL. (2023). Nurturing group creativity in mathematical modeling through role playing. J. Creat. Behav.57 (3), 357–375. 10.1002/jocb.583
18
JohnsonD. W.JohnsonR. T. (1985). “Cooperative learning in the classroom,” in Cooperative Learning: Theory and Research, ed. SharanS. (New York: Praeger), 117–137.
19
KaputJ. J. (1987). “Representation and mathematics,” in Problems of Representation in Mathematics Learning and Problem Solving, ed. JanvierC. (Hillsdale, NJ: Erlbaum), 19–26.
20
LaalM.GhodsiS. M. (2012). Benefits of collaborative learning. Proc. Soc. Behav. Sci.31, 486–490. 10.1016/j.sbspro.2011.12.091
21
LockwoodE.WassermanN. H.TillemaE. S. (2020). A case for combinatorics: a research commentary. J. Math. Behav.59, 100783. 10.1016/j.jmathb.2020.100783
22
LoesC. N.PascarellaE. T. (2017). Collaborative learning and critical thinking: testing the link. J. Higher. Educ.88 (5), 726–753. 10.1080/00221546.2017.1291257
23
MainaliB. (2021). Representation in teaching and learning mathematics. International journal of education in mathematics. Science and Technology9 (1), 1–21. 10.46328/ijemst.1111
24
ModabberniaN. (2025). Exploring Subjectivity and Cognitive Processes in Students’ combinatorial Thinking. Seattle: SIGMAA Special Session, JMM. Available online at:https://meetings.ams.org/math/jmm2025/meetingapp.cgi/Paper/45758(Accessed October 05, 2025).
25
NaylorS.KeoghB. (1999). Constructivism in classroom: theory into practice. J. Sci. Teacher. Educ.10, 93–106. 10.1023/A:1009419914289
26
RaoD.StupansI. (2012). Exploring the potential of role play in higher education: development of a typology and teacher guidelines. Innov. Educ. Teach. Int.49 (4), 427–436. 10.1080/14703297.2012.728879
27
SiligarE. I. P.SomakimS.HapizahH. (2018). Permutations learning via role playing. J. Educ. Learn. (EduLearn)12 (3), 422–431. 10.11591/edulearn.v12i3.9241
28
SjøbergS. (2010). “Constructivism and learning,” in International Encyclopedia of Education. 3rd ed, eds. BakerE.McGawB.PetersonP. (Oxford: Elsevier), 485–490.
29
SpringerL.StanneM. E.DonovanS. S. (1999). Effects of small-group learning on undergraduates in science, mathematics, engineering, and technology: a meta-analysis. Rev. Educ. Res.69 (1), 21–51. 10.3102/00346543069001021
30
StanleyR. P. (2009). Bijective Proof Problems. Cambridge, MA: MIT. Available online at:https://math.mit.edu/∼rstan/bij.pdf(Accessed October 05, 2025).
31
SvenssonR. B.RegnellB. (2017). Is role playing in requirements engineering education increasing learning outcome?Require. Eng.22 (4), 475–489. 10.1007/s00766-016-0248-4
32
TakačiĐStankovG.MilanovićI. (2015). Efficiency of learning environment using GeoGebra when calculus contents are learned in collaborative groups. Comput. Educ.82, 421–431. 10.1016/j.compedu.2014.12.002
33
TaberK. S. (2011). “Constructivism as educational theory: contingency in learning, and optimally guided instruction,” in Educational Theory, ed. HassaskhanJ. (Hauppauge, NY: Nova Science Publishers), 39–61.
34
von GlasersfeldE. (1995). Radical Constructivism: A way of Knowing and Learning. Washington, DC: Falmer Press.
35
ZazkisR.LiljedahlP. (2004). Understanding primes: the role of representation. J. Res. Math. Educ.35 (3), 164–186. 10.2307/30034911
Summary
Keywords
combinations, combinatorics, permutations, representation, STEM
Citation
Stankov G, Papp Z and Szilágyiné Szinger I (2026) Integrating role-play and STEM-based collaborative learning in understanding permutations and combinations. Front. Educ. 11:1728407. doi: 10.3389/feduc.2026.1728407
Received
19 October 2025
Revised
27 February 2026
Accepted
26 March 2026
Published
17 April 2026
Volume
11 - 2026
Edited by
Dina Tavares, Polytechnic University of Leiria, Portugal
Reviewed by
Widodo Winarso, Universitas Islam Negeri Siber Syekh Nurjati Cirebon, Indonesia
Aline Silva De Bona, IFRS campus Osório, Brazil
Updates
Copyright
© 2026 Stankov, Papp and Szilágyiné Szinger.
This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
*Correspondence: Zoltán Papp zoltan.papp@magister.uns.ac.rs
Disclaimer
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.