Answer:
is the answer.
Explanation:
If we put a penny on the first square of a chess board, 2 on second, six on third and we keep on doing double for the next square then it will form a geometric sequence in the form of
![T_(n)=2^(n-1)](https://img.qammunity.org/2019/formulas/mathematics/high-school/yhi73hmxpfcq1ygddxy25ygcbn653sx36g.png)
1, 2, 4, 8, 16.........n terms
Now we have to calculate the pennies on square 33 that will be
So pennies on 33rd square will be
![T_(33)=2^(33-1)=2^(32)](https://img.qammunity.org/2019/formulas/mathematics/high-school/ylhdubnrhek09n75viokz4cgtoh1yquucf.png)