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
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 Solvers50
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
53368 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
109 Solvers
-
5879 Solvers
-
276 Solvers
-
12907 Solvers
More from this Author326
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!