A prime circle is a circular arrangement of the numbers 1 to 
such that pairs of consecutive numbers add to primes. For example, if n = 3, a valid prime circle would be
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
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers49
Suggested Problems
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
824 Solvers
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
178 Solvers
-
532 Solvers
-
find nth even fibonacci number
91 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
