I'm trying to solve this sum or at least give an approximation.
$$\sum_{j=1}^{n-1}\frac{2j}{(n-j+1)(j+n)}$$
This was my attempt:
Assuming that in my sum $\sum f(j)$, $f(j)$ is a monotonically increasing function, then I can approximate the sum by the following rule:
$$\int_{m-1}^{n} f(x) dx \leq \sum_{j=m}^{n} f(j) \leq \int_{m}^{n+1} f(x)dx$$
So I need to solve this integral:
$$\sum_{j=1}^{n-1}\frac{2j}{(n-j+1)(j+n)} \leq \int_{1}^{n} \frac{2j}{(n-j+1)(j+n)}dj = \frac{2(\ln n+n \ln (\frac{n+1}{2}))}{2n+1}$$
Then since,
$$\frac{2(\ln n+n\ln(\frac{n+1}{2}))}{2n+1} = \frac{2 \ln n}{2n + 1} + \frac{2 n \ln (\frac{n+1}{2})}{2n + 1}$$
The upper bound for the both terms is
$$O\left(\frac{\ln n}{n}\right) + O(\ln n) = O(\ln n)$$
Then if my calculations are correct I should can prove by induction that, the following inequality holds, for some constant $c$.
$$\sum_{j=1}^{n-1}\frac{2j}{(n-j+1)(j+n)} \leq c\ln(n)$$
But I don't know how to prove it.