Problem 47833. List the delete-a-digit primes
The sequence starting 23, 37, 53, 73, 113, 131, 137, 173, 179, 197… is interesting because each term is a delete-a-digit prime—that is, a prime number of two or more digits such that deleting any one digit leaves a prime number. For example, deleting the 1 from 137 leaves 37, deleting the 3 leaves 17, and deleting the 7 leaves 13.
Write a function that lists the delete-a-digit primes less than or equal the input number.
Solution Stats
Problem Comments
Solution Comments
Show commentsGroup

Prime Numbers II
- 19 Problems
- 7 Finishers
- List the delete-a-digit primes
- List the dihedral primes
- List the good primes
- Determine whether a number is a prime self number
- Compute home primes in a given base
- List Proth primes
- Label primes with the Erdos-Selfridge classification
- List Honaker primes
- List the nth prime quartet prefix
- Find the smallest prime with n inside
- List prime anagrams of a number
- Determine whether a number is unprimeable
- Count the primes in Collatz sequences
- Play Outside In with primes
- Identify prime words
- Find pairs of primes with the same digit sum and a specified separation
- List composite numbers that cannot be written as the sum of two primes
- Compute the arithmetic derivative of integers
- Solve the arithmetic differential equation D(n) = n
Problem Recent Solvers19
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!