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 Solvers14
Suggested Problems
-
5970 Solvers
-
294 Solvers
-
Program an exclusive OR operation with logical operators
750 Solvers
-
Circular Primes (based on Project Euler, problem 35)
651 Solvers
-
67 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!