### Random Post

### Recent Posts

### Recent Comments

### Archives

### Categories

- article (11)
- enigma (1,183)
- misc (2)
- project euler (2)
- puzzle (46)
- site news (46)
- tantalizer (49)
- teaser (3)

### Site Stats

- 184,820 hits

Advertisements

Programming Enigma Puzzles

10 October 2013

Posted by on **From New Scientist #2545, 1st April 2006**

A very long time ago within the space of less than 100 years six members of a family were born on 1st April, all in different years. The year of birth of each of them was a perfect square. If we call them A to F in order of birth the number of years that separated the births of the following pairs was also a perfect square: A and D, A and E, B and D, B and F, C and D, C and E, C and F, E and F.

In which years in chronological order were the six born?

[enigma1385]

Advertisements

%d bloggers like this:

Finding a solution to this problem depends on one crucial observation. And for the sake of solving the problem I’ve assumed a certain amount of constancy in the calendar going back to ancient times. This Python program runs in 44ms.

Solution:The years in chronological order are: 49 BC, 25 BC, 1 BC, 1 AD, 16 AD, 25 AD.