How many different possible games are there?
Let g(n) denote the number of different possible games with upper bound n. Express g(n) in terms of g(n − a) and g(n − b), where a and b are constants to be determined.
How many different possible games of length k are there?
Let {1
a1 < a2 < ... < ak = n} denote a game of length k. Consider the sequence defined by bi = ai − i + 1.