Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

If the number of ways of selecting $n$ cards out of unlimited number of cards bearing the number $0,9,3$ so that they can't be used to write the number $903$ is $93$ then $n$ is

share|improve this question
add comment

1 Answer 1

If you select $n$ cards and you cannot make 903, then you know that those $n$ cards can only be one or two distinct numbers. The number of ways to select $n$ cards that can only be one or two distinct numbers (out of 0, 9, 3) is $$ 3 + 3(n-1) $$ because there are 3 ways to pick one distinct number ($n$ zeroes, $n$ nines, $n$ threes) and for each pair of numbers are there are $n-1$ ways to pick $n$ cards of those two distinct numbers (pick between 1 and $n-1$ cards of one number, and the rest for the other number).

So you want this quantity to be $93$, which makes $n$ be $31$.

share|improve this answer
add comment

Your Answer

 
discard

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.