Chocolates for Wrappers

Let's think of chocolates and wrappers separately. If you start with n chocolates and n wrappers, you will end up with 2n-1 chocolates and 1 wrapper. This is because 2 wrappers can be traded for 1 chocolate and 1 wrapper. In this way,

3 wrappers can be traded for 1 chocolate and 2 wrappers, and the 2 wrappers can be traded for 1 chocolate and 1 wrapper. The overall exchange is 3 wrappers to 2 chocolates and 1 wrapper.

Thus, n wrappers can be exchanged for n-1 wrappers.

Thus, n chocolates and n wrappers can be exchanged for 2n-1 wrappers.

Let n=11.

2n-1=21

Ans: $\boxed{21}$

After removing the 11 wrappers, Amit can buy 5 chocolates with 10 wrappers and subtract 1.If he removed the wrappers again, he will get 6, and with that he will buy another 3 chocolates, and he will obtain 3 wrappers, he will buy 1 chocolate and he will have 1 remaining wrapper, that with the wrapper of the last chocolate, he will be able to buy one more chocolate. At the end, we add the bought chocolates: 11 +5 +3 +1 +1=21. This way I came to the answer.