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
-
Find the peak 3n+1 sequence value
2573 Solvers
-
322 Solvers
-
Chebyshev polynomials of the 2nd Kind
81 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2246 Solvers
-
9889 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!