home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!ogicse!uwm.edu!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!wjcastre
- From: wjcastre@magnus.acs.ohio-state.edu (W.Jose Castrellon G.)
- Newsgroups: sci.math
- Subject: Dirichlet's theorem (was Re: Primes in x_{n+1} = ax_n+b)
- Message-ID: <1992Aug21.162241.7303@magnus.acs.ohio-state.edu>
- Date: 21 Aug 92 16:22:41 GMT
- Article-I.D.: magnus.1992Aug21.162241.7303
- References: <a_rubin.714331997@dn66> <1992Aug21.103132.29967@ecrc.de>
- Sender: news@magnus.acs.ohio-state.edu
- Organization: The Ohio State University,Math.Dept.(studnt)
- Lines: 26
- Nntp-Posting-Host: bottom.magnus.acs.ohio-state.edu
-
- In article <1992Aug21.103132.29967@ecrc.de> jeanmarc@ecrc.de writes:
-
- >Let a,b be integers, and (x_n) be a sequence s.t. x_{n+1} = a x_n + b
- >
- >My question is: does it contain infinitely many primes ?
- >
- >There are trivial cases, where the answer is no:
- >1/ if (a x_0 + b = x_0) the sequence is constant.
- >2/ if (a = -1) the sequence alternates between two values x_0 and x_1.
- >3/ if ((a,b) > 1 or (x_0,b) > 1) then the sequence clearly contains only
- >composite numbers.
- >
- >What about the other cases ?
- >
- >I've seen a "theorem of Dirichlet" in Hardy&Wright which handles the case a=1.
- >Can anyone give me a pointer to a proof of that theorem (Hardy&Wright don't
- >give it and the only reference they give is in German).
- >
- >---
-
- There is one in Ireland&Rosen's _A Classical Introduction to Modern Number
- Theory_. It uses only basic complex analysis (as in Knopp's dover books).
-
- Dirichlet's Theorem: If a and b are relatively prime, then there are infinitely
- many primes of the form an+b. Even more, the density of primes is equally dis-
- tributed among all b's <a which are relatively prime to a.
-