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.
Iam, are you there?
If we solve it in this way.............
lets say that the thing is correct for k players, So we can say that k-1 matches are required to find a champion
So now, for k+1 player, we can say that to find out a winner out of k players we need k-1 matches
And the winner can play a game with the last one, so in all we need k matches
This is the way I solved the problem
But I think its not keeping the term "knock out" in place
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
So this why I think my solution is incorrect
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.
So your present view point is "I am correct"
But I am going to take a look at it using combinatorics.
I will be very much pleased if you do so
Okay. I have to finish preparing a lecture. I'll see what I can sort out. Did you finish the parabola problem?
Actually it was out of the scope of my syllabus. But still I did
I got it from the internet
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
Well, good to hear...I guess. I've been extremely busy this week.
Some suggested that there was not enough information, and some said that the curve was just touching the x axis
Yes, I felt that you were busy, because I hardly saw you
No. You have to perform a linear transformation and a rotational one. At least, that's what I'd do, and invert.
Is this not just a permutation problem?
Yes I understand that, and without that rotation the problem looses all its fun
It becomes a trivial one
fun...watch out STEP
Any how thank you for all your time. And I will surely wathc out for STEP
If you could advice me on how to increase my concentration span, I would be very grateful
Not now (if you are busy)
Ha! If I knew that, I could help myself. I have the attention span of a gnat.
But some time later (when you have some time to spare)
The only things you can do are exercise and sleep and eat.
and maybe meditate, but I don't do that so I can't really comment.
I found that its all about the concentration span that separates the best from the rest
I mean I felt
And being the best, I though may be you will have some secret
And being the best, I thought may be you will have some secret
If you want a tip on taking cognitive ability tests, time yourself and don't spend too long on one question.
can u plz spare some thought on my question as well?
No, unfortunately, there're no secrets.
Just like everything else
rsaad2, is your question about rain?
our cal with theory instructer mentioned it. i could not find the required info on internet
are you studying calculus of variations?
no. its calculus with theory.
we were studying line integrals. so he mentioned itthere.
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?
sure. no its not for an assignment.
ok. i'll look at it later.
thank you. =)