Problem 52639. Determine whether a number is unprimeable

ChrisR

17 solvers

3 likes

Solve

Solve Later

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. 

Solve

Solution Stats

35 Solutions

Last Solution submitted on May 25, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers17

Suggested Problems

Find the numeric mean of the prime numbers in a matrix.

9160 Solvers
Space Saver

506 Solvers
Number of 1s in the Binary Representation of a Number

484 Solvers
Create logical matrix with a specific row and column sums

349 Solvers
Magic is simple (for beginners)

11588 Solvers

More from this Author327

List even numbers whose Goldbach partition does not use the largest prime

8 Solvers
Convert a number from factorial notation to base 10

11 Solvers
Compute measurement uncertainty

11 Solvers
Flip the parity of digits in a decimal expansion

8 Solvers
Compute the water table in a layered unconfined aquifer

3 Solvers

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!