Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

Eyad Group Title

~I Need Someone Who Understand Permutations And Combinations *Very well* ..~

  • one year ago
  • one year ago

  • This Question is Closed
  1. CliffSedge Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    For what? I don't know if I qualify as *very well* but I know how they work. You got something really complicated?

    • one year ago
  2. Eyad Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    @CliffSedge :They are not very Complicated but i want someone to help me through some questions ....

    • one year ago
  3. CliffSedge Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    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.

    • one year ago
  4. Eyad Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    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\] _

    • one year ago
  5. CliffSedge Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    Ok, so you know the combinations formula? \[nCk=\frac{n!}{k!(n-k)!}\]

    • one year ago
  6. Eyad Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    yea

    • one year ago
  7. CliffSedge Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    Ok, and as a start, n≥k so it has to be at least 8, just given the values of k.

    • one year ago
  8. CliffSedge Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    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.

    • one year ago
  9. CliffSedge Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    Sorry, should have said "e.g. Show if ... ≥ ..." Because it might not.

    • one year ago
  10. Eyad Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    :D

    • one year ago
  11. Eyad Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    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 :)

    • one year ago
  12. CliffSedge Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    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 . . .

    • one year ago
  13. CliffSedge Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    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!

    • one year ago
  14. Eyad Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    nvm ,i will find a way for it :) Ty again :)

    • one year ago
    • Attachments:

See more questions >>>

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
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.