Create a number sequence of 1 to n, such that the sums of every two consecutive numbers are all primes.
E.g. if n = 5, you may write the sequence as 1,4,3,2,5 or 3,4,1,2,5
if n = 6, you may wrtie the sequence as 2,3,4,1,6,5
The answer is not unique, so one correct answer enough.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers8
Suggested Problems
-
Count from 0 to N^M in base N.
240 Solvers
-
Return elements unique to either input
808 Solvers
-
Longest run of consecutive numbers
6441 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
108 Solvers
-
390 Solvers
More from this Author12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
See also Cody Problem 46050 for a related challenge.