Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Greatguns of - India

    Uploaded by

    satyanarayana bh
    A team of 5 players can be chosen from 10 total players in (a) includes both the strongest and weakest player by first selecting the strongest and weakest players, then choosing the remaining 3 players from the remaining 8 players, which can be done in (8C3) ways.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Greatguns of - India

    Uploaded by

    satyanarayana bh
    2 views1 page
    A team of 5 players can be chosen from 10 total players in (a) includes both the strongest and weakest player by first selecting the strongest and weakest players, then choosing the remaining 3 players from the remaining 8 players, which can be done in (8C3) ways.

    Original Description:

    Original Title

    greatguns of_india.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A team of 5 players can be chosen from 10 total players in (a) includes both the strongest and weakest player by first selecting the strongest and weakest players, then choosing the remaining 3 players from the remaining 8 players, which can be done in (8C3) ways.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    Greatguns of - India

    Uploaded by

    satyanarayana bh
    A team of 5 players can be chosen from 10 total players in (a) includes both the strongest and weakest player by first selecting the strongest and weakest players, then choosing the remaining 3 players from the remaining 8 players, which can be done in (8C3) ways.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    For example, we can represent the bit pattern In how many ways can a

    team of 5 be chosenfrom 10 players so as to (a) includeboth the strongestand the weakest


    player?

    You might also like