Problem 47793. Find the smallest prime with n inside
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 commentsProblem Recent Solvers17
Suggested Problems
-
Increment a number, given its digits
667 Solvers
-
Return a list sorted by number of consecutive occurrences
390 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
1931 Solvers
-
1490 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2014 Solvers
More from this Author298
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!