User talk:Oliver

Welcome to ProofWiki! Since you're new, you may want to check out the general help page. It's the best first stop to see how things are done (next to reading proofs, of course!). Please feel free to contribute to whichever area of mathematics interests you, either by adding new proofs, or fixing up existing ones. If you have any questions please feel free to contact one of the administrators, or post your question on the questions page.

Here are some useful pages to help get you started:
 * Community Portal - To see what needs to be done, and keep up to date with the community.
 * Recent Changes - To keep up with what's new, and what's being added.
 * Check out our house style if you are keen on contributing.
 * Main Page talk - This is where most of the main discussions regarding the direction of the site take place. If you have any ideas, please share them!

Cheers! Joe (talk) 21:25, 20 February 2014 (UTC)

Gamma and Zeta
Nice work on filling in some of the basic stuff on Gamma and Zeta. Your contributions are extremely welcome. --prime mover (talk) 18:04, 25 April 2014 (UTC)

Multiple proofs
The idea is that we don't replace existing proofs with different proofs, but add new proofs and so have multiple proofs for a given theorem.

This is what we want to have happen in Sum of Reciprocals of Primes is Divergent‎. --prime mover (talk) 14:09, 27 April 2014 (UTC)


 * Ok, sorry about that. The previous proof was largely incomplete and had been for quite a while. I was under the impression that I was finishing it off, rather than replacing it with a different one. --Oliver (talk) 14:25, 27 April 2014 (UTC)


 * Well okay, but the one you added today is completely different from the one you added yesterday. It would be good to keep both.


 * And despite the fact that the existing proof was incomplete, it's still a valid entry and merits inclusion. --prime mover (talk) 14:44, 27 April 2014 (UTC)


 * The existing proof was literally just showing that $\ln( \ln n) - \ln \frac {\pi^2} 2$ tends to infinity as $n$ tends to infinity. I just changed the constant because it works nicer with the proof I added on the lower bound of partial sums. (the important part)


 * Perhaps it would be a good idea to put $\ln( \ln n) - C$ in the theorem, as different proofs will inevitably have different constants.--Oliver (talk) 15:11, 27 April 2014 (UTC)


 * Sounds like a plan. --prime mover (talk) 16:01, 27 April 2014 (UTC)

Right, I think I have a structure now. The "Proof of Limit" part of the proof is (once you cut away the complication) is trivial enough, and has been extracted into a lemma and referenced separately. The individual proofs of the lower bounds are still up for grabs by anyone prepared to flog through it. --prime mover (talk) 09:15, 1 May 2014 (UTC)
 * Looks good! --Oliver (talk) 02:09, 2 May 2014 (UTC)