Search arXivSearch

arXiv · 2402.06648

Designing Problems for Improved Instruction and Learning -- Linear Algebra

Abstract

One of the grand challenges of Mathematics instruction is to provide students with problems that are both accessible and have a reasonably elegant solution. Instructors commonly resort to resources like course textbooks, online-learning platforms, or other automated problem-generating software to select problems for exams and assignments. However, reliance on such tools may result in limited control over problem parameters, potentially yielding intricate solutions that impede students' understanding. This article centers on Linear Algebra, wherein we devise algorithms for reverse engineering matrices of integers with integer outcomes through operations such as the inverse, LU decomposition, and QR decomposition. The focus is on empowering instructors to manipulate matrix properties deliberately, ensuring the creation of problems that enrich instruction and foster student confidence. The intellectual endeavor of reverse engineering such problems, grounded in both theory and matrix properties, proves mutually beneficial for both students and instructors alike.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ryan H. Allaire, Margaret Reynolds, Andrew C. Lee. 2024-02-02. Designing Problems for Improved Instruction and Learning -- Linear Algebra. https://arxiv.org/abs/2402.06648

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