Search arXivSearch

arXiv · 2608.17112

Group Theory in School Mathematics? Teaching Permutation Cycles Through the 15-Puzzle

Abstract

Permutation cycles are generally associated with undergraduate abstract algebra. This exploratory study examined whether students in Grades 5-11 could construct and use cycle representations in the context of the 15-puzzle. After a 45-minute teacher-guided lesson moving from puzzle manipulation to arrow diagrams and cycle notation, 313 students analyzed one of two new configurations - one solvable and one unsolvable - and used a supplied rule to classify it. Of these students, $78.3\%$ constructed a correct cycle representation, and $67.7\%$ both constructed the representation correctly and reached the correct classification. Cycle-construction accuracy was similar for the two configurations, but classification was less often correct for the unsolvable configuration. The findings concern immediate, supported performance rather than full understanding of permutation cycles or group theory. Nevertheless, they show that many students could use cycle representations after brief instruction and that constructing the representation and using it to reach a conclusion were separate demands. One reason to teach permutations is that, as finite, discrete, non-formulaic functions, they can extend students' experience of functions beyond familiar formulae and continuous graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bence Torma, Tamás Waldhauser. 2026-08-17. Group Theory in School Mathematics? Teaching Permutation Cycles Through the 15-Puzzle. https://arxiv.org/abs/2608.17112

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Come for the vibe, stay for the math

This article describes our experiences in mathematical outreach over the past decade. We talk about specific activities, but also general principles that we've learned along the way.

math.HO

From foundations to applications: reverse mathematics and philosophy

Reverse mathematics is a branch of mathematical logic dedicated to determining the minimal set existence principles necessary and sufficient to derive ordinary mathematical theorems about concrete structures like the real line. Since the mid-1970s, reverse mathematics has developed a systematic classification of the strength of theorems in areas of mathematics ranging from real and complex analysis to infinitary combinatorics. This essay will place reverse mathematics in its historical and philosophical context, and reveal its relevance to central issues in the philosophy of mathematics, from the foundational programmes of Hilbert and Brouwer to contemporary debates about realism, determinacy, and applicability of mathematics. In doing so, it will discuss the role of computability theory in measuring the strength of set existence principles, as well as related questions about idealisation when these principles are applied in the physical sciences and in philosophy.

math.HO