Jerry likes to play with numbers. One day, he wrote all the integers from to on the whiteboard. Then he repeatedly chose four numbers on the whiteboard, erased them, and replaced them by either their sum or their product. (For example, Jerry's first step might have been to erase , , , and , and then write either , their sum, or , their product, on the whiteboard.) After repeatedly performing this operation, Jerry noticed that all the remaining numbers on the whiteboard were odd. What is the maximum possible number of integers on the whiteboard at that time?
Pick one
Solution
Each time this operation was performed, the number of even integers on the whiteboard was reduced by at most . There were even integers on the whiteboard initially. Because and , Jerry needed at least operations to eliminate all of them. After operations there were numbers on the whiteboard.
To see how all the even numbers could have been eliminated using these operations, suppose Jerry chose , , , and and replaced them by their sum, for . For the final operation, Jerry could have erased , , , and and replaced them with their sum. Then after these operations, all numbers on the whiteboard were odd.
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.