Prove that $1 + nx ≤ (1 + x)^n$ , for all real numbers $x > −1$ and integers $n ≥ 2$ by mathematical induction.
My attempt
(1) $n=2$
$x > -1 \Rightarrow (1+2x > -1) \land (x^2 \ge 0)
\Leftrightarrow (1+2x) \le (1+x)^2 $
Hence p(2) is true.
(2) We must show that for all integers $k \ge 2, p(k) \Rightarrow p(k+1)$
Suppose for inductive hypothesis, $k \ge 2, p(k)$.
That is $1 + kx ≤ (1 + x)^k$
Then, $1 + kx + x = 1 + (k+1)x ≤ (1 + x)^k + x$
I should get $1 + (k+1)x ≤ (1 + x)^{k +1} $. It seems when I multiply each side by (1+x), the left side gets complex and far away from desired inequlity. On the other hand, when I add 1, it doesn't help since we have to get $(1+x)^{k+1}$ on the right side, $(1 + x)^k + x+1$ doesn't increase the exponent of $(1+x)$.
What should I do next to get out of $1 + kx + x = 1 + (k+1)x ≤ (1 + x)^k + x$?
$1 + kx + x = 1 + (k+1)x ≤ (1 + x)^k$