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.
, 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
-
3403 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1270 Solvers
-
Make a random, non-repeating vector.
11306 Solvers
-
66 Solvers
-
Determine if Input is Oddish or Evenish (Odd/Even Sum of Digits)
326 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
