Problem:
A pair of successive numbers in the same row is called a switch pair if one number in the pair is even and the other is odd.
Prove that the number of switch pairs in row is at most twice the number of odd numbers in row .
Solution
Solution:
Each switch pair contains an odd number, and each odd number can belong to at most two switch pairs (since it has only two neighbors).
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.