A box contains N tags numbered from 1 to N . In how many ways can I select J of the tags?

1 Answer

  • Anonymous
    1 decade ago
    Favorite Answer

    This is a combinatorics problem. We need to find N-choose-J (NCJ), or in other words, in how many ways can we choose J tags from a group of N. The equation for the combination function is:

    NCJ = N!/[(J!)*(N - J)!]

    So basically, if we don't know N or J, then the general formula is given above, or you can just use the combinations notation NCJ. N is superscripted, and J subscripted.

    You could also find the number as the Jth element of the Nth row of Pascal's triangle.

Still have questions? Get your answers by asking now.