anonymous
  • anonymous
Please use "mathematical Induction". If there are n participants in a knock out tournament then prove that n-1 matches will be needed to declare the champion
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
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.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
Iam, are you there?
anonymous
  • anonymous
Yes, Sir
anonymous
  • anonymous
If we solve it in this way.............

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
lets say that the thing is correct for k players, So we can say that k-1 matches are required to find a champion
anonymous
  • anonymous
So now, for k+1 player, we can say that to find out a winner out of k players we need k-1 matches
anonymous
  • anonymous
And the winner can play a game with the last one, so in all we need k matches
anonymous
  • anonymous
This is the way I solved the problem
anonymous
  • anonymous
But I think its not keeping the term "knock out" in place
anonymous
  • anonymous
Pretty much.
anonymous
  • anonymous
I mean, in a knock out match we can't say that there is a last player, and that player is playing with the winner of all the previous games
anonymous
  • anonymous
So this why I think my solution is incorrect
anonymous
  • anonymous
Well, I kind of liken these problems to geometrical ones where you're needing to show general properties via an assumption on a whole portion beforehand. We add a component to the end and work through the final leg of induction at that point. I see what you're saying with the knockout thing, but I have a suspicion there's a symmetry at play here, which means in the end, it doesn't matter if you attach the last player at the end. I'll have another look.
anonymous
  • anonymous
So your present view point is "I am correct"
anonymous
  • anonymous
Yes
anonymous
  • anonymous
But I am going to take a look at it using combinatorics.
anonymous
  • anonymous
I will be very much pleased if you do so
anonymous
  • anonymous
Okay. I have to finish preparing a lecture. I'll see what I can sort out. Did you finish the parabola problem?
anonymous
  • anonymous
Actually it was out of the scope of my syllabus. But still I did
anonymous
  • anonymous
good
anonymous
  • anonymous
I got it from the internet
anonymous
  • anonymous
But one thing I must tell you, among all the people I talked about the problem, you were the only one who had some idea
anonymous
  • anonymous
Well, good to hear...I guess. I've been extremely busy this week.
anonymous
  • anonymous
Some suggested that there was not enough information, and some said that the curve was just touching the x axis
anonymous
  • anonymous
Yes, I felt that you were busy, because I hardly saw you
anonymous
  • anonymous
No. You have to perform a linear transformation and a rotational one. At least, that's what I'd do, and invert.
anonymous
  • anonymous
Is this not just a permutation problem?
anonymous
  • anonymous
Yes I understand that, and without that rotation the problem looses all its fun
anonymous
  • anonymous
It becomes a trivial one
anonymous
  • anonymous
fun...watch out STEP
anonymous
  • anonymous
Any how thank you for all your time. And I will surely wathc out for STEP
anonymous
  • anonymous
*WATCH
anonymous
  • anonymous
If you could advice me on how to increase my concentration span, I would be very grateful
anonymous
  • anonymous
Not now (if you are busy)
anonymous
  • anonymous
Ha! If I knew that, I could help myself. I have the attention span of a gnat.
anonymous
  • anonymous
But some time later (when you have some time to spare)
anonymous
  • anonymous
LOL
anonymous
  • anonymous
The only things you can do are exercise and sleep and eat.
anonymous
  • anonymous
and maybe meditate, but I don't do that so I can't really comment.
anonymous
  • anonymous
I found that its all about the concentration span that separates the best from the rest
anonymous
  • anonymous
I mean I felt
anonymous
  • anonymous
And being the best, I though may be you will have some secret
anonymous
  • anonymous
And being the best, I thought may be you will have some secret
anonymous
  • anonymous
If you want a tip on taking cognitive ability tests, time yourself and don't spend too long on one question.
anonymous
  • anonymous
can u plz spare some thought on my question as well?
anonymous
  • anonymous
No, unfortunately, there're no secrets.
anonymous
  • anonymous
Just like everything else
anonymous
  • anonymous
Yes.
anonymous
  • anonymous
rsaad2, is your question about rain?
anonymous
  • anonymous
yes.
anonymous
  • anonymous
our cal with theory instructer mentioned it. i could not find the required info on internet
anonymous
  • anonymous
are you studying calculus of variations?
anonymous
  • anonymous
e.g. functionals?
anonymous
  • anonymous
no. its calculus with theory.
anonymous
  • anonymous
we were studying line integrals. so he mentioned itthere.
anonymous
  • anonymous
OK. If this is something you can leave me with, I may be able to look later. I have to do some prep. work for tomorrow. Is this for an assignment?
anonymous
  • anonymous
sure. no its not for an assignment.
anonymous
  • anonymous
ok. i'll look at it later.
anonymous
  • anonymous
thank you. =)

Looking for something else?

Not the answer you are looking for? Search for more explanations.