B because the top angle needs to be a little more than the bottom angle
Solution:
As always, try to find a way of looking at the problem that makes the solution simple. In this problem, regardless of the current state of the puzzle, a move consists of combining two clusters into a single cluster. Therefore every move reduces the number of clusters by 1. Since we begin with 2000 clusters (the single pieces) and end with 1 cluster, we need
\[2000-1=\boxed{1999}\]
moves to complete the puzzle.
The answer is D 21t
For each day is an increase of 21
Answer:
1 23 is the correct answer hope it's helpful to you