Problem 52639. Determine whether a number is unprimeable
The number 204 is unprimeable because no single digit can be changed to make it prime. In contrast, the number 207 is not unprimeable because changing the first digit to 0, 1, 3, 6, or 9 or the second digit to 2, 5, or 7 would make it prime.
Write a function to determine whether the input number is unprimeable.
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 Solvers15
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!