mathematics

3. A dish contains 100 candies. Juan removes candies from the dish each day and no candies are added to the

3. A dish contains 100 candies. Juan removes candies from the dish each day and no
candies are added to the dish. On day 1, Juan removes 1 candy. On day 2, Juan
removes 2 candies. On each day that follows, Juan removes 1 more candy than he
removed on the previous day. After day n, Juan has removed a total of at least 64
candies. What is the smallest possible value of n?
give answers and how to solve it step by step !

Leave a Reply

Your email address will not be published.