Question

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?



Please give answers and how to solve it step by step thank you!!!

Answer 1

11

Explanation:

If i am correct n= the days so with the days adding up day 10 juan would have 55 of the 100 candies, day 11 he would have 66. The statement said at least 64, so it would have to be 64 or the closet amount to 64 but it cannot be lower than 64. So there for 66 is the closest to the given amount, and in order for juan to get 64 he would need to take candies out for 11 days.