We are given the following succession:

To prove this by mathematical induction we need first to determine if the statement is true for n = 1. Replacing we get:

Therefore, the statement is true for n = 1. Now we will assume that the statement is true and see if it holds for n + 1
Replacing n + 1:
![undefined]()