Copyright © University of Cambridge. All rights reserved.

See all short problems arranged by curriculum topic in the short problems collection

Bergerac | ||||

$87$ | Bordeaux | |||

$79$ | $47$ | Langon | ||

$61$ | $31$ | $54$ | Libourne | |

$58$ | $84$ | $37$ | $65$ | Marmande |

The table shows the distance (in $\text{km}$) between five towns in southern France. Five friends live in these five towns and want to meet. In which of these towns should they meet to keep the total travelling distance as small as possible?

If you liked this problem, here is an NRICH task which challenges you to use similar mathematical ideas.

*This problem is taken from the UKMT Mathematical Challenges.*