The answer is 16 units
An easy way to find the perimeter is remembering the formula of a+b+c.
So in this case, you count how many units each line of the triangle it covers. 4+6+6= 16
Answer:
inverse
Step-by-step explanation:
¬ is the symbol for not. When we have not a implies not b we have a inverse
Answer:
18
Step-by-step explanation:
3+9=12
12/2=6
6x3=18
Let

In order to prove this by induction, we first need to prove the base case, i.e. prove that P(1) is true:

So, the base case is ok. Now, we need to assume
and prove
.
states that

Since we're assuming
, we can substitute the sum of the first n terms with their expression:

Which terminates the proof, since we showed that

as required