Problem 54295. prime consecutive sums
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
ChrisR
on 19 Apr 2022
See also Cody Problem 46050 for a related challenge.
Solution Comments
Show commentsProblem Recent Solvers6
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1036 Solvers
-
230 Solvers
-
352 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
97 Solvers
-
Numbers spiral diagonals (Part 1)
188 Solvers
More from this Author10
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!