Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 8/28/84; site lll-crg.ARPA
Path: utzoo!linus!philabs!cmcl2!seismo!umcp-cs!gymble!lll-crg!muffy
From: muffy@lll-crg.ARPA (Muffy Barkocy)
Newsgroups: net.math
Subject: Re: Another Prime Number Question With No Practical Application
Message-ID: <574@lll-crg.ARPA>
Date: Wed, 8-May-85 21:51:59 EDT
Article-I.D.: lll-crg.574
Posted: Wed May  8 21:51:59 1985
Date-Received: Fri, 10-May-85 22:08:35 EDT
References: <226@ihnet.UUCP>
Reply-To: muffy@lll-crg.UUCP (Muffy Barkocy)
Distribution: net
Organization: Lawrence Livermore Labs, CRG group
Lines: 20

In article <226@ihnet.UUCP> eklhad@ihnet.UUCP (K. A. Dahlke) writes:
>< and other diversionary tactics >
>	How many primes, when written in base 10,
>also produce prime sub-numbers (looking at the first n digits)?
>For example: 7193 is in the set, since
>7, 71, 719, and 7193 are all prime.
>The list begins: 3, 5, 7, 31, 37, 53, 59, 71, 73, 79, 
>311, 313, 317, 373, 379, 593, 599, ...
>Is the list infinite?
>If so, can anyone prove it.
>If not, and I conjecture not, what is the largest such number?
>Anyone with some time (personal and computer) can enjoy this one.
>-- 
>
>Karl Dahlke    ihnp4!ihnet!eklhad


What *is* that list?  It is not a list of the first n  primes, nor is it a
list of the primes described...
                     Muffy