 Quote by uart
Hi jbriggs444. The OP specified "Assume that all books are of the same size and those boxes must be completely filled up". So your partial result of 3060 was all that was required. 
|
Yes, 3060. But there's a much easier way.
Think of a box as containing four locations for books, and between them, and at the ends of the box, slots for very thin dividers, 5 slots in all. There are 14 dividers to go in each box and any number of them can occupy the same slot. When packing the box, left to right, a divider tells you to switch to the next book type. So the placement of dividers tells you exactly how a box is to be packed, and conversely, for any given choice of books for a box, arranging them in a canonical order determines the appropriate way to place the dividers; so this is a one-to-one mapping.
Now consider the book locations and dividers as just 18 things in a row. Four are book locations, 14 are dividers. Number of possible arrangements is 18 choose 4 = 3060.