Proof by Strong Induction

preview_player
Показать описание
In this video I use the postage stamp problem to discuss proofs by strong induction.
Рекомендации по теме
Комментарии
Автор

Thank you very much. I never got that in the whole semester. Tomorrow is my final. This video will save my grade. ❤️

hayatsguild
Автор

shouldn't it be 10 < j < k (assume the < are less than or equal to signs). Although k - 2 is true for this statement, there can be situations where k - 2 is not true since everything is true starts from k. another way to say this is, if j was equal to the value on the left, then there can be situations where that statement is false so shouldn't we make the left value the value plus the lower increment number

issacoh
Автор

Why do you prove the amount of postage is greater than 8, not 6? Is it because that is the first value that combines 5 and 3, whereas the values before that are independent?

sweetlikecinnamon
Автор

How we can find the easy way to identify the starting value of the strong index..is there any formula or key that can use for finding a value...

maheshm
Автор

Thanks for the video. I hope to never take this class again. Discrete math is hard

stopthecap
Автор

Prove by induction (ordinary or strong) that any amount
(integer) of postage greater than 27 takas can be formed with a
combination of five and eight taka coins.

syedahnafnakiburrahman