Using mathematical induction to prove the following-;
If there are n participants in a knock out tournament then prove that (n-1) matches will be needed to declare the champion
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
induction eh.... the intuition is there, but how to "prove" it is fuzzy. I remember reading something about: taking a concrete example like n=3 and deducing that the rule follows from that example; then take another concrete example like n=5 and following it thru to the end,
then use k for the example, then conclude the results. proofs have never been my strong point :)
well we start with n = 2 and see that the proposition is true, mean if there are two players, only 1 match is needed
then suppose that it is true for n= k, meaning that if k players participate, we need k-1 matches, n using this supposition we show that the given proposition is true for k +1 players