Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Assume there are $n$ candies, each candy has a cover, where $2$ candy covers can exchange for a candy. Say if there are 2 candy, then total there will be $2$ candy and $2$ candy cover and in total $3$ candy. Now assume the case when a children has $n$ candy, how many candy can the children get overall? I try to formulate the question but not sure how to get the general formula.

share|cite|improve this question

First count the covers it gets. Say it has $n$ covers, then it can give away 2 and get one new cover. Makes a difference of 1. You stop when you have 1 cover left. So you exchange $n-1$ times. Every time you do an exchange you get a new candy. So you have the original $n$ candies, and the $n-1$ from exchanging, this gives $2n-1$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.