# Le Monde puzzle [52|solution]

January 1, 2011
By

(This article was first published on Xi'an's Og » R, and kindly contributed to R-bloggers)

I have now received the first issue of Le Monde magazine, including the solution to puzzle #52 I solved just in time by simulated annealing! The trick is in using the following theorem:

Iter(1,x,y) is divisible by 10x-1 if and only if y is divisible by 10x-1.

Then the value to be found is divisible by 3, but not by 9, by 19, by 29, by 11, by 3 and 7, and by 31. It is thus a multiple of 3x19x29x11x7x31=3,945,711 and only this number satisfies the constraint on Iter(6,1,y).

The first puzzle of the year is as follows:

Select J>999 different numbers ij between 1 and 2001 (1≤jJ) such that (a) if a and b are selected then a+b is selected (assuming a+b<2002) and (b) the residual

$displaystyle{sum_{stackrel{1le kle 2001}{kne i_1,cdots,i_J}} k}$

is maximised.

Filed under: R, Statistics Tagged: Le Monde, mathematical puzzle, simulated annealing

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: , , , ,

Comments are closed.