home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!wri!news
- From: roach@bikini.wri.com (Kelly Roach)
- Subject: u(v^n)w prime puzzle
- Message-ID: <1992Aug18.171532.14274@wri.com>
- Sender: news@wri.com
- Nntp-Posting-Host: bikini.wri.com
- Organization: Wolfram Research, Inc.
- References: <1992Aug18.030646.29851@usenet.ins.cwru.edu>
- Date: Tue, 18 Aug 1992 17:15:32 GMT
- Lines: 46
-
-
-
-
- Prove or disprove: There are three non-empty
- strings of digits u,v,w such that all the
- numbers in
- L = {u(v^n)w | n is a natural number}
- = {uw, uvw, uvvw, uvvvw, uvvvvw, ...}
- are prime numbers.
-
-
- Time to say a few more words about my u(v^n)w prime
- puzzle which I posted yesterday. I am definitely not looking
- for any solutions involving u=v="0". Ordinary syntax only
- please. No leading zeros in u.
- Some interesting patterns:
-
- u="3",v="3",w="1"
- 31, 331, 3331, 33331, 333331, 3333331, 33333331
-
- u="1",v="36",w="1"
- 11, 1361, 136361, 13636361, 1363636361, 136363636361
-
- u="17",v="57",w="09"
- 1709, 175709, 17575709, 1757575709, 175757575709,
- 17575757575709, 1757575757575709, 175757575757575709
-
- Below each line giving u,v,w values appear a lot of prime
- numbers. These patterns do eventually fail:
-
- 333333331 = 17*19607843
- 13636363636361 = 17*1321*5693*106661
- 17575757575757575709 = 232433*75616446785773
-
- The question is, are there any {u,v,w} examples which do
- not fail? That always give prime numbers?
- I know the solution to this puzzle. I think the
- solution can be understood fairly easily by anyone that
- has had a first course in number theory. See if you
- can discover it.
-
-
-
-
-
-
-