1987 USAMO Problems/Problem 5
is a sequence of 0's and 1's. T is the number of triples with which are not equal to (0, 1, 0) or (1, 0, 1). For , is the number of with plus the number of with . Show that . If n is odd, what is the smallest value of T?
This problem needs a solution. If you have a solution for it, please help us out by adding it.
|1987 USAMO (Problems • Resources)|
|1 • 2 • 3 • 4 • 5|
|All USAMO Problems and Solutions|
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.