Maths Olympiad Prep

Library / Japan Junior Mathematical Olympiad /1 of 18

Japan Junior Mathematical Olympiad

Algebra Difficulty 3.3 AMC 10/12 Prove it Japan

Let xx be a 2-digit positive integer and yy be a 1-digit positive integer. Suppose that the ten's digit of xx, the one's digit of xx and yy are all distinct. Determine the maximum possible value the product xyxy can take.

Solution

Let aa and bb be the ten's digit and the one's digit of xx, respectively. Since we are concerned with the maximum value of xyxy and since a,b,ya, b, y are distinct by assumption, it is clear that it suffices to consider the situation where a,b,ya, b, y are chosen from 7,8,97, 8, 9. If the numbers for aa and bb are chosen, then clearly if the number for aa is bigger than the number for bb, the product xyxy becomes larger. Thus it is enough to consider the three cases: 87×987 \times 9, 97×897 \times 8 and 98×798 \times 7. Of these three numbers the largest is 87×9=78387 \times 9 = 783, which is the desired answer.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

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