Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given a sequence $ {a_1, a_2, ..., a_n} $ and a number k I have to find the number of subsequences with k elements, containing the element $ a_k $. I know that the total number of all subsequences is $ 2^n $, but it doesn't seem to be very helpful here.

share|cite|improve this question
up vote 2 down vote accepted

If you are given that each sequence contains $a_k$ and you have $k$ elements total in the sequence, you only need $k-1$ other elements to fill up the rest of your sequence with, and you have $n-1$ other elements to choose from. It should be easier to count when you think about it like this.

share|cite|improve this answer
Is the answer just $ C^{k-1}_{n-1}?$ – Ormi Nov 24 '12 at 23:06
@UchihaMadara exactly! – Tom Oldfield Nov 25 '12 at 0:22

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.