A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing

This Question is Closed

CliffSedge
 2 years ago
Best ResponseYou've already chosen the best response.1For what? I don't know if I qualify as *very well* but I know how they work. You got something really complicated?

Eyad
 2 years ago
Best ResponseYou've already chosen the best response.0@CliffSedge :They are not very Complicated but i want someone to help me through some questions ....

CliffSedge
 2 years ago
Best ResponseYou've already chosen the best response.1I'll at least take a look at one. I need to go in few minutes, though, but hopefully I can at least point you in the right direction.

Eyad
 2 years ago
Best ResponseYou've already chosen the best response.0hmmm. As a start : IF : \[\Large C^{n}_{8} \times C^{n}_{6} \ge C^{n}_{7} \times C^{n}_{5}\] Prove That : \[\Large n \ge13\] _

CliffSedge
 2 years ago
Best ResponseYou've already chosen the best response.1Ok, so you know the combinations formula? \[nCk=\frac{n!}{k!(nk)!}\]

CliffSedge
 2 years ago
Best ResponseYou've already chosen the best response.1Ok, and as a start, n≥k so it has to be at least 8, just given the values of k.

CliffSedge
 2 years ago
Best ResponseYou've already chosen the best response.1It might also help to look at a simpler case using slightly smaller numbers to see how the factorials simplify. e.g. Show that 6C5 X 6C3 ≥ 6C4 X 6C2. That may give you some further insight.

CliffSedge
 2 years ago
Best ResponseYou've already chosen the best response.1Sorry, should have said "e.g. Show if ... ≥ ..." Because it might not.

Eyad
 2 years ago
Best ResponseYou've already chosen the best response.0To be honest thats not giving me at least a small hint .. I was looking for a short way to end this question .. Anyway Ty for your help :)

CliffSedge
 2 years ago
Best ResponseYou've already chosen the best response.1If you play around with it a little bit, you'll see that the difference between n and k is important for the ultimate size of nCk  maybe also think of Pascal's Triangle . . .

CliffSedge
 2 years ago
Best ResponseYou've already chosen the best response.1Yeah, sorry, I'm feeling rushed, 'cause I need to go take care of some other matters, so the shortcut isn't coming to me at the moment. Good luck!

Eyad
 2 years ago
Best ResponseYou've already chosen the best response.0nvm ,i will find a way for it :) Ty again :)
Ask your own question
Ask a QuestionFind 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.