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 ¯\_(ツ)_/¯
What decimal do you want to multiply?
Answer:
Bottling plant B (with 175,000 sports drinks per day), because the daily mean will be closer to 21 fluid ounces with more sports drinks in the sample.
Answer:
-22.2
Step-by-step explanation:
Then, because the problem states "is at least" we know this is an inequality problem and specifically the inequality operator is:
≥
Now, we can write and solve the inequality as:
5(x+26)≥19(5x(5×26)≥195x+130≥195x+130−130≥19−1305x+0≥−1115x≥-1115x5≥−11155x5≥−22.2x≥−22.2
The number is at least
−22.2 or the number is greater than or equal to −22.2
Answer:
16
Step-by-step explanation:
Adam is building birdhouses that requires 
i.e 0.5 feet long boards.
Now, he has an 
i.e. 8.25 feet longboard and wants to cut each 0.5 feet longboards.
We have to calculate the number of pieces of exactly 0.5 feet length that can be made from this 8.25 feet longboard.
Now, 
So, there can be 16 whole board of exact length 0.5 feet. (Answer)
