<s>[INST] Prove that $\frac{1}{n+1} + \frac{1}{n+3}+\cdots+\frac{1}{3n-1}>\frac{1}{2}$ Without using Mathematical Induction, prove that $$\frac{1}{n+1} + \frac{1}{n+3}+\cdots+\frac{1}{3n-1}>\frac{1}{2}$$
I am unable to solve this problem and don't know where to start. Please help me to solve this problem using the laws of inequality. It is a problem of Inequality. 
Edit: $n$ is a positive integer such that $n>1$.
 [/INST] Any statement that needs to be proved for all $n\in\mathbb{N}$, will need to make use of induction at some point.
We have
\begin{align}
S_n & = \sum_{k=1}^n \dfrac1{n+2k-1} = \dfrac12 \left(\sum_{k=1}^n \dfrac1{n+2k-1} + \underbrace{\sum_{k=1}^n \dfrac1{3n-2k+1}}_{\text{Reverse the sum}}\right)\\
& = \dfrac12 \sum_{k=1}^n \dfrac{4n}{(n+2k-1)(3n-2k+1)} = \sum_{k=1}^n \dfrac{2n}{(n+2k-1)(3n-2k+1)}
\end{align}
From AM-GM, we have
$$4n = (n+2k-1) + (3n-2k+1) \geq 2 \sqrt{(n+2k-1)(3n-2k+1)}$$ This gives us that
$$\dfrac1{(n+2k-1)(3n-2k+1)} \geq \dfrac1{4n^2}$$
Hence, we obtain that
$$S_n = \dfrac12 \sum_{k=1}^n \dfrac{4n}{(n+2k-1)(3n-2k+1)} \geq \sum_{k=1}^n \dfrac{2n}{4n^2} = \dfrac12$$
Also, just to note, every step in the above solution requires induction.
Also, as @MartinR rightly points out, the inequality is strictly in our case for almost all $k$ except for $k=\dfrac{n+1}2$ (since equality holds only when $n+2k-1 = 3n-2k+1 \implies k = \dfrac{n+1}2$).
</s>