D. S_D22

Contributed by Anthony Batiste, Eagle Problem Solvers, Blazej Kot, and Christopher West, Georgia Southern University, Georgia Southern University, PMP, and PMP

Consider the case n = 1 in which you precisely fit one cookie in a 2×2 square, leaving 4 − π square units of cookie dough, which are “wasted” in that you cannot make any further cookies. This case shows two things:

(a) you must always waste at least 4 − π square units of dough, and

(b) you can never waste 4 or more square units of dough.

Therefore, the process described is equivalent to making unit-circle cookies (each with area π) one at a time until the area of dough left lies in the interval [ 4 − π , 4 ) (it just takes fewer steps when there is at least 16 square units of dough). If you start with an area A of dough, that process produces ⌊ A + π − 4 π ⌋ cookies. So the general answer for Fill the Jar with an n × n grid is

⌊ 4 n 2 + π − 4 π ⌋ ,

which comes out to 20 cookies in the case of starting with a 4-by-4 grid.

This problem originally appeared in the Prisoner’s Dilemma in the issue of the PMP Newsletter. Solutions will be accepted through .