**G**iven the wrong solution provided in Le Monde and comments from readers, I went to look a bit further on the Web for generic solutions to the rectangle problem. The most satisfactory version I have found so far is Mendelsohn’s in **Mathematics Magazine**, which gives as the maximal number

for a grid. His theorem is based on the theory of projective planes and must be such that a projective plane of order exists, which seems equivalent to impose that is a prime number. The following graph plots the pairs when along with the known solutions, the fit being perfect for the values of of Mendelsohn’s form (i.e., 3, 7, 13).

**U**nfortunately, the formula does not extend to other values of , despite Menselsohn’s comment that *using for the positive root of the equation and then replacing by nearby integers* (in the maximal number) should work. (The first occurrence I found of a solution for a square-free set did not provide a generic solution, but only algorithmic directions. While it is restricted to squares. the link with fractal theory is nonetheless interesting.)

Filed under: Kids, R Tagged: fractal, Le Monde, mathematical puzzle, Mendelsohn, primes, projective planes

*Related*

To

**leave a comment** for the author, please follow the link and comment on his blog:

** Xi'an's Og » R**.

R-bloggers.com offers

**daily e-mail updates** about

R news and

tutorials on topics such as: visualization (

ggplot2,

Boxplots,

maps,

animation), programming (

RStudio,

Sweave,

LaTeX,

SQL,

Eclipse,

git,

hadoop,

Web Scraping) statistics (

regression,

PCA,

time series,

trading) and more...

If you got this far, why not

__subscribe for updates__ from the site? Choose your flavor:

e-mail,

twitter,

RSS, or

facebook...

**Tags:** fractal, Kids, Le Monde, mathematical puzzle, Mendelsohn, primes, projective planes, R