Maths Olympiad Prep

Library / /527 of 740

Combinatorics Difficulty 5.2 AIME, harder Prove it United States

Problem:

The integers from 11 to 99 are arranged in a 3×33 \times 3 grid. The rows and columns of the grid correspond to 66 three-digit numbers, reading rows from left to right, and columns from top to bottom. Compute the least possible value of the largest of the 66 numbers.

Solution

Solution:

The 55 cells that make up the top row and left column are all leading digits of the three-digit numbers. Therefore, the largest number has leading digit at least 55, achievable only if 6,7,86,7,8, and 99 are placed in the bottom right 2×22 \times 2 square. Then, the only three-digit numbers with tens digit less than 66 are the top row and the left column, so unless 55 is in the top left corner, the three-digit number starting with 55 will be at least 560560.

Now observe 55 is next to two other digits; if they are not 11 or 22 in some order, then either the top row or left column will read at least 530530. Thus we can assume 55 is next to 11 or 22. The next-smallest remaining digit is 33, so the three-digit number starting with 5252 must be at least 523523. This is achievable as shown below.

523
167
489

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.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.