Find the sum of all the two digit numbers which can be expressed as an integral multiple of the product of their digits.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The only such numbers are 1 1 , 1 2 , 1 5 , 2 4 , 3 6 , with total 9 8 . These are easy to find computationally, but a manual method is as follows: say the number is 1 0 a + b , where 1 ≤ a ≤ 9 and 1 ≤ b ≤ 9 (note that neither digit can be zero).
The equation we need these to satisfy is 1 0 a + b = k a b , where k is a positive integer.
Note that b = ( k b − 1 0 ) a ; so a divides b . We can write b = h a for some positive integer h . Since a ≤ 9 , we have h ≤ 9 as well.
The equation now becomes 1 0 a + h a = k h a 2 , which simplifies (since a > 0 ) to 1 0 + h = k h a . Dividing by h , we get h 1 0 + 1 = k a . So h must be a factor of 1 0 , and since it's less than or equal to 9 , this only leaves the set { 1 , 2 , 5 } . It's now a short case analysis to find the above list:
Case h = 1 : k a = 1 1 ; only solution is a = 1 , b = 1
Case h = 2 : k a = 6 ; solutions a = 1 , b = 2 ; a = 2 , b = 4 ; a = 3 , b = 6
(note we exclude a = 6 as this would give b = 1 2 , which is too large)
Case h = 5 : k a = 3 ; only solution is a = 1 , b = 5
Incidentally, these numbers appear here in the OEIS.