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 Solvers16
Suggested Problems
-
567 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
119 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
192 Solvers
-
Replace pattern 0 1 0 and 1 0 1
162 Solvers
-
964 Solvers
More from this Author330
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!