A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
Using mathematical induction to prove the following;
If there are n participants in a knock out tournament then prove that (n1) matches will be needed to declare the champion
anonymous
 5 years ago
Using mathematical induction to prove the following; If there are n participants in a knock out tournament then prove that (n1) matches will be needed to declare the champion

This Question is Closed

amistre64
 5 years ago
Best ResponseYou've already chosen the best response.0induction 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 :)

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0well we start with n = 2 and see that the proposition is true, mean if there are two players, only 1 match is needed

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0then suppose that it is true for n= k, meaning that if k players participate, we need k1 matches, n using this supposition we show that the given proposition is true for k +1 players
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.