No CrossRef data available.
Published online by Cambridge University Press: 17 April 2009
We find the convex planar set of maximal area which is partitioned into subsets of equal area by a given propellor. The argument depends on the characterisation of an n-sided polygon which is circumscribed about a regula n-gon Pn, and inscribed in a regula n-gon Qn, where Pn and Qn are homothetic about their common centre.