Problem

Source: 2017 Romanian NMO grade VII P4

Tags: number theory, prime, Digits, prime numbers



Find all prime numbers with $n \ge 3$ digits, having the property: for every $k \in \{1, 2, . . . , n -2\}$, deleting any $k$ of its digits leaves a prime number.