home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!ames!saimiri.primate.wisc.edu!zaphod.mps.ohio-state.edu!howland.reston.ans.net!usc!sdd.hp.com!spool.mu.edu!samsung!balrog!web.ctron.com!wilson
- From: wilson@web.ctron.com (David Wilson)
- Newsgroups: sci.math
- Subject: Re: Question about Prime Numbers
- Message-ID: <6536@balrog.ctron.com>
- Date: 25 Jan 93 14:14:54 GMT
- Sender: usenet@balrog.ctron.com
- Reply-To: wilson@web.ctron.com (David Wilson)
- Organization: Cabletron Systems INc.
- Lines: 30
- Nntp-Posting-Host: web
- Originator: wilson@web
-
-
- The problem is to find large integers x such that every positive-
- length prefix of the base-10 representation of x is the base-10
- representation of a prime number.
-
- It turns out that there are five 8-digit numbers satisfying the
- conditions. They are 73939133, 59393339, 37337999, 29399999, and
- 23399339. No larger numbers satisfy the conditions.
-
- If we accept 1 as prime, then the 10-digit numbers 1979339339 and
- 1979339333 are the largest satisfying the conditions. If we lift
- the primality condition altogether on the first digit, then these
- two numbers are still the largest satisfying the conditions.
-
- If we lift the primality restriction on the first two digits, then
- x = 4099339193933, alone among 13-digit numbers. If we lift the
- primality restriction on the first three digits, then x =
- 1009993997993 suffices as well.
-
- ----<>----
-
- As a teaser, if we replace "prime number" with "sum of two squares"
- in the original problem, it becomes much less tractable.
-
-
- --
- David W. Wilson (wilson@web.ctron.com)
-
- Disclaimer: "Truth is just truth...You can't have opinions about truth."
- - Peter Schikele, introduction to P.D.Q. Bach's oratorio "The Seasonings."
-