Evaluating $\lim_{n\to \infty}\frac1{2n}\log\left({2n \choose n}\right)$ $$\lim_{n\to \infty}\frac1{2n}\log\left({2n \choose n}\right)$$
Now, $\log(n!) = \Theta (n\log(n))$ so I think we could write, 
$$\lim_{n\to\infty}\frac{1}{2n}\left(\log\left(2n!\right) - \log\left(n!^2\right)\right) = \frac{1}{2n}\left(\log\left(2n!\right) - 2\log\left(n!\right)\right) $$
$$\lim_{n\to\infty}\frac{1}{2n}\left(2n\log\left(2n\right) - 2n\log\left(n\right)\right) $$
$$\log\left(2n\right) - \log\left(n\right) = \log(2)$$
Is this legitimate? I feel this might be wrong since, the $\Theta$ notation conceals a constant factor. 
 A: One easy way is to observe in the binomial expansion of $(1+1)^{2n} = \sum\limits_{k=0}^{2n} \binom{2n}{k}$, the term $\binom{2n}{n}$ is the largest one among all the $2n+1$ terms of the form $\binom{2n}{k}$. This gives us a bound
$$\frac{2^{2n}}{2n+1} \le \binom{2n}{n} \le 2^{2n}
\quad\implies\quad \log 2 - \frac{\log(2n+1)}{2n} \le \frac{1}{2n}\log\binom{2n}{n} \le \log 2$$
which implies the desired limit is $\log 2$.
A: Alternative computation:
$$\begin{align*} a_n &= \frac{1}{2n} \log \binom{2n}{n} = \frac{1}{2n} \log \frac{(2n)!}{(n!)^2} \\ &= \frac{1}{2n} \sum_{k=1}^n \log \frac{n+k}{k} = \frac{1}{2n} \sum_{k=1}^n \log \Bigl( 1 + \frac{1}{k/n} \Bigr). \end{align*}$$  Therefore, as $n \to \infty$, we get a Riemann sum: $$\begin{align*} \lim_{n \to \infty} a_n &= \frac{1}{2} \int_{x=0}^1 \log\Bigl(1 + \frac{1}{x}\Bigr) \, dx = \frac{1}{2} \int_{x=0}^1 \log (x+1) - \log x \, dx \\ &= \log 2. \end{align*}$$

In fact, we can easily extend this solution to evaluate limits of the form $$a_n(z) = \frac{1}{zn} \log \binom{zn}{n}$$ for integers $z > 1$:  $$\lim_{n \to \infty} a_n(z) = \log \frac{z}{(z-1)^{1-1/z}}.$$  (The case $z = 1$ is trivial.)  What about limits of sequences of the form $$a_n(w,z) = \frac{1}{\binom{z}{w}n} \log \binom{zn}{wn}, \quad z > w \ge 1?$$
A: As suggested in several comments, the simplest form of Stirling approximation for $n!$ is $$\sqrt{2 \pi } e^{-n} n^{n+\frac{1}{2}}$$
(http://en.wikipedia.org/wiki/Stirling%27s_approximation) 
Take the logarithms and develop first
$$\log\left(2n!\right) - 2\log\left(n!\right)$$ which results to be $(2 n+1) \log (2)$. The remaining is obvious.  
If I may, remember Stirling approximation; it is extremlely useful almost any time we need to play with factorials. If required, higher orders can be used (as given in Wikipedia).
