I'm having trouble developing an algorithm to check if a prime number is also right-prime. A right-truncatable prime number (or right-prime number) is a prime number that remains prime as each of it's right-most digits is removed. For example, consider the value 719. 719 is prime, 71 is prime, and 7 is prime, so the value 719 is a right-prime number.

Supposedly this should be a very simple algorithm, but I don't even know where to begin. All I really need help with is pseudocode. I can do the syntax on my own once I figure out the correct algorithm.