49.
Two holes problem
Searching our archive for inspiration for a new problem, we noticed the
following problem from the Journal of Recreational Mathematics - 1987,
by Stan Vejmola from Prague.
Use a set of pentominoes to create a fence enclosing two areas, such
that the sum of the enclosed areas is maximal.
The
non-overlapping pentominoes have to lie on the grid and in the same
plane, and touch each other with at least one side.
Sergio Stanzani made the following solutions:
Our friend Pieter Torbijn († 2007) made the following solutions:
|
With two congruent areas |
With three congruent areas |
Aad van de Wetering improved one record. Congratulations
For our contest we state the same problem with the same conditions
except the set of pentominoes, which is the set of one-sided pentominoes:
Each contestant earns eternal fame.
Whomever send in a solution is free to request a
pentominoset.
If you do wish to receive one, please let us know.
Is your age between 12 and 18?
In that case you have a chance to win a TI-Nspire, if you send a best
solution.
With
many thanks to:Texas
Instruments
who
sponsored us with the TI-Nspire.
The draw of the winner will take place on 31 July 2010
Urgent call: who knows a nice problem for our fiftieth contest?
Send your solution or problem proposal to:
o.d.m@fulladsl.be
