Ok, I'm not giving you the answer. Instead, I'm going to give you the way to solve it. Then, you can do it yourself, message it to me, and I will check it.
Do .11 x 25. Remember to add the decimal back in.
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
The sample space is:
(1, 1); (1, 2) - sum of 3; (1, 3); (1, 4); (1, 5) - sum of 6; (1, 6);
(2, 1) - sum of 3; (2, 2); (2, 3); (2, 4) - sum of 6; (2, 5); (2, 6);
(3, 1); (3, 2); (3, 3) - sum of 6; (3, 4); (3, 5); (3, 6) - sum of 9;
(4, 1); (4, 2) - sum of 6; (4, 3); (4, 4); (4, 5) - sum of 9; (4, 6);
(5, 1) - sum of 6; (5, 2); (5, 3); (5, 4) - sum of 9; (5, 5); (5, 6);
(6, 1): (6, 2); (6, 3) - sum of 9; (6, 4); (6, 5); (6, 6)
Answer:
(c+2) > 6
Step-by-step explanation:
exceeds means greater than...
