Suppose sequence consists of nine terms, which satisfy and for any . Then the number of sequences like this is ______.
Solution
Let (). Then for each satisfying the given condition, we have
Conversely, a sequence of eight terms satisfying 1 can uniquely determine a sequence in the question.
In each , there are obviously even number of and the same number of , with the remainder being . Or, in other words, the numbers of and are both , while the number of is . Here, it is easy to check that can only be . Once is given, there are ways to construct .
Therefore, the total number of satisfying ① is
The answer is 491.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.