Consider drawing n semicircles on and above a horizontal line, with no two semicircles intersecting. In parts (a) and (b) of Fig. we find the two ways this can be done for n = 2; the results for n = 3 are shown in parts (c)-(g).
Figure
i) How many different drawings are there for four semicircles?
ii) How many for any n > 0? Explain why.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.