If $ABCD$ is a parallelogram such that $\angle BAD=\frac{\pi}{4}$, $AB=\sqrt{2}$, $AD=1$ then we shall say that $ABCD$ is a good parallelogram. Parallelograms can be rotated by any angle.
a) Prove that in a rectangular container $2 \times n$ ($n \ge 2$) cannot be packed more than $2n-2$ good parallelograms (packing must be without overlaps between parallelograms).
b) Prove that in a rectangular container $4 \times 4$ cannot be packed more than $12$ good parallelograms (packing must be without overlaps between parallelograms).
My work. It is easy to pack $2n-2$ good parallelograms into rectangular container $2 \times n$. The area of the good parallelogram is $1$. The area of the rectangular container $2 \times n$ is $2n$. Obviously, parallelograms will not be able to cover every region of the rectangular container. Therefore, in a rectangular container $2 \times n$ ($n \ge 2$) cannot be packed more than $2n-1$ good parallelograms. But I have no idea how to improve the evaluation for one parallelogram.
In general the packing problem is a very difficult problem. If you want to give an inductive proof, you have to eliminate the following possibility, in which 3 parallelograms have some region in the new added 2×1 rectangle.