Write a function that takes a number n as input and finds the first set of n primes such that the first and last have the same digit sum. For example, if the function is given
, it should return [2 11] because those numbers begin and end the string of 5 primes—2, 3, 5, 7, 11.
See also Cody Problem 50933
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers15
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6819 Solvers
-
2251 Solvers
-
434 Solvers
-
Magic is simple (for beginners)
11624 Solvers
-
114 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!