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
-
Renaming a field in a structure array
1581 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2917 Solvers
-
252 Solvers
-
Find the largest value in the 3D matrix
1688 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
148 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!