2024 AMC 10B Problem 16

Below is the professionally curated solution for Problem 16 of the 2024 AMC 10B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2024 AMC 10B solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:parityinvariantoptimization

Difficulty rating: 1800

16.

Jerry likes to play with numbers. One day, he wrote all the integers from 11 to 20242024 on the whiteboard. Then he repeatedly chose four numbers on the whiteboard, erased them, and replaced them with either their sum or their product. (For example, Jerry's first step might have been to erase 1,2,3,1, 2, 3, and 5,5, and then write either 11,11, their sum, or 30,30, their product, on the whiteboard.) After repeatedly performing this operation, Jerry noticed that all the remaining numbers on the board were odd. What is the maximum possible number of integers on the board at that time?

10101010

10111011

10121012

10131013

10141014

Solution:

Among 1,,20241, \ldots, 2024 there are 10121012 even numbers and 10121012 odd. Each operation eats 44 numbers and writes back 1,1, so the count falls by 3;3; to keep it high we want as few operations as possible. Every even number has to go, and a move that produces an odd result can clear at most 33 evens at once (one odd plus three evens sums to odd). Clearing all 10121012 evens therefore takes at least 1012/3=338\lceil 1012/3 \rceil = 338 moves. And that's achievable: 337337 moves of "one odd ++ three evens \to odd sum" wipe out 10111011 evens, then one move of "three odds ++ one even \to odd sum" gets the last. That leaves 20243338=10102024 - 3 \cdot 338 = 1010 numbers. Therefore, the answer is A.

Problem 16 in Other Years