Talk:Brun's theorem
 | The contents of the Brun's constant page were merged into Brun's theorem on 2011-03-25. For the contribution history and old versions of the redirected page, please see its history; for the discussion at that location, see its talk page. |
Proposed merger
- The following discussion is closed. Please do not modify it. Subsequent comments should be made in a new section. A summary of the conclusions reached follows.
- Agreement for merge. -- P 1 9 9 • TALK 18:01, 25 March 2011 (UTC)
There's a significant overlap between Brun's theorem and Brun's constant. Richard Pinch (talk) 20:46, 4 August 2008 (UTC)
- Merge After you have read Brun's theorem, Brun's constant boils down to a sentence or two: Brun's constant is hard to estimate, and some people have calculated a lower bound of NNNNNNNNNNN. --Uncia (talk) 21:24, 4 August 2008 (UTC)
- merge seems an easy call. Jason Quinn (talk) 20:13, 13 February 2011 (UTC)
I think it is ok to merge, but please make a redirect from constant to this article. —Preceding unsigned comment added by 24.245.20.61 (talk) 04:02, 28 January 2010 (UTC)
The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.
Proof
Can someone add a basic description of the proof, or a link to the proof? It's the first thing I was looking for, but I can't find it anywhere that isn't behind a paywall.