Combinatorics Pigeonhole problem

[ivanpeter]

Hello to all! So i have to do this problem: In the course of an year of 365 days Peter solves combinatorics problems. Each day he solves at least 1 problem, but no more than 500 for the year. Prove that for the year there exists an interval of consecutive days in which he had solved exactly 229 problems. PS: I think that the pigeonhole principle can be used here , but i just can't show a meaningful and descriptive way of proving it.Big thanks to anyone who can help !

[Guest]

This is essentially the same as the problem given at:
http://www.cut-the-knot.org/pigeonhole/aspirin.shtml
but with different numbers. The solution given on the site can be easily modified to solve your problem.

Hope this helps,

R. Baber.