BDMO NATIONAL JUNIOR 2014/10
-
- Posts:29
- Joined:Mon Jan 23, 2017 10:32 am
- Location:Rajshahi,Bangladesh
please explain the solution which you are going to give
- Attachments
-
- Screenshot_2017-01-30-21-12-35-1.png (23.25KiB)Viewed 2383 times
- Kazi_Zareer
- Posts:86
- Joined:Thu Aug 20, 2015 7:11 pm
- Location:Malibagh,Dhaka-1217
Re: BDMO NATIONAL JUNIOR 2014/10
Hint:
We cannot solve our problems with the same thinking we used when we create them.
- ahmedittihad
- Posts:181
- Joined:Mon Mar 28, 2016 6:21 pm
Re: BDMO NATIONAL JUNIOR 2014/10
Let $a_i$ be the number of chocolates eaten in total to day $i$. So, $0<a_1<a_2<...<a_{58}<101$ implies $15<a_1+15<a_2+15<...<a_{58}+15<116$. Now, among the $116$ numbers $a_1$,$...$, $a_{58}$, $a_1+15$,$...$, $a_{58}+15$. So there are indices $x$, $y$ such that $a_x+15=a_y$. Implying that Oindri ate exactly $15$ chocolates from day $x+1$ to day $y$.
Frankly, my dear, I don't give a damn.