Problem 52313. Truncatable Primes
A truncatable prime is a leading digit is successively removed, then all resulting numbers are prime.
When given a number, Return as per the precedence given
1) 0 - if a number is not a prime or not a truncatable prime.
2) 5 - if a number is left-and-right-truncatable prime. E.g. - 127 => 2
3) 9 - if a number is left as well as right truncatable prime but not a left-and-right-truncatable prime.
For e.g - 313 => 13 (left) & 31 (right) but not 1 (left-and-right both)
4) 3 - if a number is (exclusive) left-truncatable prime. E.g - 17 => 7
7 - if a number is (exclusive) right-truncatable prime. E.g. - 29 => 2
Note - String functions are not allowed!
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers5
Suggested Problems
-
2134 Solvers
-
Back to basics 2 - Function Path
180 Solvers
-
Given a matrix, return the last eigen value
214 Solvers
-
138 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
114 Solvers
More from this Author31
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!