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 ¯\_(ツ)_/¯
Bella can cut about 24 pieces because you have to divide 85 feet by 3.5 feet to find out how many pieces which is 24.285 and so on but you just round to 24.
Answer:
P [ K > 3.95] = 0.5633
Step-by-step explanation:
The interpretation of the given question goes thus;
Suppose that K is a random variable
P[-3.95 ≤ K ≤ 3.95] = 0.725
where; P [ + 3.95 < K ] = P [K < - 3.95]
P[K< 3.95] - P [K > - 3.95] =0.725
P [K < 3.95] - [ 1- P[K < 3.95]] = 0.725
P[k < 3.95] - 1 + P [ K < 3.95] = 0.725
3.95 P [ K < 3.95] -1 = 0.725
3.95 P [ K < 3.95] = 1.725
P [ K < 3.95] = 1.725/3.95
P [ K < 3.95] = 0.4367
P [ K > 3.95] = 1 - P[K< 3.95]
P [ K > 3.95] = 1 - 0.4367
P [ K > 3.95] = 0.5633
Answer:
D for the first one A for the second
Answer: See Explanation
Step-by-step explanation:
Take the amount of money and divide by the ounces for how much it costs per ounce
1.35 / 12 = 0.1125 per ounce
2.10 / 20 = 0.105 per ounce
3.60 / 32 = 0.1125 per ounce
The Big Swig would be the best deal because the cost per ounce is the lowest, getting you the cheaper price for a good size. I believe I did this right, hope I could help.