Strategies

Permutations and Combinations: Undercounts and Overcounts

(A new question of the week) We have been looking at some combinatorics questions, both easy and challenging. Some questions have come to us in recent weeks that can illustrate how to think your way through relatively difficult problems, including catching errors and interpreting a textbook’s solutions. We’ll see yet again that there are usually …

Permutations and Combinations: Undercounts and Overcounts Read More »

Six Distinguishable People in Four Distinguishable Rooms

(An archive question of the week) Last time we looked at some elementary problems in combinatorics, where we counted the number of ways to choose or arrange elements of a set. Let’s look at a somewhat more complicated problem, which will demonstrate issues that come up in interpreting such a problem and in choosing a …

Six Distinguishable People in Four Distinguishable Rooms Read More »

Pattern and Sequence Puzzles Revisited

Back in May, I wrote about pattern and sequence puzzles, and didn’t have the space to cover all that I would have liked. It’s time to revisit the topic, looking at a couple different types of sequences, and then the “input/output” or “function” puzzles that add an extra twist to the idea.

Counting Kings

(A new problem of the week) Having discussed counting earlier this week, let’s take a look at a different kind of counting. The subject of combinatorics (the study of counting) arises in many guises: probability, sets, geometry. Here, we look at a relatively basic type of problem that involves the same sort of organized thinking …

Counting Kings Read More »

Counting Faces, Edges, and Vertices

Over the years, we have had many questions, often from young students, asking how to count the parts (faces, edges, vertices) of a polyhedron (cube, prism, pyramid, etc.). The task requires understanding of terms, visualization of three-dimensional objects, and organizing the parts for accurate counting — all important skills. How can we help with this?

A Polynomial Inequality: Exploration vs Proof

(A new question of the week) We have had a number of challenging questions about inequalities recently. I want to show one of those here, because it involved a useful discussion about how to prove them.

Venn Diagrams: Over the Top

(An archive question of the week) Last time we looked at various 2- and 3-set Venn diagram problems (and alternative methods). One discussion I found while collecting them deserved to be set aside for special examination, if only because it would scare the beginner. A mixture of tools will make the work easier. Here it …

Venn Diagrams: Over the Top Read More »