--- Fred lunnon <fred.lunnon@gmail.com> wrote:
On 7/3/06, Michael Kleber <michael.kleber@gmail.com> wrote: ...
And Erdos proved the following refinement of Bertrand's postulate: the interval from n to 2n always contains both a 1 mod 4 and a 3 mod 4 prime. That'll do it.
Um ---- n = 0? n = 1? n = 2? By engineer's induction (only slightly modified), this needs to go back to the drawing board! [Neat idea, though.] WFL
"ErdÅs also proved there always exists at least two prime numbers p with n < p < 2n for all n > 6. Moreover, one of them is congruent to 1 modulo 4, and another one is congruent to â1 modulo 4." Gene __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com