Answer:
Proof
Step-by-step explanation:
Given:
- If you run 1 or 2 miles
- You can always run 2 miles more after running specified number of miles
Find:
- Prove that you can run any number of miles
Solution:
- Let M ( n ) be " You can run the nth mile"
Basis step: n = 1 and n = 2
- M(1) and M(2) are True, because you can run one or two miles as given in statement.
Inductive Step:
- We assume that M(1) , M(2), ......, M( k ) are all true, thus you can run the first k miles.
- We then need to prove that M ( k+ 1 ) is also true.
- Since M ( k - 1 ) is true then M ( k + 1 ) is true. ( You can always run 2 miles more after running specified number of miles )
Conclusion:
- By the principle of strong induction, M ( n ) is true for all positive n integers.
Answer:
Step-by-step explanation:
the slope is positive and the y-intercepts is (0,0)
pls mark me brainliest
Answer to the question is b 1 4/5
Answer:
Step-by-step explanation: ads
Answer:
dr. potter provides 54 vaccinations TOTAL (including both measles and polio).
p+m=54
since there are 4 doses of polio and of measles, you have to use a variable to distinguish how many doses were given for measles and polio out of 142 given doses.
4p+2m=142
p+m=54
4p+2m=142
^^system of equation
p+m=54
4p+2m=142
p=54-m
4p+2m=142
(substitute 54-m to the equation)
4(54-m)+2m=142
m=37
(collect like terms, then substitute the value of m into the first equation)
p=54-37
p=17
(m, p)=(37, 17)
Step-by-step explanation:
i hope this helps, sorry for the wait
