Q.Prove by Mathematical Induction that

[!FORMULA] $1!+(2\times 2!)+(3\times 3!)+\cdots+(n\times n!) = (n+1)!-1.$

The Principle of Mathematical Induction (PMI) is a method for proving that a statement $P(n)$, framed for every natural number $n$, is true for all $n \in \mathbb{N}$ at once — without needing to verify infinitely many individual cases directly. It rests on two pillars: a base case, where $P(1)$ (or the smallest relevant value of $n$) is checked directly, and an inductive step, where it is shown that the truth of $P(k)$ forces the truth of $P(k+1)$ for every positive integer $k$. Once both are established, PMI concludes that $P(n)$ holds for every natural number, be …