Let be a 2-digit positive integer and be a 1-digit positive integer. Suppose that the ten's digit of , the one's digit of and are all distinct. Determine the maximum possible value the product can take.
Solution
Let and be the ten's digit and the one's digit of , respectively. Since we are concerned with the maximum value of and since are distinct by assumption, it is clear that it suffices to consider the situation where are chosen from . If the numbers for and are chosen, then clearly if the number for is bigger than the number for , the product becomes larger. Thus it is enough to consider the three cases: , and . Of these three numbers the largest is , which is the desired answer.
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.