For each positive integer denote the number of the positive integers with digits, divisible with , formed with digits , , or .
a) Compute , , and .
b) Find so that
For each positive integer denote the number of the positive integers with digits, divisible with , formed with digits , , or .
a) Compute , , and .
b) Find so that
a) (0 is divisible with ), (the numbers , , and are divisible with ), , (because the first digit cannot be and the last two can be , , , and ), (because the first digit cannot be , for the second digit there are possibilities and the last two digits can be , , , and ).
b) If , then a number which fulfills the hypothesis is of the form
where its first digit can have three values, each of the digits , , , can be chosen in ways and the last two digits can be , , , or . So , for every .
For , , whence , , .