Very prime circles
Place the numbers 1 to 2n around a circle so that both the sum and the absolute difference of any two neighbors is a prime.
For which values of n is there a solution? How many solutions are there for any particular value of n? Is there a strategy to generate solutions? See my website for more.