perplexus.info :: Numbers : A string of primes

A string of primes (Posted on 2005-09-01)

Starting from an arbitrary prime of 3 digits you choose, construct a sequence of distinct 3-digit primes such that every one is formed by the 2 rightmost digits of the previous one plus any digit juxtaposed to the right - e.g. 113, 137, 373,... What is the maximum number of distinct primes that YOU can achieve in the sequence?

See The Solution Submitted by pcbouhid

Rating: 2.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

answer

Comment 4 of 4 |

The required number of distinct primes is 26.

Posted by K Sengupta on 2008-02-26 12:10:22

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info