## Le Monde puzzle [#4]

A fairly simple puzzle in this weekend Le Monde magazine: given five points on a line such that their pairwise distances are 1,2,4,…,14,18,20, find the respective positions of the five points over the line and deduce the missing distances. Without loss of generality, we can set the first point at 0 and the fifth point at 20. The three remaining points are in between 1 and 19, but again without loss of generality we can choose the fourth point to be at 18. (Else the second point would be at 2.) Finding the three remaining points can be done by the R code

```i=1
while (i==1){
prop=sort(c(0,sample(1:17,2),18,20))
a=sort(dist(prop))
if ((a[1]==1)&&(a[2]==2)&&(a[3]==4)&&(a[8]==14))
break()
}
```

Removing 18 from the above takes about the same time! A solution (modulo permutations) is 0, 13, 14, 18, 20.

### 8 Responses to “Le Monde puzzle [#4]”

1. […] is the source of the problem and an algorithm with R which I used for […]

2. […] Sudoku-like puzzle from the weekend edition of Le Monde. The object it starts with is a 9×9 table where each entry is an integer and where neighbours […]

3. I posted the problem and another solution on SE: http://goo.gl/3aTmY

4. Cool!

“while (TRUE)” works too, right?

• Yes indeed. And certainly more elegant.

5. And the symmetric: 0 2 6 7 20.

This site uses Akismet to reduce spam. Learn how your comment data is processed.