## One Team, Two Teams, My Team, Your Team

(A new question of the week) Counting ways to select teams can be simple, or quite complex. Here we’ll look at a few tricky examples.

(A new question of the week) Counting ways to select teams can be simple, or quite complex. Here we’ll look at a few tricky examples.

(A new question of the week) With few new questions of general interest available this week, I thought I’d go back a few months to a couple little questions on a topic we haven’t dealt with lately, combinatorics. We’ll have one question each on permutations and combinations, showing some subtlety in both the methods we …

(A new question of the week) It seems that most of the interesting questions recently have been about relatively advanced topics, though commonly in introductory classes. Here, we’ll help a student think through a problem introducing the idea of a random walk on a graph. (“Graph” here doesn’t mean the graph of an equation, which …

A popular kind of question in combinatorics is to count the number of paths between two points in a grid (following simple constraints). This can be done by very different methods at different levels. We’ll look at several problems of this type, starting with the simplest.

(A new question of the week) A recent question involved a word problem about fractions, which will fit in nicely with the current series on fractions. We’ll explore several ways to solve a rather tricky fraction word problem, some avoiding fractions as much as possible, some focusing on the meaning of the fractions, and others …

(A new question of the week) A couple recent questions centered around how to interpret probability problems, whose wording can often be subtle, and whose solutions require care.

(A new question of the week) A question from last month provides an opportunity to show how to develop an algebraic proof of a combinatorial identity involving factorials. We’ll be looking over Doctor Rick’s shoulder as he guides a student through the maze. I’ll also add in a previously published version of the same proof …

Last week, we looked at two solutions to the problem of finding the probability that you can make a triangle using three pieces of a stick, if we cut it at two independently chosen, random locations. This time, we look another solution to that problem, and a similar solution to the version in which we …

This week we look at questions about how likely it is that you can make a triangle out of three random pieces of a stick. As always in probability, the first issue comes in deciding how the process is to be done (that is, what does it mean to break a stick randomly?); we’ll also …

We’ll spend the next couple weeks looking at various counting problems. This topic, called combinatorics, is often studied along with probability, but many of the topics we’ll see here feel more like geometry problems! Here, we’ll be counting the diagonals of a polygon, and handshakes between people at a party. Counting diagonals We’ll start with …