Maths Olympiad Prep

Library / /225 of 377

Algebra Difficulty 5.2 AIME, harder Prove it United States

Problem:

If nn is a positive integer, let s(n)s(n) denote the sum of the digits of nn. We say that nn is zesty if there exist positive integers xx and yy greater than 1 such that xy=nx y = n and s(x)s(y)=s(n)s(x) s(y) = s(n). How many zesty two-digit numbers are there?

Solution

Solution:

Let nn be a zesty two-digit number, and let xx and yy be as in the problem statement. Clearly if both xx and yy are one-digit numbers, then s(x)s(y)=ns(n)s(x) s(y) = n \neq s(n). Thus either xx is a two-digit number or yy is. Assume without loss of generality that it is xx. If x=10a+bx = 10a + b, 1a91 \leq a \leq 9 and 0b90 \leq b \leq 9, then n=10ay+byn = 10a y + b y. If both aya y and byb y are less than 1010, then s(n)=ay+bys(n) = a y + b y, but if either is at least 1010, then s(n)<ay+bys(n) < a y + b y. It follows that the two digits of nn share a common factor greater than 11, namely yy. It is now easy to count the zesty two-digit numbers by first digit starting with 22; there are a total of 5+4+5+2+7+2+5+4=345 + 4 + 5 + 2 + 7 + 2 + 5 + 4 = 34.

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.