anonymous
  • anonymous
~I Need Someone Who Understand Permutations And Combinations *Very well* ..~
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.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
For what? I don't know if I qualify as *very well* but I know how they work. You got something really complicated?
anonymous
  • anonymous
@CliffSedge :They are not very Complicated but i want someone to help me through some questions ....
anonymous
  • anonymous
I'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.

Looking for something else?

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

More answers

anonymous
  • anonymous
hmmm. 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\] _
anonymous
  • anonymous
Ok, so you know the combinations formula? \[nCk=\frac{n!}{k!(n-k)!}\]
anonymous
  • anonymous
yea
anonymous
  • anonymous
Ok, and as a start, n≥k so it has to be at least 8, just given the values of k.
anonymous
  • anonymous
It 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.
anonymous
  • anonymous
Sorry, should have said "e.g. Show if ... ≥ ..." Because it might not.
anonymous
  • anonymous
:D
anonymous
  • anonymous
To 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 :)
anonymous
  • anonymous
If 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 . . .
anonymous
  • anonymous
Yeah, 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!
anonymous
  • anonymous
nvm ,i will find a way for it :) Ty again :)

Looking for something else?

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