## Le Monde puzzle [#1132] A vaguely arithmetic challenge as Le weekly Monde current mathematical puzzle:

Given two boxes containing x and 2N+1-x balls respectively. If one proceeds by repeatedly transferring half the balls from the even box to the odd box, what is the largest value of N for which the resulting sequence in one of the boxes covers all integers from 1 to 2N?

The run of a brute force R search return 2 as the solution

```lm<-function(N)
fils=rep(0,2*N)
bol=c(1,2*N)
while(max(fils)<2){
fils[bol]=fils[bol]+1
bol=bol+ifelse(rep(!bol%%2,2),-bol,bol)*c(1,-1)/2}
return(min(fils))}
```

with obvious arguments that once the sequence starts cycling all possible numbers have been visited:

```> lm(2)
 1
> lm(3)
 0
```

While I cannot guess the pattern, there seems to be much larger cases when lm(N) is equal to one, as for instance 173, 174, 173, 473, 774 (and plenty in-between).

### 2 Responses to “Le Monde puzzle [#1132]”

1. Le Monde puzzle [#1132] | R-bloggers Says:

[…] article was first published on R – Xi'an's Og, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here) […]