Suppose you have n boards of length L each. Place the first board of length L/2n hanging

over the edge of a table. Place the next board with length L/2(n-1) hanging over the edge

of the first board. The next board should hang L/2(n-2) over the edge of the second board. Continue this way until the last board hangs L/2 over the edge of the (n - 1)st board.

Theoretically, this stack will balance. Compute the total overhang of the stack with

n = 8. Determine the least number of the boards n such that the total overhang is

greater than L. This means that the last board is entirely beyond the edge of the table.

What is the limit of the total overhang as n approaches 0?

### Recently Asked Questions

- I have done this problem severeal times and keep getting it wrong. How do u do this? Please show all work so I can understand. Thank you!

- Inguinal and umbilical hernia repairs are among the most common surgical procedures performed in the US. Optimal perioperative pain control regimens remain

- Please refer to the attachment to answer this question. This question was created from ACCT3030-HO-C8.