A Prime Cryptarithmitic Example

Appeared in Volume 10/1, February 1997

The following unorthodox cryptarithm was developed by Joseph Ellis Trevor. It is a multiplication problem, where each P stands for a prime digit (2, 3, 5, or 7):

Martin Gardner
Further Mathematical Diversions
Pelican Books, 1979