A student at Harvard named Kevin
Was counting his stones by 11
He messed up n times
And instead counted 9s
And wound up at 2007.
To be precise, Kevin divides 2007 stones into groups of 9 stones and 11 stones, where n of the groups have 9 stones in them. How many values of could make this limerick true?
(Kevin can mess up every time)
I have no idea how to solve this, but I think this question has already been answered here: https://web2.0calc.com/questions/a-student-at-harvard-named-kevin-was-counting