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
-
Find the sum of all the numbers of the input vector
54519 Solvers
-
Remove the polynomials that have positive real elements of their roots.
1742 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
13954 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
143 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
421 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!
