2 Jameela needs to store ten packages in boxes. She has a list showing the size of each package. The boxes are all the same size and Jameela can use up to six of these boxes to store all the packages.
- Which of the following is a question that Jameela could ask which leads to a construction problem? Justify your choice.
- In how many different ways can I fit the packages in the boxes?
- How can I fit the packages in the boxes?
The total volume of the packages is \(1 \mathrm {~m} ^ { 3 }\). The volume of each of the six boxes is \(0.25 \mathrm {~m} ^ { 3 }\). - Explain why a solution to the problem of storing all the packages in six boxes may not exist.
The volume of each package is given below.
| Package | A | B | C | D | E | F | G | H | I | J |
| Volume \(\left( \mathrm { m } ^ { 3 } \right)\) | 0.20 | 0.05 | 0.15 | 0.25 | 0.04 | 0.03 | 0.02 | 0.02 | 0.12 | 0.12 |
- By considering the five largest packages (A, C, D, I and J) first, explain what happens if Jameela tries to pack the 10 packages using only four boxes.
You may now assume that the packages will always fit in the boxes if there is enough volume.
- Use first-fit to find a way of storing the packages in the boxes. Show the letters of the packages in each box, in the order that they are packed into that box.
The order of the packages within a box does not matter and the order of the boxes does not matter. So, for example, having A and E in box 1 is the same as having E and A in box 2 , but different from having A in one box and E in a different box.
- Suppose that packages A and B are not in the same box. In this case the following are true:
- there are 8 different ways to put any or none of \(\mathrm { E } , \mathrm { F } , \mathrm { G }\) and H with A
- 3 include F with A
- 3 include G with A
- 1 includes both F and G with A
Use the inclusion-exclusion principle to determine how many of the 8 ways include neither package F nor package G.