How to evaluate $\log x$ to high precision "by hand" I want to prove
$$\log 2<\frac{253}{365}.$$
This evaluates to $0.693147\ldots<0.693151\ldots$, so it checks out. (The source of this otherwise obscure numerical problem is in the verification of the Birthday problem.) If you had to do the calculation by hand, what method or series would you use to minimize the number of operations and/or size of the arguments involved in order to get this result? I'm doing a formal computer proof, so it's not exactly by hand, but I still want to minimize the number of evaluations needed to get to this result.
One method is by rewriting it into $2<e^{253/365}$ and using the power series; since it is a positive series you know you can stop once you have exceeded $2$. Working this out, it seems you need the terms $n=0,\dots,7$ of the sum, and then it works out to
$$2<\sum_{n=0}^7\frac{(253/365)^n}{n!}=\frac{724987549742673918011}{362492763907870312500},$$
which involves rather larger numbers than I'd like. There is also the limit $(1+\frac{253}{365n})^n\to$ $e^{253/365}$, but the convergence on this is not so good; it doesn't get past $2$ until $n=68551$, at which point we are talking about numbers with $507162$ digits.
For $\log 2$ there is of course the terribly converging alternate series $\log 2=\sum_{n=1}^\infty\frac{-(-1)^n}n$, which requires $71339$ terms to get the desired bound. This can be improved by pushing the series into its geometrically convergent region as $\log 2=2\log{\sqrt 2}=-2\sum_{n=1}^\infty \frac{(1-\sqrt2)^n}n$, but now there is the added complication of estimating $\sqrt 2$ to sufficient precision. Assuming that $\sqrt 2$ is known exactly, you need to take this series out to $12$ terms, at which point we are verifying
$$\frac{1959675656 \sqrt2-2771399891}{1011780}<0\Leftarrow2771399891^2>1959675656^2\cdot 2.$$
What other methods are there to do a calculation like this? Is there a way to use a root-finding method like Newton's to get a strict bound out with fast convergence?
 A: You could express this as  $\log(1/2) > -\dfrac{253}{365}$.  The series 
$$\log(1/2) = \log(1-1/2) = -\sum_{n=1}^\infty \dfrac{1}{n 2^n}$$ converges quickly, and has nice bounds:
$$ \log(1/2) \ge - \sum_{n=1}^{N-1} \dfrac{1}{n 2^n} - \sum_{n=N}^\infty \dfrac{1}{N 2^n} = - \sum_{n=1}^{N-1} \dfrac{1}{n 2^n} - \dfrac{1}{N 2^{N-1}}$$
EDIT:  Another way to write it is $2 < (\exp(1/365))^{253}$, and use the continued fraction 
$$ \exp(1/n) = 1 + \dfrac{1}{n-1 + \dfrac{1}{1 + \dfrac{1}{1 + \dfrac{1}{3n-1 + \dfrac{1}{1+ \dfrac{1}{1+ \dfrac{1}{5n-1 + \ldots}}}}}}}$$
In particular, $$\exp(1/365) >1+ 1/(364+1/(1+1/(1+1/1094))) = \dfrac{800080}{797891}$$
and (if you don't mind exact arithmetic with big integers)
$$\left(\dfrac{800080}{797891}\right)^{253} > 2$$
A: Since $\log 2=2\operatorname{arctanh}\frac{1}{3}$, we may use the series:
$$ \log 2 = \sum_{n\geq 0}\frac{2}{(2n+1)\,3^{2n+1}} $$
and the bound:
$$ \sum_{n\geq 4}\frac{2}{(2n+1)\,3^{2n+1}}\leq\sum_{n\geq 4}\frac{2}{3^{2n+3}}=\frac{1}{157464} $$
to prove that (we just need the terms of the previous series till $n=4$):
$$ \log 2\approx \frac{4297606}{6200145} = \color{red}{0.69314}\color{blue}{60474\ldots}$$
where the red digits are the right ones for sure.
A: $\log 2 = \log (1 + 1/3) + \log (1 + 1/2)$, and each of those terms can be easily evaluated to the desired predictions using $\log (1+x) = x - x^2/2 + x^3/3 - \cdots$.   There are other ways to write $\log 2$ as a sum of logarithms that will let you write it as a sum of more, but faster-converging series; I'm not sure what minimizes the arithmetic.  In general we have
$$ \log 2 = \log \left( 1 + {1 \over 2n-1} \right) + \log \left( 1 + {1 \over 2n-2} \right) + \cdots + \log \left(1 + {1 \over n} \right)$$
of which the original identity I gave is the $n = 2$ case.  
