I am trying to prove this statement, but I'm not sure where to go from here. Is don't think this is sufficiently reduced to conclude the statement is true, but I'm not positive.
$k ≥ 2$
Can I further simplify this?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityI am trying to prove this statement, but I'm not sure where to go from here. Is don't think this is sufficiently reduced to conclude the statement is true, but I'm not positive.
$k ≥ 2$
Can I further simplify this?
Hint:
It's not hard to check that $6^{k+1}-{5}^{k+1}$ is increasing and $(6\cdot6-5\cdot 5) \geq 9$
$$ 6^{k+1}-{5}^{k+1} = (6-5)(6^k + \cdots + 5^k) = 6^k + \cdots + 5^k \ge 6^k + 5^k \ge 6+5 =11 > 9 $$ for $k\ge 1$.
You can prove it by induction suppose $5^{k+1} + 9 < 6^{k+1}$ that this is correct and you should prove it for $k+1$ so using the induction assumption the left side is smaller so what it would be if you multiply the part of left side by another $5$ and the right side by another $6$? the left side will be still smaller?