We say we *multiply a box* when we place it in the machine. We say we *multiply a box* 2 times if we multiply the box and then multiply each of the resulting boxes. Similarly, we say we *multiply a box* $N$ times if we do so $N-1$ times and then multiply each of the resulting boxes, obtaining a total of $2^N$ boxes.

a. We start by multiplying the box 5 times. Initially, we have a box with a value of 0. Then one with a value of 1 and one with a value of $-1$. Let's summarize this by counting how many we have for each value, that is, $1:1$ and $-1:1$. When we multiply once more, we get $2:1, 0:2$, and $-2:1$. Next $3:1, 1:3, -1:3$, and $-3:1$. And then $4:1, 2:4, 0:6, -2:4$, and $-4:1$. By making the last multiplication, we keep each box along with the one that came out of the machine, we count how many pairs of each type we have, and we get $(5,3):1, (3,1):4, (1,-1):6, (-1,-3):4$, and $(-3,-5):1$.

We now open one box from each pair. By doing this, we will get at least $-5 - 3 \cdot 4 - 1 \cdot 6 + 1 \cdot 4 + 3 = -16$ points in the worst-case scenario. Since there is a pair that contains 5 and 3, we are sure that among the boxes we open, we will see a 5 or a 3. If we see a 5, we know that the value of the other box in its pair is 3. If we see a 3, we know that the value of the other box is 5 or 1. In any case, we have identified a box which has not been opened yet and whose value we know for sure is at least 1.

We multiply this box 10 times. The average value of the resulting 1024 boxes is the same as the original, so if we open all of them, we will sum at least 1024 points. As we previously subtracted at most 16 points, we end up with more than 1000 points.

b. We start as in part (a). Notice that when opening the first 16 boxes, we can end up with $-16$ points, but we can pass through $-5 - 3 \cdot 4 - 1 \cdot 6 = -23$. Then we repeat this step by multiplying 5 times the box that we know has a value of at least 1. By opening the 16 boxes, we will get to a score of at least 0 points (1 more than before for each box). And we can pass through $-4 - 2 \cdot 4 = -12$, which adds up to exceeding $-28$ (since we could have started from $-16$). We keep the box paired with the largest one we opened; this one has a value of at least 2. By repeating the multiplication 5 times with this box and opening one from each pair, we will obtain at least 16 points and will pass through $-3 - 1 \cdot 4 = -7$ in the worst case, which adds up to $-23$ (considering the previous $-16$). By doing it once more starting from the box with a value of at least 3, we will obtain at least 32 points and will pass through, in the worst case, $-2$, but initially, we had at least 16 points. We will no longer pass through numbers less than $-28$ (starting from the fact that we are sure the initial box is at least 5, all boxes have non-negative values). In each step, we add at least 16 points (actually, more), so we will exceed 1000000 points in finite steps.