Let be an -digit positive integer, , and be a -digit positive integer, . Then there are ways to insert entirely between two adjacent digits of , resulting in an -digit positive integer . For example, if and , there are three insertion methods: can be 135991, 193591, or 199351.
If for every that is divisible by , inserting into in any way results in a that is also divisible by , then is called a harmonious number. Among the 15 numbers , the number of harmonious numbers is
(A) 6.
(B) 8.
(C) 10.
(D) 11.
(3rd "Five Sheep Cup" Junior High School Mathematics Competition, 1991)
Problem 975
Official solution
[Solution]By checking each number, we can easily find:
(1) 1 is a harmonious number;
(2) If is divisible by 2, then the last digit of is even. Inserting 2 arbitrarily into results in the last digit of still being even, so is divisible by 2. Therefore, 2 is a harmonious number;
(3) Note that: A natural number is divisible by 3 if and only if the sum of its digits is also divisible by 3. It is easy to verify that 3 is a harmonious number;
(4) If is divisible by 11, then the difference between the sum of the digits in odd positions and the sum of the digits in even positions of is a multiple of 11. After inserting 11 arbitrarily into to get , the difference between the sum of the digits in odd positions and the sum of the digits in even positions remains unchanged, i.e., it is still a multiple of 11, so is divisible by 11. Therefore, 11 is a harmonious number;
Similarly to (2), we can prove that 5 and 10 are harmonious numbers;
Similarly to (3), we can prove that 9 is a harmonious number;
Since 2 and 3 are harmonious numbers, we can prove that 6 is a harmonious number;
Since 3 and 5; 2, 3, and 11; 9 and 10 are harmonious numbers, we can prove that 15, 66, and 90 are harmonious numbers.
In addition, it can be calculated that 4, 7, 8, and 12 are not harmonious numbers.
Thus, there are 11 harmonious numbers among the above numbers.
Therefore, the answer is .