During a month with 30 days a baseball team plays at least 1 game a day, but no more than 45 games. Show that there must be a period of some number of consecutive days during which the team must play exactly 14 games.
@ganeshie8 @ikram002p
I have an idea about this but I'm not sure how to put it in words.
Nice, before that, could you explain me your interpretation of the question ?
Let the games played till ith day be x1+x2+x3..+xi..(i=1 to 30) Where x1,x2,...x30>=1 and what its asking to prove is that there exists two indices i and j such that summation from i=1 to j (xi) = 14. I guess we can keep days as pigeons.
@ganeshie8 is it correct ? :/
that looks good to me !
so..next :o
we need to choose the pigeons and holes a bit carefully
lets not rush deciding on that yet
alright..
but do keep that in mind, we will need to choose them once we're ready
sure :D
familiar with partial sums notation right ?
maybe I don't know it by name, show me ?
\(S_n\) represents the \(n\)th partial sum, the total number of games played over the first "n" days
alright.
using that notation, the total number of games played from "m"th day to "n"th day can be represented as : \[S_n-S_{m-1}\]
yep
\(S_n\) is total games played during first \(n\) days \(S_{m-1}\) is total games played during first \(m-1\) days
subtracting gives you the total number of games played from "m"th day to "n"th day
yeah..where n>m
yes
we want to show that \(S_n-S_{m-1}\) is \(14\) for some integers \(n\) and \(m\)
yes yes
lets try and figure out how to approach this
45 game per month or day ?
i think it should be month though :O
45 overall..maximum games..per month
well we have at least 30 games per month, assume each day they played 2 games then we would got 60 games per month >45, which means 2 is the maximum games played per day. now assume they played the max of 45 games means we are gonna arrange at most 45 games of 1 and 2 over 30 days. |dw:1449430580324:dw|
Join our real-time social learning platform and learn together with your friends!