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!!!

Hey everyone! this question is a challenge question. for 50 points if you wish. all you have to do is answer the correct it has to be correct, in under 50 seconds, and i will make you the ! you want to accept this challenge. i already know! i mean, it's 50 free points! here is the question: 11x2= answer this correct, you get two prizes. don't forget. you only have 50 seconds or it wont happen. get it correct in under 50 seconds! that's not bad. so stop reading this long thing and !