A prime circle is a circular arrangement of the numbers 1 to 2n such that pairs of consecutive numbers add to primes. For example, if n = 3, a valid prime circle would be
1 6 5 2 3 4
because the sums of pairs would be 7, 11, 7, 5, 7, and (wrapping around) 5--all of which are prime.
Write a function to create a prime circle given n. The test suite will check that prime circle has the right numbers and that the sums of pairs are prime.

Solution Stats

205 Solutions

50 Solvers

Last Solution submitted on May 22, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments
Loading...