# Le Monde puzzle [52|solution]

**Xi'an's Og » R**, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here)

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

**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).

**T**he first puzzle of the year is as follows:

SelectJ>999 different numbers i_{j}between 1 and 2001 (1≤j≤J)such that (a) if a and b are selected then a+b is selected (assuming a+b<2002) and (b) the residual

is maximised.

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

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

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

R-bloggers.com offers

**daily e-mail updates**about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.