A prime is said to be non-coinciding if there exists a positive integer such that no two powers of have their rightmost digits the same, in the same order.
Determine the sum of all non-coinciding primes .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There are no such primes, by the Pigeonhole Principle. For any k there are finitely many possibilities for the k rightmost digits, and there are infinitely many powers of p , so there must be a pair whose k rightmost digits coincide.