The whole numbers 1 to 2n are placed in order around a circle. For which n is it possible to draw n non-intersecting chords (one from each number) such that each of them joins two numbers whose sum is a perfect square?

What if we wish that the two numbers belonging to each chord add up to a prime number?