Answer:
Assume that Sn is valid for n = k and prove that Sn is valid for n = k + 1.
Step-by-step explanation:
This is the second step in the principal of mathematical induction. The three steps in the principals of mathematical induction are:
1. show that something works for the first case (base or anchor step)
2. assume that it works for any particular step (inductive hypothesis), and then
3. show that it works for the next case (inductive step)
p. 621 in textbook
It's weird that they put steps 2 & 3 together, but it was correct on the test so ¯\_(ツ)_/¯
Answer:
C
Step-by-step explanation:
+0.2 will increase every y-value by 0.2, hence shifting the graph 0.2 units upwards
Answer:
5/17
Step-by-step explanation:
The xs cancel eachother out :)
Answer:
Question 1: Answer is H
Question 2: Answer is C
Question 3: Answer is B
Step-by-step explanation:
<em>Trust.</em>
Answer:
The symmetric property of equality. :)
