Copyright © University of Cambridge. All rights reserved.

## 'Leonardo's Problem' printed from http://nrich.maths.org/

Three people (Alan, Ben and Chris), collectively own a certain number of gold sovereigns. Respectively they own a half, one third and one sixth of the total number.

All the sovereigns were piled on a table and each of them grabbed a part of the pile so that none were left.

After a short time:

Alan returned half of the sovereigns that he had taken.

Ben returned a third of what he had taken.

Chris returned one sixth of what she had taken.

Finally each of the three got an equal share of the amount that had been returned to the table.

Surprisingly, each person had exactly the number of sovereigns that really belonged to them.

What is the smallest number of sovereigns that this strange transaction will work for? How much did each person grab from the pile?