[FEATURE] Adding Left-Truncatable Prime

[farishaskovic]

Detailed Description

I would like to add an algorithm for checking if the number is left-truncable prime. A Left-truncatable prime is a prime which in a given base (say 10) does not contain 0 and which remains prime when the leading (“left”) digit is successively removed. For example, 317 is left-truncatable prime since 317, 17 and 7 are all prime. There are total 4260 left-truncatable primes.

The task is to check whether the given number (N >0) is left-truncatable prime or not.

Context

This feature can be useful for a lot of computer science students.

Possible Implementation

[ayaankhan98]

@faski1 go ahead and implement looking for your PR

[stale]

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[stale]

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel. Thank you for your contributions!