Difference between revisions of "Mock AIME 5 2005-2006 Problems/Problem 9"
m (Created page with "== Problem == == Solution == == See also == {{Mock AIME box|year=2005-2006|n=5|source=76847|num-b=8|num-a=10}} Category:Intermediate Combinatorics Problems") |
m (→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | <math>13</math> nondistinguishable residents are moving into <math>7</math> 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 <math>4</math> residents? | ||
| + | |||
| + | == Solution == | ||
== Solution == | == Solution == | ||
Latest revision as of 20:18, 8 October 2014
Contents
Problem
nondistinguishable residents are moving into 
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 
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 | ||
