The Brainliest Answer!

This Is a Certified Answer

Certified answers contain reliable, trustworthy information vouched for by a hand-picked team of experts. Brainly has millions of high quality answers, all of them carefully moderated by our most trusted community members, but certified answers are the finest of the finest.
Induction works nicely for this proof

Base case :

Induction hypothesis :
Let k\in\mathbb{N} be an integer greater than 0 and assume that the proposition is true for n=k. That is

Induction step :


1 5 1