2024 AMC 8

Complete problem set with solutions and individual problem pages

Problem 16 Hard

Minh enters the numbers 1 through 81 into the cells of a 9 \times 9 grid in some order. She calculates the product of the numbers in each row and column. What is the least number of rows and columns that could have a product divisible by 3?

  • A.

    8

  • B.

    9

  • C.

    10

  • D.

    11

  • E.

    12

Answer:D

Solution 1

Note you can swap/rotate any configuration of rows, such that all the rows and columns that have a product of 3 are in the top left. Hence the points are bounded by a a \times b rectangle. This has ab area and a+b rows and columns divisible by 3. We want ab\geqslant 27 and a+b minimized.

If ab=27, we achieve minimum with a+b=9+3=12.

If ab=28,our best is a+b=7+4=11. Note if a+b=10, ab=25. Because 25<27, there is no smaller answer, and we get \boxed{\textbf{(D)} 11}.

 

Solution 2

For a row or column to have a product divisible by 3, there must be a multiple of 3 in the row or column. To create the least amount of rows and columns with multiples of 3, we must find a way to keep them all together, to minimize the total number of rows and columns with multiples of threes in it. From 1 to 81, there are 27 multiples of 3 (81/3 = 27). So we have to fill 27 cells with numbers that are multiples of 3. If we put 25 of these numbers in a 5 * 5 grid, there would be 5 rows and 5 columns (10 in total), with products divisible by 3. However, we have 27 numbers, so 2 numbers still need to be put in the 9 * 9 grid. If we put both numbers in the 6th column, but one in the first row, and one in the second row, (next to the 5 by 5 grid already filled), we would have a total of 6 columns now, and still 5 rows with products that are multiples of 3. Since 6 + 5 = 11, the answer is \boxed{\textbf{(D)} 11}