Consider the sequence that begins 101, 113, 127, 131, 149, 151, 163,... Not only is every term prime, the nth term is the smallest prime with n in the interior digits.
Write a function that takes an integer and returns the smallest prime with that integer in its interior.
Although it's not part of the problem, you might think about these questions and others: Which terms are formed by adding 1s to the beginning and end? Which value of n results in a prime that requires more than one digit added to beginning and end? Does the sequence include any terms starting and ending with 9?
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers18
Suggested Problems
-
Return the 3n+1 sequence for n
8491 Solvers
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
560 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
751 Solvers
-
11740 Solvers
-
482 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!
