Let $X$ be a set of real sequences and $d(x,y)=\sum_{k=1}^{\infty}\dfrac{1}{2^k}\cdot \dfrac{\vert a_k-b_k \vert}{1+\vert a_k-b_k\vert}$ with $x=(a_k)_{k \in \mathbb{N}}$, $y=(b_k)_{k \in \mathbb{N}} \in X$.
Prove that $d$ is a metric on $X$.
I can easily checking $d(x,y) \ge 0$, $d(x,y)=0 \Leftrightarrow x=y$ and $d(x,y)=d(y,x)$.
I stuck at checking the convergence of this sequence and the condition $d(x,y)\le d(x,z)+d(z,y), \forall x,y,z \in X$.
Consider a function $$ f(x) = \frac{x}{1+x} $$ for nonnegative $x$. We need to prove that it is subadditive $$ f(a+b) \le f(a) + f(b). $$ It is a concave function (check it, using the second derivative). Note also that $$ f(tx) = f(tx + (1-t)0) \ge tf(x) + (1-t)f(0) = tf(x). $$
That's why we have $$ f(a+b) = \frac{a}{a+b} f(a+b) + \frac{b}{a+b}f(a+b) \le $$ $$ \le f\big(\frac{a}{a+b}\cdot (a+b)\big) + f\big(\frac{b}{a+b}\cdot (a+b)\big) = $$ $$ = f(a) + f(b). $$