# Le Monde puzzle 

December 7, 2010
By

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

Here is a quick-and-dirty solution to Le Monde puzzle posted a few days ago: the R code counts the number of winning tickets between 1 and N, and stops when there is a proportion of 10% of winning tickets.

```#winning ticket
win=function(n){

#decimal digits decomposition
x=rep(0,4)
x=n%%10
m=(n-x)/10
x=m%%10
m=(m-x)/10
x=m%%10
m=(m-x)/10
x=m%%10

tic=0
for (i in 1:3)
tic=max(tic,(x[i]==1)*(x[(i+1):4]==3))

return(tic)
}

#number of winning tickets
nwt=0
for (i in 1:9999){

nwt=nwt+win(i)
if ((i>999)&&(10*nwt==i)) break()}

#solution
print(i)
```

The (only) solution is therefore N=3500. (I am using this home-made decomposition of a number into its decimal digits, but there must be some function doing that in R already!)

To 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 on topics such as: Data science, Big Data, R jobs, 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: , , ,