### Random Post

### Recent Posts

### Recent Comments

### Archives

### Categories

- article (11)
- enigma (1,114)
- misc (2)
- project euler (2)
- puzzle (29)
- site news (43)
- tantalizer (29)
- teaser (3)

### Site Stats

- 166,224 hits

Programming Enigma Puzzles

26 December 2011

Posted by on **From New Scientist #2785, 6th November 2010** [link]

Eight candidates, referred to as A, B, C,…, H are competing for a prize. They sit in a circle in alphabetical order, with H next to A. Each is allotted a whole number known only to the supervisor, who, for each person in turn, announces the sum of the numbers in the trio of neighbours of which he or she is the centre. For example, if H, A, B have numbers 12, 17, 4 then the sum for A is 33. The actual sums are A 38; B 49; C 45; D 48; E 52; F 44; G 39; H 48.

Which two candidates have the closest numbers?

[enigma1620]

Advertisements

%d bloggers like this:

The following Python program runs in 30ms:

Solution:C and G have the closest numbers.