Thereâs an obvious answer to this classic puzzle, and thereâs the correct answer. Which will you choose?

This weekâs puzzle was suggested by reader Eric Ennis. Itâs a classic brain teaser that reads a little like a distance problem (i.e. âif Train A leaves the station at such and such a time traveling such and such speed...â), but the solution can be arrived at with zero math whatsoever, through logical, conceptual thinking.

Sunday Puzzle #30: Blowinâ in the Wind

An airplane flies in a straight line from airport A to airport B, then back in a straight line from B to A. It travels with a constant engine speed and there is no wind. Will its travel time for the same round trip be greater, less, or the same if, throughout both flights, at the same engine speed, a constant wind blows from A to B?

Weâll be back next week with the solution â and a new puzzle! Got a great brainteaser, original or otherwise, that youâd like to see featured? E-mail me with your recommendations. (Be sure to include âSunday Puzzleâ in the subject line.)

Image by Jim Cooke

SOLUTION To Sunday Puzzle #29: Counting Coins

Last week, I asked you to devise a strategy for sorting fifty coins into two groups, such that each group contains the same number of coins oriented heads-up. You were told on the front end that sixteen of the fifty coins were already in the heads-up position. You were also given permission to flip as many or as few coins as you saw fit. The catch? You were also blindfolded.

At first glance, this puzzle seems impossible. But with a little algebra, a surprisingly clear strategy emerges. The first person to explain the algebraic solution was commenter bewareofgeek. You can read their explanation (and the ensuing discussion, which is also worth perusing) here. For the math phobic, commenter Improbable was the first to provide a clearly stated conceptual explanation. It reads as follows:

Put all the coins in one pile, then split off sixteen, flipping each one over as you put it in the second pile. If it was tails, you now have a heads coin to match one of the remaining heads coins. If it was heads, itâs now tails, reducing the number of heads in the first pile but not increasing it in the second.

Whether you solve this puzzle conceptually or algebraically, a general strategy emerges by which k coins, n of which are heads up, can be manipulated and divided into two groups with an equal number of heads-up coins: Simply separate n coins from the original set of k coins, and turn them all over! This is the âone simple ruleâ by which any formulation of this puzzle can be solved.

So. Imagine that only ten of the fifty coins are oriented heads up, instead of sixteen. Following our rule, we separate ten coins from the group of fifty and turn all ten of them over. We canât say how many heads each pile will contain, but we do know that the number of heads in the pile of ten coins will equal the number of heads in the pile of forty. We can apply the same strategy whether the number of heads-up coins is twenty-seven out of fifty, or three out of one hundred, or five out of 1,000,000. Simply create a second pile of coins equal in number to the number of heads in the entire set, and turn them all over.

When Sunday Puzzle reader Mikko P. first suggested this puzzle, he posed it several ways. Every variation could be solved by the methods described above, but some of them were more challenging than others. Below, I have included what I think is the trickiest formulation of the riddle:

Zamzam is blindfolded and brought to a table by a man dressed in black. The man says to her: âOn the table there are a vast number of coins, all of them tails up.â

Zamzam, being in no position to argue, nods.

The man continues: âWhat is your favourite number?â

Puzzled, Zamzam answers. The man begins flipping the coins over. When heâs finished, he tells her: âNow there are exactly your favourite number of coins heads up. Your task is to separate the coins into two groups, flipping coins as you see fit, so that each group has the same amount of coins that are heads up.â

The man puts gloves on Zamzamâs hands so that she canât feel the orientation of the coins, and says: âBegin.â

How is Zamzam able to solve the problem?

To someone unfamiliar with the solution, the uncertainty surrounding the total number of coins (which is simply described as âvastâ) and the lack of information vis-Ă -vis Zamzamâs favorite number can make this already difficult problem seem that much more challenging. In fact, these ambiguities are clues; the puzzleâs vagueness speaks to the generalizability of the solution.