Tag Archives: Proof

Mathematical Induction Regarding Factorials

Mathematical Induction Regarding Factorials

Prove by mathematical induction that for all integers \( n \ge 1 \) ,$$ \dfrac{1}{2!} + \dfrac{2}{3!} + \dfrac{3}{4!} + \cdots + \dfrac{n}{(n+1)!} = 1-\dfrac{1}{(n+1)!}$$ Step 1 Show it is true for \( n=1 \).\( \begin{align} \displaystyle\text{LHS } &= \dfrac{1}{2!} = \dfrac{1}{2} \\\text{RHS } &= 1-\dfrac{1}{2!} \\&= 1-\dfrac{1}{2} \\&= \dfrac{1}{2} \end{align} \)Thus, the statement is […]

Proof by Contradiction

Proof by Contradiction

$\textbf{Introduction to Proof by Contradiction}$ The basic idea of $\textit{Proof by Contradiction}$ is to assume that the statement that we want to prove is $\textit{false}$, and then show this assumption leads to nonsense. We then conclude that it was wrong to assume the statement was $\textit{false}$, so the statement must be $\textit{true}$. As an example […]