Mock AIME 5 2005-2006 Problems/Problem 9

Revision as of 20:18, 8 October 2014 by Timneh (talk | contribs) (Problem)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

$13$ nondistinguishable residents are moving into $7$ distinct houses in Conformistville, with at least one resident per house. In how many ways can the residents be assigned to these houses such that there is at least one house with $4$ residents?

Solution

Solution

See also

Mock AIME 5 2005-2006 (Problems, Source)
Preceded by
Problem 8
Followed by
Problem 10
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15